Neighbor Cache Refresh via Routing Keepalive Messages
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Network nodes experience significant control traffic and resource consumption due to the need for Neighbor Discovery (ND) reachability confirmations when TCP traffic is low, leading to inefficient use of network resources.
Innovation Solution
Implementing a system that uses keepalive messages from routing protocols to refresh neighbor cache entries, avoiding the initiation of ND reachability confirmation processes and reducing control traffic by using control-traffic hints to determine neighbor reachability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If ND reachability confirmations are performed to maintain neighbor cache entries, then neighbor reachability reliability is improved, but control traffic volume increases
Solution Approach 1:
The patent combines multiple reachability indication sources (TCP traffic hints and routing protocol keepalive messages) into a unified neighbor reachability determination mechanism. When either TCP hints or routing keepalive messages indicate reachability, the neighbor cache entry is refreshed, eliminating the need for separate ND reachability confirmations and reducing control traffic volume while maintaining reliability.
2Reliability
If ND reachability confirmations are performed when TCP traffic is low, then neighbor reachability is verified, but network resources are consumed
Solution Approach 1:
The patent introduces routing protocol keepalive messages as an intermediary indicator of neighbor reachability. These keepalive messages serve as a proxy for actual data traffic, allowing the system to infer neighbor reachability without requiring active ND reachability confirmations. This intermediary mechanism reduces network resource consumption by leveraging existing routing protocol traffic rather than generating additional verification traffic.
3Quantity of substance
If routing protocol keepalive messages are used to refresh neighbor cache entries, then control traffic is reduced, but the mechanism complexity increases
Solution Approach 1:
The patent makes the neighbor reachability determination mechanism universal by accepting multiple types of reachability indicators (TCP hints and routing keepalive messages) through a common interface. The routing protocol keepalive messages are processed through the same reachability determination logic as TCP hints, allowing the system to handle different traffic types uniformly without requiring separate processing paths, thereby limiting the increase in mechanism complexity.
Data Source
AI summary
The disclosed method may include (1) receiving, at a network node within a network, a keepalive message of a routing protocol from a neighbor of the network node, (2) determining that the keepalive message of the routing protocol serves as evidence that the neighbor of the network node is currently reachable via a link within the network, (3) identifying a neighbor cache that includes entries for neighbors of the network node within the network, and then (4) refreshing an entry for the neighbor within the neighbor cache to avoid initiation of a reachability confirmation process directed to the neighbor due at least in part to the keepalive message of the routing protocol serving as evidence that the neighbor of the network node is currently reachable via the link. Various other methods, systems, and apparatuses are also disclosed.