Neighbor discovery to support sleepy nodes
US-2016174148-A1 · Jun 16, 2016 · US
US9832106B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9832106-B2 |
| Application number | US-201514747734-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 23, 2015 |
| Priority date | Jun 23, 2015 |
| Publication date | Nov 28, 2017 |
| Grant date | Nov 28, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
The disclosed system may include (1) a cache module, stored in memory, that stores a neighbor cache entry that specifies whether a neighbor of a network node is reachable according to a detection mechanism, (2) a timeout module, stored in memory, that specifies a timing interval in which to select a reachable time threshold, (3) a reception module, stored in memory, that receives event information about whether the neighbor is active, (4) a biasing module, stored in memory, that biases, based on the received event information about whether the neighbor is active, a selection of the reachable time threshold within the timing interval, and (5) a determination module, stored in memory, that determines whether the neighbor is reachable based at least in part on a determination of whether the selected reachable time threshold has been satisfied. Various other systems and methods are also disclosed.
Opening claim text (preview).
What is claimed is: 1. A system comprising: a cache module, stored in memory, that stores a neighbor cache entry that specifies whether a neighbor of a network node is reachable according to a detection mechanism of a neighbor unreachability detection protocol; a timeout module, stored in memory, that specifies a timing interval in which to select a reachable time threshold that defines a length of time during which the neighbor is designated as reachable according to the neighbor unreachability detection protocol; a reception module, stored in memory, that receives event information about whether the neighbor is active; a biasing module, stored in memory, that biases, based on the received event information about whether the neighbor is active, a selection of the reachable time threshold within the timing interval by performing at least one of: altering a size of the timing interval; and focusing the selection of the reachable time threshold on a subset of the timing interval; a determination module, stored in memory, that determines whether the neighbor is reachable based at least in part on a determination of whether the selected reachable time threshold has been satisfied; and at least one physical processor configured to execute the cache module, the timeout module, the reception module, the biasing module, and the determination module, wherein: the biasing module biases the selection of the reachable time threshold within the timing interval such that neighbor unreachability detection is performed more efficiently and network congestion is reduced. 2. The system of claim 1 , wherein the biasing module biases the selection of the reachable time threshold at least in part by categorizing the neighbor cache entry into an estimated activity categorization based on the received event information. 3. The system of claim 2 , wherein the estimated activity categorization of the neighbor cache entry specifies one of: a state of no confirmed activity; a state in which a media access control address of the neighbor cache entry is known to be active; and a state that confirms a binding between a media access control address and an internet protocol address of the neighbor cache entry. 4. The system of claim 1 , wherein the event information about whether the neighbor is active comprises at least one of: a network bridge record of a media access control address that corresponds to both the neighbor and a packet that arrived at a corresponding network bridge; and a sampling of a network packet sampled at an interface of the network node attempting to determine whether the neighbor is reachable. 5. The system of claim 4 , wherein: the event information comprises the network bridge record; and the biasing module biases the selection of the reachable time threshold at least in part by categorizing the neighbor cache entry into an estimated activity categorization that specifies a state in which a media access control address of the neighbor cache entry is known to be active. 6. The system of claim 4 , wherein: the event information comprises the sampling of the network packet; the biasing module determines that the network packet comprises an originated packet rather than a forwarded packet; and the biasing module determines whether a media access control address and an internet protocol address of the network packet match a media access control address and an internet protocol address of the neighbor cache entry. 7. The system of claim 6 , wherein: the biasing module determines that the media access control address and the internet protocol address of the network packet match the media access control address and the internet protocol address of the neighbor cache entry; and the biasing module biases the selection of the reachable time threshold at least in part by categorizing the neighbor cache entry into an estimated activity categorization that specifies a state that confirms a binding between the media access control address and the internet protocol address of the neighbor cache entry. 8. The system of claim 1 , wherein the neighbor unreachability detection protocol corresponds to neighbor unreachability detection of internet protocol version six. 9. The system of claim 8 , wherein the event information comprises a neighbor discovery packet. 10. The system of claim 1 , wherein the biasing module biases the selection of the reachable time threshold at least in part by altering at least one of a minimum value and a maximum value for the timing interval in which to select the reachable time threshold. 11. A method comprising: storing a neighbor cache entry that specifies whether a neighbor of a network node is reachable according to a detection mechanism of a neighbor unreachability detection protocol; specifying a timing interval in which to select a reachable time threshold that defines a length of time during which the neighbor is designated as reachable according to the neighbor unreachability detection protocol; receiving event information about whether the neighbor is active; biasing, based on the received event information about whether the neighbor is active, a selection of the reachable time threshold within the timing interval by performing at least one of: altering a size of the timing interval; and focusing the selection of the reachable time threshold on a subset of the timing interval; and determining whether the neighbor is reachable based at least in part on a determination of whether the selected reachable time threshold has been satisfied, wherein: biasing the selection of the reachable time threshold within the timing interval improves an efficiency of performing neighbor unreachability detection and reduces network congestion. 12. The method of claim 11 , wherein biasing the selection of the reachable time threshold comprises categorizing the neighbor cache entry into an estimated activity categorization based on the received event information. 13. The method of claim 12 , wherein the estimated activity categorization of the neighbor cache entry specifies one of: a state of no confirmed activity; a state in which a media access control address of the neighbor cache entry is known to be active; and a state that confirms a binding between a media access control address and an internet protocol address of the neighbor cache entry. 14. The method of claim 11 , wherein the event information about whether the neighbor is active comprises at least one of: a network bridge record of a media access control address that corresponds to both the neighbor and a packet that arrived at a corresponding network bridge; and a sampling of a network packet sampled at an interface of the network node attempting to determine whether the neighbor is reachable. 15. The method of claim 14 , wherein: the event information comprises the network bridge record; and biasing the selection of the reachable time threshold comprises categorizing the neighbor cache entry into an estimated activity categorization that specifies a state in which a media access control address of the neighbor cache entry is known to be active. 16. The method of claim 14 , wherein: the event information comprises the sampling of the network packet; the method further comprises determining that the network packet comprises an originated packet rather than a forwarded packet; and biasing the selection of the reachable time threshold comprises determining whether a media access control address and an internet protocol address of the network packet match a media access control address a
Address processing for routing · CPC title
Hop count for routing purposes, e.g. TTL · CPC title
Electricity · mapped topic
using route fault recovery · CPC title
Electricity · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.