REAP Router Address Partitioning for Routing Capacity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The rapid growth of address prefixes in the IPv4 protocol has led to infrastructure components running out of forwarding memory, with existing solutions focusing on protocol improvements and new router technologies that are costly and time-consuming to implement.
Innovation Solution
The implementation of a Router Extensibility via Address-based Partitioning (REAP) router, which uses a logical switch with multiple physical switches to manage data, control, and management planes, distributing forwarding tables among physical routers to reduce memory usage and enable scalable infrastructure without hardware upgrades.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If new generation routers and subcomponents are deployed to handle increased address prefixes, then routing capacity is improved, but implementation cost and time increase
Solution Approach 1:
The patent segments the forwarding table into multiple partitioned tables distributed across different physical routers. Each router maintains only a portion of the total routing information, reducing individual router memory requirements while collectively handling the full address prefix space. This allows existing routers to handle increased routing capacity without requiring complete hardware replacement.
Solution Approach 2:
The patent implements a hierarchical routing architecture where a logical router is composed of multiple physical routers nested within it. The logical router presents a unified routing interface to external networks while internally distributing forwarding tasks across constituent physical routers. This nesting allows the system to scale routing capacity by adding more physical routers to the logical structure without requiring new router generations.
2Adaptability or versatility
If forwarding table size is increased to accommodate more address prefixes, then routing coverage is improved, but memory usage increases
Solution Approach 1:
The forwarding table is divided into multiple smaller partitioned tables that are distributed across different physical routers. Each router stores only the subset of routing entries relevant to its partition, reducing the memory burden on individual devices while collectively maintaining comprehensive routing coverage for all address prefixes.
3Productivity
If protocol improvements are implemented to address routing memory limitations, then routing efficiency is improved, but compatibility and deployment complexity increase
Solution Approach 1:
The patent maintains compatibility with existing routing protocols while implementing the partitioned forwarding table architecture. The system can handle both traditional single-table routing and the new partitioned multi-table routing modes, allowing existing protocols to operate unchanged while benefiting from the improved memory-efficient forwarding structure.
Data Source
AI summary
Disclosed example routing methods include accessing a control packet originating from a first internal router, translating the destination address of the control packet from a first value to a second value, and identifying a first one of a plurality of outgoing interfaces of a meta-router based on the second value of the destination address, the outgoing interfaces of the meta-router in communication with respective incoming interfaces of a splitter. Disclosed example methods also include forwarding the control packet to the first one of the outgoing interfaces of the meta-router after translating the destination address of the control packet from the second value back to the first value, and routing the control packet from the splitter to an external router based on which one of the incoming interfaces of the splitter receives the control packet from the meta-router.