Encoded Network Paths for Compact, Table-Free Source Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network path encoding and decoding schemes result in large frame headers, increased MTU calculation complexity, delay, and limited applicability due to small message frame and packet address space, requiring nodes to retain routing tables and perform calculations.
Innovation Solution
A novel path encoding and decoding scheme that utilizes a flat reference, such as a path index or sequence number, to represent unique network paths without retaining routing tables, allowing nodes to decode and forward messages efficiently using a common network path encoding algorithm.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If existing network path encoding schemes are used to represent unique network paths, then path identification is achieved, but frame header size increases and MTU calculation complexity increases
Solution Approach 1:
The network path encoding is segmented into a compact format that fits within standard frame headers. The path information is divided into essential components that can be represented efficiently, separating the path identification from unnecessary routing details, thereby reducing frame header size while maintaining path identification accuracy.
Solution Approach 2:
The patent changes the parameters of path encoding from detailed routing information to a compressed representation that uses fewer bits. By transforming the path data into a more compact parameter format, the frame header size is reduced while still preserving the ability to uniquely identify network paths.
2Measurement precision
If nodes retain routing tables and perform calculations to determine paths, then path determination accuracy is improved, but calculation overhead and delay increase
Solution Approach 1:
The routing information is prepared in advance and encoded into the path field before packet transmission. Network nodes receive pre-calculated path information that eliminates the need for real-time routing table lookups and path calculations, thereby reducing calculation delay while maintaining path determination accuracy.
Solution Approach 2:
The patent extracts the essential path determination function from the network nodes and relocates it to the packet source. By taking out the routing calculation burden from intermediate nodes and embedding the path information directly in the packet, calculation overhead and delay are reduced while path accuracy is preserved.
3Manufacturing precision
If detailed path information is included in packet headers, then routing precision is improved, but address space requirements increase
Solution Approach 1:
The patent implements a nested encoding structure where path information is embedded within the existing packet header format. By nesting the path data efficiently within available header fields and using compact representations, routing precision is maintained while minimizing the additional address space requirements.
Data Source
AI summary
Aspects of the subject disclosure may include, for example, identifying a network topology that includes a group of nodes and a number of segment reference values corresponding to network segments between pairs of nodes of the group of nodes. A message including a path index that corresponds to a particular network path of an indexed arrangement of unique paths is received, at a node of the group of nodes. The particular network path includes a particular sequence of nodes corresponding to the path index. The path index is decoded to obtain a decoding of the particular network path and a next node along the network path is identified according to the decoding of the particular network path allowing the message to be forwarded to the identified next node. Other embodiments are disclosed.