ARP Table Management Double-Entry Mapping
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional ARP table management systems lead to suboptimal utilization due to the ARP egress table filling up before the ARP entry table, resulting in inefficient handling of internet layer addresses and link layer addresses, with double entries and limited maximum destination address/next hop address mappings.
Innovation Solution
An ARP table management engine that maps destination addresses to next hop addresses using both ARP entry and egress tables, identifies and removes redundant entries to free up space, allowing for more efficient mapping by converting single entries to double entries when the egress table is full, thereby increasing the number of destination address/next hop address mappings.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If the ARP egress table is made smaller to allow faster filling and triggering of optimization mechanisms, then the frequency of converting to double-entries increases, but the table fills up too quickly and limits the number of simultaneous mappings
Solution Approach 1:
The system dynamically adjusts the ARP table structure from single-entries to double-entries based on the fill status of the egress table. When the egress table reaches capacity, the system automatically transitions to double-entry mode in the entry table, allowing continuous adaptation of the data structure to match current operational needs and maximize mapping capacity.
Solution Approach 2:
The patent implements a nested structure where the egress table is embedded within the overall ARP table system, and double-entries in the entry table contain both destination address and link layer address mappings. This nested arrangement allows the egress table to trigger optimizations that affect the broader entry table structure, creating a hierarchical optimization mechanism.
2Quantity of substance
If double-entries are used in the ARP entry table to map multiple destination addresses to the same next hop, then the maximum number of mappings increases by up to 25%, but the complexity of table management and entry identification increases
Solution Approach 1:
The patent segments the ARP table into two distinct components: the egress table that stores next hop link layer addresses, and the entry table that stores destination internet layer addresses. This segmentation allows independent optimization of each table's function and size, enabling the system to manage double-entries more efficiently by separating the mapping logic into distinct manageable segments.
Solution Approach 2:
The next hop index value serves as an intermediary that links the egress table and entry table. This intermediary mechanism allows the system to manage complex double-entries by using the index as a bridge, simplifying the relationship between destination addresses and link layer addresses while enabling efficient lookup and management operations.
3Quantity of substance
If the ARP entry table is made larger to accommodate more double-entries, then more mappings can be stored, but the memory resources are consumed and the table size increases without proportional benefit
Solution Approach 1:
The system changes the structural parameter of ARP entries from single-entries to double-entries based on the egress table fill status. This parameter change allows the same physical table space to accommodate more logical mappings by storing multiple destination addresses that share the same next hop link layer address, effectively increasing capacity without proportionally increasing physical table size.
Data Source
AI summary
An ARP table management system maps destination addresses to next hop addresses using ARP entry and egress tables and, when the ARP egress table is full, performs those mappings in double-entries in the ARP entry table. When a second destination address is identified that is associated with a first next hop address mapped to a first destination address in a first double-entry in the ARP entry table, a second next hop address is identified in the ARP egress table that is mapped to only one third destination address in the ARP entry table. The third destination address is then mapped to the second next hop address in a second double-entry in the ARP entry table, and each of the first destination address and the second destination address in respective ARP entry rows in the ARP entry table are mapped to the first next hop address in the ARP egress table.