Network Node Prefix Range to Identifier Mapping

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional routing procedures in networks face inefficiencies due to unpredictable mappings of network address prefixes to identifiers, leading to incorrect routing, unnecessary resource consumption, and inefficient use of resources, especially when network changes occur.

Innovation Solution

Implementing a policy on network nodes to map network address prefixes within a range to corresponding sequential identifiers, only when a device associated with the prefix is discovered, thereby reducing unnecessary computations and resource usage.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If conventional routing procedures use individual routing decisions at each network node, then routing flexibility is maintained, but computing resources and time are excessively consumed

Engineering Contradiction:
Improverouting decision efficiencyVSAvoidcomputing resource consumption
Core Design Contradiction:
ProductivityVSUse of energy by moving object

Solution Approach 1:

The patent applies preliminary action by pre-establishing mapping relationships between network address prefixes and sequential identifiers before actual data transmission occurs. The network node proactively discovers devices and creates prefix-to-identifier mappings in advance, storing them in a data structure. When data packets need routing, the node simply performs fast lookups in this pre-built structure rather than performing complex routing computations in real-time, thus resolving the contradiction between routing efficiency and computing resource consumption.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If network nodes maintain comprehensive routing tables for all possible prefixes, then routing accuracy is improved, but memory resources and data structure size increase

Engineering Contradiction:
Improverouting accuracyVSAvoiddata structure entries
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent extracts only the necessary routing information from comprehensive routing tables. Instead of maintaining mappings for all possible network address prefixes, the system extracts and stores only those prefix-to-identifier mappings that are actually needed based on discovered devices. This selective extraction reduces the quantity of data structure entries while maintaining routing accuracy for active routes, resolving the contradiction between routing reliability and memory resource usage.

Inventive Principle:
Principle #2Taking out (Extraction)

3Adaptability or versatility

If unpredictable mappings are used for network address prefixes to identifiers, then adaptability to network changes is improved, but routing errors and resource wastage increase

Engineering Contradiction:
Improvenetwork change adaptabilityVSAvoidrouting correctness
Core Design Contradiction:
Adaptability or versatilityVSReliability

Solution Approach 1:

The patent applies parameter changes by systematically varying the mapping between network address prefixes and sequential identifiers based on the ordered position within prefix ranges. Instead of using completely unpredictable mappings, the system creates predictable mappings where the identifier is determined by a consistent function of the prefix's position in the address space. This maintains adaptability to network changes while ensuring routing correctness through predictable, reproducible mapping relationships.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS11863445B1Prefix range to identifier range mapping
Publication Date: 2024.01.02 JUNIPER NETWORKS INC
  • US11863445B1 patent drawing
  • US11863445B1 patent drawing
  • US11863445B1 patent drawing

AI summary

A network node may receive an indication of a range of network address prefixes and a corresponding range of sequential identifiers. The network node may generate a policy for mapping respective network address prefixes, having ordered positions within the range of network address prefixes, to respective identifiers having corresponding ordered positions within the corresponding range of sequential identifiers. The network node may discover a device associated with a network address having a network address prefix at an ordered position within the range of network address prefixes. The network node may map, based on the policy, the network address prefix to an identifier having an ordered position within the corresponding range of sequential identifiers, wherein the ordered position within the corresponding range of sequential identifiers corresponds to the ordered position within the range of network address prefixes. The network node may advertise the mapping to one or more neighbor nodes.