Network Routing via Zone-Based Route Repository Nodes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current link state routing methods in dynamic networks face significant overhead in managing and updating network resources due to continuous changes in load, bandwidth, and topology, leading to inefficient route selection and a lack of centralized route computation, as well as inadequate support for multimedia traffic demands.
Innovation Solution
Assigning nodes to first and second subsets of route repository nodes, where the second subset stores and computes route information using an algorithm, and routing traffic based on this information to reduce overhead and enhance centralized route computation, while supporting quality of service and route reservation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If link state routing is used to maintain complete network topology information at every node, then route selection capability is improved, but network overhead increases significantly due to continuous updates in dynamic topology
Solution Approach 1:
The patent segments the network into multiple zones or regions, where each zone maintains complete topology information locally. Nodes only need to exchange routing information with adjacent zones rather than maintaining complete network-wide topology, significantly reducing overhead while preserving route selection capability within each zone.
Solution Approach 2:
The patent extracts and stores complete network topology information in a centralized routing database or selected border routers, rather than replicating it at every node. Ordinary nodes only store partial routing information needed for local forwarding, reducing memory requirements and update overhead while maintaining access to complete topology when needed.
2Adaptability or versatility
If routing information is distributed across all nodes, then system decentralization is improved, but route computation efficiency deteriorates due to lack of consolidated view
Solution Approach 1:
The patent introduces border routers or zone administrators as intermediaries that maintain consolidated views of their respective zones. These intermediaries perform route computation for inter-zone routing while ordinary nodes handle intra-zone routing independently, achieving both decentralization for local autonomy and centralized computation for global optimization.
Solution Approach 2:
The patent implements different routing information storage and computation capabilities at different node types. Border routers maintain consolidated topology views and perform complex route computation, while ordinary nodes use simplified routing tables for local forwarding. This local differentiation optimizes overall system efficiency without requiring full centralization.
3Measurement precision
If routing protocol updates are performed continuously to reflect dynamic network changes, then routing accuracy is improved, but network resource consumption increases
Solution Approach 1:
The patent implements periodic routing updates at border routers rather than continuous updates at all nodes. Routing information is refreshed at predetermined intervals or triggered by significant topology changes, reducing unnecessary update traffic while maintaining adequate routing accuracy. This periodic approach balances freshness of routing information with resource conservation.
Data Source
AI summary
A method and system for routing traffic in a communication network is disclosed that may include assigning each node in a network a first subset of route repository nodes and a second subset of route repository nodes, querying the second subset of route repository nodes in order to obtain route information that is stored in the second subset of route repository nodes, computing route information by applying a route computation algorithm to the first subset of route repository nodes, and routing traffic in the communication network based on the route information obtained from the second subset of route repository nodes and the route information computed using the first subset of route repository nodes.