Network Routing Using Transit Layer Hierarchy
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Dynamic routing in networks leads to CPU overload, link utilization overload, service disruptions due to convergence time, and configuration complexity, necessitating a method that reduces resource consumption, achieves fast packet routing, and eliminates convergence time.
Innovation Solution
Introducing a logical hierarchy with transit layers and assigning unique network addresses to transit routers, organizing them in descending order of subnet masks, and defining static routes in routing tables for immediate and automatic route failover in case of link failures.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If dynamic routing protocols are used to automatically generate routing tables, then automatic route recovery and best route selection are achieved, but CPU overload occurs due to processing dynamic routing protocols and updates
Solution Approach 1:
The routing function is segmented into two parts: a control plane that uses dynamic routing protocols to learn network topology, and a data plane that uses pre-computed static routes for actual packet forwarding. This segmentation allows the router to benefit from automatic route recovery while minimizing CPU overhead during packet forwarding operations.
Solution Approach 2:
Routing tables are pre-computed and populated with static routes before actual packet forwarding begins. The dynamic routing protocol is used to pre-establish the routing information, so that when packets arrive, the router can immediately forward them using the pre-computed routes without real-time computation, thus achieving automatic route recovery capability while reducing CPU load during operation.
2Reliability
If dynamic routing protocols are used to communicate with neighboring routers, then automatic best route selection is achieved, but link utilization overload occurs due to constantly sending dynamic routing updates or hello packets
Solution Approach 1:
The routing system is divided into a control plane that periodically exchanges routing information using dynamic protocols, and a forwarding plane that uses static routes for actual packet transmission. This allows best route selection to be achieved through periodic updates while minimizing continuous link utilization during normal packet forwarding.
Solution Approach 2:
Dynamic routing updates and hello packets are sent periodically rather than continuously. The routing tables are updated at scheduled intervals, allowing the network to maintain automatic best route selection capability while reducing the frequency and intensity of link utilization for control traffic.
3Reliability
If dynamic routing protocols are used to detect and recover failed links, then automatic route recovery is achieved, but service disruptions occur due to the convergence time required
Solution Approach 1:
Multiple static routes are pre-computed and stored in the routing table before any link failure occurs. When a link failure is detected, the router can immediately switch to a pre-computed alternative route without waiting for dynamic protocol convergence, thus achieving fast service recovery while maintaining the capability for automatic route recovery.
Solution Approach 2:
The system prepares backup routing paths in advance as a cushion against potential link failures. By pre-establishing alternative routes in the routing table, the system creates a buffer that can be immediately activated when failures occur, eliminating the convergence time delay that would otherwise be required for dynamic route recalculation.
4Adaptability or versatility
If dynamic routing protocols are used for automatic route management, then routing adaptability is improved, but configuration complexity increases and higher skilled administration is required
Solution Approach 1:
The router automatically populates its routing table using dynamic routing protocols without requiring manual configuration of individual routes. The system self-manages the routing information by listening to routing updates from neighboring routers and automatically computing the best paths, thereby achieving routing adaptability while eliminating the need for complex manual configuration and reducing the skill level required for administration.
Data Source
AI summary
The embodiments relate to a method and a routing device. The method comprises introducing a logical hierarchy by defining a plurality of transit layers wherein to each transit layer a transit layer address is assigned and a transit router and wherein each transit router has a unique network address; the layers are organized in a descending order of subnet masks; for each interface between a router and said transit routers, defining, in a routing table of said router, a static route based on the transit layer address and the subnet mask of the transit router interfacing with the router; and if a connection that carries traffic between the router and any of the transit routers fails, selecting a static route in said routing table as a redundant route for carrying said traffic towards its destination.