Dynamic Packet Forwarding via Indexed Next Hop Tables
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Network devices face memory limitations when storing next hops for packet transmission, especially in large networks, as the number of next hops increases rapidly with the number of network devices, leading to inefficiencies in memory usage and processing time.
Innovation Solution
Implementing a dynamic system that assigns traffic forwarding techniques based on flow characteristics and metadata, using selective multicast Ethernet tag (SMET) and inclusive multicast Ethernet tag (IMET) techniques to optimize memory usage and reduce the need for next hop lookups, allowing for efficient use of network resources by selecting between selective and flood forwarding methods.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional next hop storage methods are used for packet transmission, then packet forwarding can be achieved, but memory consumption increases rapidly with the number of network devices
Solution Approach 1:
The patent segments the forwarding database into multiple indexed tables (e.g., destination network table, next hop table, inverse next hop table) where each table stores only relevant portions of the forwarding information. This segmentation allows the system to store forwarding data more efficiently by distributing it across multiple smaller structures with shared indexes, reducing the memory overhead compared to storing complete next hop information for every possible destination in a single large table.
Solution Approach 2:
The patent implements a nested structure where multiple forwarding tables share common index structures. The destination network table and next hop table share a common destination network index, and the inverse next hop table shares the next hop index with the next hop table. This nesting allows the system to store forwarding information in a compact manner where common data structures are shared across multiple functions, reducing redundant storage and minimizing memory consumption while maintaining complete forwarding capability.
2Reliability
If next hop lookups are performed for every packet, then accurate packet forwarding is achieved, but processing time increases
Solution Approach 1:
The patent pre-computes and stores forwarding information in multiple indexed tables during network initialization or when topology changes occur. The forwarding database is built in advance with destination networks, next hops, and inverse next hops all pre-organized in indexed structures. This preliminary action allows the system to perform fast lookup operations during packet forwarding without performing complex real-time computations, significantly reducing processing time while maintaining accurate packet forwarding.
Solution Approach 2:
The patent replaces the traditional mechanical next hop lookup process with a multi-table indexed lookup system that uses shared indexes and pre-computed forwarding information. Instead of performing sequential searches or maintaining large flat tables that require linear scanning, the system uses hash tables or other indexed structures that enable constant-time or logarithmic-time lookups. This substitution of the lookup mechanism dramatically reduces processing time while maintaining forwarding accuracy.
Data Source
AI summary
A device may receive a plurality of traffic flows to be provided to a set of destination devices. The device may process the plurality of traffic flows to identify respective sets of attributes associated with the plurality of traffic flows. The device may assign one of a plurality of traffic forwarding techniques, to a first traffic flow, of the plurality of traffic flows, based on the respective sets of attributes associated with the plurality of traffic flows. The device may provide the plurality of traffic flows to the set of destination devices. The device may determine that a condition, of a set of conditions associated with the plurality of traffic flows, has been satisfied in association with providing the plurality of traffic flows to the set of destination devices. The device may perform a set of actions after determining that the condition has been satisfied.