Routing Lookup Table Structure for Scalable Prefix Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
As network routing tables grow in size due to increasing connected devices and protocols like IPv6, existing lookup structures face inefficiencies leading to degraded performance and complexity, particularly with overlapping entries and frequent reprogramming, which affects network speed and user experience.
Innovation Solution
A routing lookup structure that selectively creates new entries in a lookup table and utilizes a default range table, reducing memory footprint by appending routes with less specific network identifiers to the default table, and employs cascaded lookup tables with dynamic optimization to adapt to network conditions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If routing tables are transformed into compact lookup structures to improve network speed, then network performance is improved, but the structures exceed acceptable sizes and become overly complex as routing tables continue to grow
Solution Approach 1:
The routing lookup structure is divided into multiple components: a compressed routing table using trie data structure, a routing cache with LRU policy, and a hybrid combination. This segmentation allows each component to handle specific aspects of route lookup, preventing any single structure from becoming too large or complex while maintaining high lookup speed.
Solution Approach 2:
The system dynamically adjusts between different lookup structures based on routing table size and network conditions. When the routing table grows beyond a threshold, the system automatically transitions from direct lookup to compressed trie, and further to hybrid structure with cache, adapting the complexity level to match the actual needs.
2Adaptability or versatility
If routing tables expand to accommodate more connected devices and IPv6 routes, then network coverage and capacity are improved, but lookup operations severely impact network performance leading to congestion
Solution Approach 1:
The patent replaces traditional linear or hash-based lookup mechanisms with a trie-based compressed routing table structure. This substitution enables efficient prefix matching and longest prefix match operations even as the routing table grows to accommodate IPv6 and numerous connected devices, maintaining lookup efficiency independent of table size.
Solution Approach 2:
The system changes the structural parameters of the routing lookup mechanism by introducing compression techniques and hierarchical organization in the trie structure. This allows the routing table to scale to accommodate more devices and IPv6 routes while keeping the effective lookup space manageable and efficient.
3Ease of manufacture
If existing lookup structures are used to handle growing routing tables, then implementation simplicity is maintained, but the structures become inefficient and require frequent reprogramming
Solution Approach 1:
The compressed trie-based routing table serves multiple functions: it handles route lookup, supports routing table compression, provides prefix matching, and enables efficient updates. This multi-functionality eliminates the need for separate structures for different operations, maintaining implementation simplicity while improving reliability and efficiency across all routing operations.
Data Source
AI summary
The techniques disclosed herein enable systems to enhance the efficiency of computer networking devices through a streamlined routing lookup structure for storing network routes and processing network packets. The routing lookup structure can comprise a lookup table, a set of range tables, and a default range table. The lookup table can process a portion of a network packet address with additional processing at a range table if the portion matches an entry at the lookup table. If there are no matches at the lookup table, the packet is processed by the default range table. The routing lookup structure can further include a secondary lookup table and dynamic optimization for reconfiguring the routing lookup structure to adapt to network conditions. In addition, the routing lookup structure can store new routes based on the length of the prefix. Routes that fall below a minimum length are stored in the default range table.