Partial Source Routing for Cross-Network Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing source routing techniques are associated with significant overhead, leading to delays and network congestion due to extensive routing data in packet headers, especially when packets traverse multiple nodes and networks.
Innovation Solution
The implementation of partial source routing techniques that use a short address format within a network and a long address format when crossing network boundaries, minimizing overhead by dynamically adjusting address formats based on network proximity and reducing the need for extensive routing data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If source routing techniques are used to route packets through multiple networks, then routing accuracy and destination reachability are improved, but routing overhead and packet header size increase significantly
Solution Approach 1:
The routing path is segmented into multiple hops, where each node maintains only the address of the next node in the path rather than the complete end-to-end routing information. This segmentation divides the large routing header into smaller per-node routing decisions, reducing the amount of routing data that needs to be processed at each node while maintaining overall routing accuracy.
Solution Approach 2:
The patent introduces a hierarchical dimension to routing by implementing partial source routing where only certain segments of the path require detailed address information. By transitioning from a flat complete-source-routing model to a hierarchical partial-routing model, the system reduces routing overhead while maintaining the ability to reach destinations across multiple networks.
2Reliability
If complete source routing information is included in packet headers, then routing reliability across multiple networks is improved, but network congestion and transmission delays increase
Solution Approach 1:
The patent extracts only the essential routing information needed for each hop from the complete source routing path. Instead of including all routing information in every packet, the system extracts and maintains only the next-hop address at each node, removing redundant routing data while preserving the reliability needed for cross-network routing.
Solution Approach 2:
Routing paths are predetermined and established before data transmission through route discovery protocols. The complete routing path is calculated in advance and stored in routing tables at each node, so that during actual data transmission, nodes only need to follow the pre-established path without performing complex routing decisions, thereby improving data transfer efficiency while maintaining reliability.
3Measurement precision
If 16-byte addresses are used for each node in the routing path, then node identification accuracy is improved, but packet header overhead and processing complexity increase
Solution Approach 1:
The patent applies local quality by using different address formats in different contexts: full 16-byte addresses are used when crossing network boundaries to ensure unique identification, while shorter addresses are used for local node identification within the same network. This localized adaptation of address length reduces overall header complexity while maintaining the precision needed for accurate node identification across networks.
Data Source
AI summary
Source routing techniques include sending data across several networks, while limiting source routing overhead. For example, the source routing techniques may use a first address format to route data to nodes along a routing path that are within a first network where a source node is located, and use a second address format to route the data to a node along the routing path that is within a second, different network. The node in the second network may similarly route the data through the second network using the first address format for nodes within the second network and, if needed, route the data to a node within a third network using the second address format. This may be repeated for any number of networks to reach a destination.