US5805818A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System for acknowledging availability of neighbor node using data packet containing data that is ordinarily fowarded to neighbor node
Assignee: Micro Focus Software Inc
•
Filing: 1996-09-11
•
Granted: 1998-09-08
•
Expires: 2016-09-11
Abstract
Abstract A novel acknowledgment mechanism efficiently requests affirmation from a neighboring node coupled to a communication link of a network that the neighbor is "alive" and connected to that link. The acknowledgment mechanism comprises control information generated by a source node and generally stored in a network layer header of a data packet transmitted to the neighbor. This next-hop acknowledgement (or lack thereof) from the neighbor provides a fast and efficient indication of (lost) system connection between adjacent nodes of a network.
Inventors
- 👤 Radia J. Perlman
- 👤 Neal D. Castagnoli
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 15:51
CPC Classifications
H; H04; H04L; H04L43/00; H04L43/50; H04L69/00; H04L69/30; H04L69/32; H04L69/322; H04L69/325
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
119 words
Apparatus for quickly and efficiently requesting affirmation from a neighboring node coupled to a communication link of a network that the neighbor is available and connected to that link, the apparatus comprising: a source node coupled to the communication link; a data packet forwarded by the source node over a network path encompassing the neighboring node, the data packet containing data of a type that is ordinarily forwarded to the neighboring node in connection with data communication and distinguishable from a control message; and control information stored in the data packet, the control information instructing the neighboring node to acknowledge receipt of the data packet to thereby affirm availability of the neighboring node without use of the control message.
Claim 2
Dependent Claim
119 words
Apparatus for quickly and efficiently requesting affirmation from a neighboring node coupled to a communication link of a network that the neighbor is available and connected to that link, the apparatus comprising: a source node coupled to the communication link; a data packet forwarded by the source node over a network path encompassing the neighboring node, the data packet containing data of a type that is ordinarily forwarded to the neighboring node in connection with data communication and distinguishable from a control message; and control information stored in the data packet, the control information instructing the neighboring node to acknowledge receipt of the data packet to thereby affirm availability of the neighboring node without use of the control message.
Claim 3
Dependent Claim
15 words
The apparatus of claim 1 wherein the control information is generated by the source node.
Claim 4
Dependent Claim
20 words
The apparatus of claim 1 wherein the control information is stored in a network layer header of the data packet.
Claim 5
Dependent Claim
17 words
The apparatus of claim 3 wherein the control information comprises an option within the network layer header.
Claim 6
Dependent Claim
28 words
The apparatus of claim 4 wherein the option is a new option type defined for acknowledgments by neighboring nodes and contained within an option field of the header.
Claim 7
Dependent Claim
20 words
The apparatus of claim 4 wherein the option is a flag stored within an expanded header field of the header.
Claim 8
Dependent Claim
26 words
The apparatus of claim 1 wherein the control information is contained within higher-layer protocol stack headers of the data packet other than a network layer header.
Claim 9
Dependent Claim
26 words
The apparatus of claim 1 wherein the control information instructs the neighboring node to acknowledge receipt of the data packet within a predetermined period of time.
Claim 10
Dependent Claim
17 words
The apparatus of claim 8 wherein the predetermined time is immediately upon its reception of the message.
Claim 11
Dependent Claim
12 words
The apparatus of claim 1 wherein the neighboring node is a router.
Claim 12
Independent Claim
128 words
A method for quickly and efficiently requesting an acknowledgement from a neighboring router coupled to a communication link of a network that the neighbor is available and connected to that link, the method comprising the steps of: generating control information at a sending node coupled to the link; storing the control information within a data packet containing data of a type that is ordinarily sent to the neighbor in connection with data communication and distinguishable from a control message; forwarding the data packet to a destination node over a network path encompassing the neighbor; and examining the control information at the neighbor, the control information instructing the neighbor to acknowledge receipt of the data packet to thereby confirm availability of the neighbor without use of the control message.
Claim 13
Independent Claim
128 words
A method for quickly and efficiently requesting an acknowledgement from a neighboring router coupled to a communication link of a network that the neighbor is available and connected to that link, the method comprising the steps of: generating control information at a sending node coupled to the link; storing the control information within a data packet containing data of a type that is ordinarily sent to the neighbor in connection with data communication and distinguishable from a control message; forwarding the data packet to a destination node over a network path encompassing the neighbor; and examining the control information at the neighbor, the control information instructing the neighbor to acknowledge receipt of the data packet to thereby confirm availability of the neighbor without use of the control message.
Claim 14
Dependent Claim
31 words
The method of claim 11 further comprising the step of, if the neighbor is alive and connected to the link, acknowledging receipt of the packet within a predetermined period of time.
Claim 15
Dependent Claim
17 words
The method of claim 12 wherein the predetermined time is immediately upon its reception of the message.
Claim 16
Dependent Claim
40 words
The method of claim 12 further comprising the steps of, if the neighbor does not acknowledge receipt of the packet within the predetermined period of time: declaring the neighbor unavailable; and forwarding the packet over a next optimal network path.
Claim 17
Dependent Claim
12 words
The method of claim 11 wherein the sending node is a router.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-09-07 | 2002-03-09 | 2002-09-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-09-07 | 2006-03-09 | 2006-09-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-09-07 | 2010-03-09 | 2010-09-08 | $7700.00 | Window Closed / Lapsed |