Asymmetric Neighbor Cache Entries for Multilink Route Enhancement
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current network interfaces are constrained to a single link-layer address, limiting the availability of alternative link-layer addresses that could provide superior communication links in terms of reliability and quality.
Innovation Solution
The implementation of an address resolution and routing agent (ARRA) that manages neighbor cache entries to provide multiple link-layer addresses for unidirectional packet communications between nodes, enabling the use of virtual links for asymmetric communication relationships.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a network interface is constrained to a single link-layer address, then the system structure is simple and easy to manage, but the availability of alternative communication paths is limited
Solution Approach 1:
The neighbor cache is segmented into multiple directional entries (forward and reverse) that can be independently managed. Each entry stores link-layer addresses specific to that direction, allowing the system to maintain multiple alternative addresses without creating a monolithic complex structure. This segmentation enables selective updates and management of address pairs.
Solution Approach 2:
The patent introduces a directional dimension to neighbor cache management by creating asymmetric entries for forward and reverse directions. Instead of a single flat address list, the system now manages addresses in two-dimensional directional pairs, enabling multiple link-layer addresses per interface while maintaining structured control through direction-specific caching.
2Reliability
If multiple link-layer addresses are implemented per network interface, then communication reliability and quality are improved, but the complexity of address resolution and routing increases
Solution Approach 1:
The system performs preliminary actions by pre-establishing asymmetric neighbor cache entries with multiple link-layer addresses before communication is needed. When a communication path fails, the alternative addresses are already cached and ready for immediate use, eliminating the need for complex real-time address resolution during failures.
Solution Approach 2:
The address resolution and routing agent (ARRA) acts as an intermediary that manages the complexity of multiple link-layer addresses. It handles the generation, validation, and updating of asymmetric neighbor cache entries, shielding the core communication system from the complexity of managing multiple addresses while enabling reliable communication through QoS-aware address selection.
3Adaptability or versatility
If asymmetric neighbor cache entries are used for unidirectional communication, then communication quality is enhanced, but the symmetry and simplicity of bidirectional address management is lost
Solution Approach 1:
The patent deliberately introduces asymmetry into the neighbor cache structure by creating separate forward and reverse directional entries with potentially different link-layer addresses. This asymmetric design enables unidirectional communication paths to be optimized independently, allowing each direction to use the best available link-layer address while maintaining clear directional management through the ARRA.
Data Source
AI summary
Certain aspects of the present disclosure provide a method that comprises receiving, from a first node, a neighbor solicitation (NS) message via a virtual link, wherein the NS message is configured to provide an indication of a request to communicate with a second node, and request one or more communication parameters corresponding to the second node. The method can also include storing the indication of the request in a report list, and transmitting, via the virtual link, a neighbor advertisement (NA) message to the first node in response to the NS message, wherein the NA message comprises the one or more communication parameters corresponding to the second node.


