US 6,304,546 B1Grant
End-to-end bidirectional keep-alive using virtual circuits
Issue Date:2001-10-16
•31 Claims
•3 Drawing Sheets
Abstract
The invention provides a method and system for sending and receiving end-to-end bidirectional keep-alive messages using virtual circuits. Nodes coupled to a network, such as a frame relay network, periodically exchange link-layer “keep-alive” messages which indicate information regarding configuration and status of the virtual circuit, as well as information regarding congestion at sending nodes. Nodes respond to received keep-alive messages, or to timed-out failure to receive keep-alive messages, with follow-on actions, such as attempting to reconnect when a virtual circuit fails. Keep-alive messages may be propagated across multiple networks of either similar or different architecture. Keep-alive messages include sent and received sequence numbers, thus providing receiving nodes with a technique for determining if any keep-alive messages have been lost. Keep-alive messages can also include information regarding configuration of the virtual circuit, status of the virtual circuit (including counts of recent keep-alive message failure or success), and congestion at the sending node.
Metadata
Assignee
- Cisco Technology, Inc.
Inventors
- Shankar Natarajan
- Gregory A. Fowler
Application Information
Application Number:US 08/769,305
Filing Date:1996-12-19
Priority Date:1996-12-19
Art Unit:7
Classifications
IPC:
H04J 314H04L 514
Field of Search:
370216370217370218370229370230370231370235370236370242370244370284370389370394370395370396370397370400370409370410709220709221709234709235714 1714 2714 3714 4
Patent Drawings (3 sheets)
Description
BACKGROUND OF THE INVENTION
[0002] 1. Field of the Invention
[0003] This invention relates to end-to-end bidirectional keep-alive techniques using virtual circuits.
[0004] 2. Description of Related Art
[0005] In frame relay networks and some other networking techniques, communication between nodes uses virtual circuits, either permanent virtual circuits (PVCs) or switched virtual circuits (SVCs)
[0006] One problem which has arisen in the art is determining whether particular virtual circuits are still operational, or have failed due to one or more communication links in the virtual circuit having failed. Frame relay networks usually include a local management interface (LMI), a management technique for local communication links between nodes and the network. However, information provided by the LMI is limited to the communication links directly between routers and the frame relay network, and does not generally allow nodes to determine if a virtual circuit with a remote node has failed at an intermediate communication link in the frame relay network. Moreover, information provided by the LMI is sometimes unreliable with regard to status of remote links to the frame relay network.
[0007] Another problem which has arisen in the art is that of determining congestion for virtual circuits for which communication is primarily unidirectional. For example, multicast video sessions includes a great deal of data which is originated at a single source and transmitted to essentially passive receivers. In frame relay networks, header information in frames provides information regarding congestion within the frame relay network. However, passive receivers generate frames at most infrequently, and thus have little or no opportunity to cause information regarding congestion to be transmitted back to the source in a multicast video session.
[0008] Known methods exist, at higher-level protocol layers, for responding to broken or congested network communication, including virtual circuits. However, these known methods operate at higher-level protocol layers, such as an application (level 3) protocol layer in the OSI protocol layer model, and thus can take substantially more time and more resources to respond to a broken virtual circuit than may be desirable, particularly for band-width-intensive applications such as multicast video.
[0009] Known methods exist for management of aggregates of virtual circuits. For example, one such method is described in Annex D of specification document T1.617, in Annex A of the specification document ITU Q.933, and in the LMI frame relay specification document. However, this method is operative only for aggregates of virtual circuits, and is not effective for determining if an individual virtual circuit is broken, congested, or otherwise requires remedial action at an intermediate point in the frame relay network.
[0010] Accordingly, it would be advantageous to provide techniques for determining whether particular virtual circuits are end-to-end operational, as well as techniques for determining information regarding congestion at nodes which generate infrequent frames. These advantages are achieved by a method and system according to the present invention in which a virtual circuit protocol provides for end-to-end bidirectional keep-alive messages using virtual circuits.
SUMMARY OF THE INVENTION
[0011] The invention provides a method and system for sending and receiving end-to-end bidirectional keep-alive messages using virtual circuits. Nodes coupled to a network, such as a frame relay network, periodically exchange data link-layer “keep-alive” messages which indicate information regarding configuration and status of the virtual circuit, as well as information regarding congestion at sending nodes. Nodes respond to received keep-alive messages, or to timed-out failure to receive keep-alive messages, with follow-on actions, such as attempting to reconnect when a virtual circuit fails. Keep-alive messages can be propagated across multiple networks of either similar or different architecture.
[0012] In a preferred embodiment, keep-alive messages include sent and received sequence numbers, thus providing receiving nodes with a technique for determining if any keep-alive messages have been lost. Keep-alive messages can also include information regarding configuration of the virtual circuit and congestion at the sending node.
BRIEF DESCRIPTION OF THE DRAWINGS
[0013] FIG. 1 shows a block diagram of a system including end-to-end keep-alive messages.
[0014] FIG. 2 shows a flowchart of a protocol for using end-to-end keep-alive messages.
[0015] FIG. 3 shows a block diagram of an end-to-end keep-alive message in a frame relay network.
DESCRIPTION OF THE PREFERRED EMBODIMENT
[0016] In the following description, a preferred embodiment of the invention is described with regard to preferred process steps, data structures, and protocols. Those skilled in the art would recognize, after perusal of this application, that embodiments of the invention may be implemented using a computer at each site operating under program control, and that modification of a set of computers to implement the process steps, data structures, and protocols described herein would not require undue invention.
System Including End-to-end Keep-alive Messages
[0017] FIG. 1 shows a block diagram of a system including end-to-end keep-alive messages.
[0018] A first node 110 is coupled using a first local communication link 111 to a first local router 112 in a frame relay network 120. Similarly, a second node 130 is coupled using a second local communication link 131 to a second local router 132 in the frame relay network 120. Communication between the first node 110 and the second node 130 is conducted using a virtual circuit 140, including the first local communication link 111, the second local communication link 131, and a communication path 141 in the frame relay network 120.
[0019] The first local communication link 111 is controlled using a first local management interface (LMI) 161 between the first node 110 and the first local router 112. Similarly, the second local communication link 131 is controlled using a second local management interface (LMI) 163 between the second node 130 and the second local router 132. Communication occurs in the frame relay network 120 using a set of communication links (not shown) between the first local router 112 and the second local router 132; note that the first local router 112 and the second local router 1132 may happen to be the same device, or may be coupled by a large number of separate devices and separate communication links.
[0020] When the virtual circuit 140 is established in the frame relay network 120 between the first node 110 and the second node 130, it is assigned an associated unique data link connection identifier (DLCI). Frames which are transmitted using the frame relay network 120 include a header; the header includes the DLCI, thus identifying frames being transmitted using the associated virtual circuit 140.
[0021] The first node 110 includes a keep-alive send side 113, disposed for sending keep-alive messages 150 to the second node 130; the second node 130 includes a corresponding keep-alive receive side 134, disposed for receiving keep-alive messages 150 from the first node 110. Similarly, the second node 130 includes a keep-alive send side 133, disposed for sending keep-alive messages 150 to the first node 110; the first node 110 includes a corresponding keep-alive receive side 114, disposed for receiving keep-alive messages 150 from the second node 130.
Protocol for Using End-to-end Keep-alive Messages
[0022] FIG. 2 shows a flowchart of a protocol for using end-to-end keep-alive messages.
[0023] A method 200 for using end-to-end keep-alive messages includes a sequence of steps to be executed by the first node 110 in cooperation with the second node 130.
[0024] At a flow point 210, the first node 110 and the second node 130 have each been coupled to the frame relay network 120.
[0025] At a step 211, the first node 110 and the second node 130 are configured for the end-to-end keep-alive technique. As part of this step, the first node 110 and the second node 130 are configured to assign values to a set of timeout intervals. A first timeout interval determines a duration to be waited by the keep-alive send side 113 or the keep-alive send side 133 before sending a keep-alive REQUEST message 231. A second timeout interval determines a duration to be waited by the keep-alive send side 113 or the keep-alive send side 133 before triggering a timeout for the keep-alive REPLY message 232.
[0026] In a preferred embodiment, the first timeout interval and the second timeout interval have the same duration.
[0027] In a preferred embodiment, the first timeout interval and the second timeout interval are preselected by an operator at the first node 110 when the first node 110 is coupled to the frame relay network 120. Similarly, the first timeout interval and the second timeout interval are preselected by an operator at the second node 130 when the second node 130 is coupled to the frame relay network 120. In a preferred embodiment, the first timeout interval is about 10 seconds, and the second timeout interval is about 15 seconds.
[0028] At a flow point 220, the first node 110 and the second node 130 have been coupled using a virtual circuit 140, and the keep-alive send side 113 or the keep-alive send side 133 are disposed for activity.
[0029] At a step 221, the keep-alive send side 113 at the first node 110 sets its REQUEST timer to the first timeout interval. Similarly, the keep-alive send side 133 at the second node 130 sets its own REQUEST timer to the first timeout interval.
[0030] At a step 222, a timeout occurs for the first timeout interval at the keep-alive send side 113 at the first node 110. The keep-alive send side 113 generates a keep-alive REQUEST message 231 and transmits the keep-alive REQUEST message 231 to the keep-alive receive side 134 at the second node 130. Similarly, a timeout occurs for the first timeout interval at the keep-alive send side 133 at the second node 130. The keep-alive send side 133 at the second node 130 generates its own keep-alive REQUEST message 231 and transmits its keep-alive REQUEST message 231 to the keep-alive receive side 114 at the first node 110. In each case, the keep-alive REQUEST message 231 includes a keep-alive send sequence-number (SSN). In each case, the keep-alive REQUEST message 231 is transmitted on the same virtual circuit 140 identified by the associated DLCI.
[0031] At a step 223, the keep-alive send side 113 at the first node 110 sets its REPLY timer to the second timeout interval. Similarly, the keep-alive send side 133 at the second node 130 sets its own REPLY timer to the second timeout interval.
[0032] At a flow point 240, the first node 110 and the second node 130 have been coupled using a virtual circuit 140, and the keep-alive receive side 114 or the keep-alive receive side 134 are disposed for activity.
[0033] At a step 241, the keep-alive receive side 134 at the second node 130 receives the keep-alive REQUEST message 231 from the keep-alive send side 113 at the first node 110. Similarly, the keep-alive receive side 114 at the first node 110 receives its keep-alive REQUEST message 231 from the keep-alive send side 133 at the second node 130.
[0034] At a step 242, the keep-alive receive side 134 at the second node 130 generates a keep-alive REPLY message 232 and transmits the keep-alive REPLY message 232 to the keep-alive send side 113 at the first node 110. Similarly, the keep-alive receive side 114 at the first node 110 generates its own keep-alive REPLY message 232 and transmits its keep-alive REPLY message 232 to the keep-alive send side 133 at the second node 130. In each case, the keep-alive REPLY message 232 includes a keep-alive receive sequence-number (RSN). In each case, the keep-alive REPLY message 232 is transmitted on the virtual circuit 140 identified by the selected DLCI used by the keep-alive REQUEST message 231.
[0035] In a preferred embodiment, the keep-alive send sequence-number (SSN) and the keep-alive receive sequence-number (RSN) are both sent with both the keep-alive REQUEST message 231 and the keep-alive REPLY message 232.
[0036] After the step 223, if the keep-alive send side 113 at the first node 110 receives the keep-alive REPLY message 232 within the second timeout interval, it proceeds with the step 224. Otherwise, a timeout occurs for the second timeout interval at the keep-alive send side 113 at the first node 110, and it proceeds with the step 225. Similarly, if the keep-alive send side 133 at the second node 130 receives its keep-alive REPLY message 232 within the second timeout interval, it proceeds with the step 224. Otherwise, a timeout occurs for the second timeout interval at the keep-alive send side 133 at the second node 130, and it proceeds with the step 225.
[0037] At the step 224, the keep-alive send side 113 at the first node 110 receives the keep-alive REPLY message 232, and the keep-alive send side 113 at the first node 110 proceeds with the step 226. Similarly, the keep-alive send side 133 at the second node 130 receives its keep-alive REPLY message 232, and the keep-alive send side 133 at the second node 130 proceeds with the step 226.
[0038] At the step 225, a timeout occurs for the second timeout interval at the keep-alive send side 113 at the first node 110, and the keep-alive send side 113 at the first node 110 proceeds with the step 226. Similarly, a timeout occurs for the second timeout interval at the keep-alive send side 133 at the second node 130, and the keep-alive send side 133 at the second node 130 proceeds with the step 226.
[0039] At the step 226, the keep-alive send side 113 at the first node 110 determines whether the keep-alive REQUEST message 231 and keep-alive REPLY message 232 exchange was a SUCCESS or a FAILURE, and sets a current “keep-alive send event” accordingly. Similarly, the keep-alive send side 133 at the second node 130 determines whether the keep-alive REQUEST message 231 and keep-alive REPLY message 232 exchange was a SUCCESS or a FAILURE, and sets its current “keep-alive send event” accordingly.
[0040] The exchange was a SUCCESS if the keep-alive send side 113 at the first node 110 executed the step 224 and the SSN and RSN matched expectations, and a FAILURE if the keep-alive send side 113 at the first node 110 executed the step 225 or if the SSN or RSN failed to match expectations. To match expectations, the SSN in the keep-alive REQUEST message 231 must match the SSN returned by the keep-alive REPLY message 232, and the RSN in the keep-alive REPLY message 232 must be one greater than the RSN in the keep-alive REQUEST message 231. If the exchange was a FAILURE, the RSN is set to match the RSN returned by the keep-alive REPLY message 232.
[0041] At the step 243, the keep-alive receive side 134 at the second node 130 sets a current “keep-alive receive event” responsive to the keep-alive REQUEST message 231, and whether the SSN and RSN matched expectations. Similarly, the keep-alive receive side 114 at the first node 110 sets its current “keep-alive receive event” responsive to its own keep-alive REQUEST message 231, and whether the SSN and RSN matched expectations. To match expectations, the RSN in the keep-alive REQUEST message 231 must match the RSN returned by the most recent keep-alive REPLY message 232, and the SSN in the keep-alive REQUEST message 231 must be one greater than the SSN returned by the most recent keep-alive REPLY message 232. If the exchange was a FAILURE, the SSN is set to match the SSN received in the keep-alive REQUEST message 231.
[0042] At a flow point 250, not part of normal operation of the method 200 but available for extraordinary processing, an operator (not shown) is prepared to enter a command to set the history sequence for the keep-alive send side 113 or the keep-alive receive side 114 (or the keep-alive send side 133 or the keep-alive receive side 134). In a preferred embodiment, the operator may comprise a person using a console at the first node 110 or the second node 130, or may comprise an application program operating at the first node 110 or the second node 130 or coupled to the first node 110 or the second node 130 using the network 120 or another communication path.
[0043] At the step 226, the keep-alive send side 113 at the first node 110 sets a history sequence of keep-alive send events, responsive to a command from the operator. Similarly, the keep-alive send side 133 at the second node 130 sets its history sequence of keep-alive send events responsive to the command from the operator. If history sequences of keep-alive send events have never been set, they default to hexadecimal “FFFFFFFF”, representing a sequence of 32 “SUCCESS” keep-alive send events.
[0044] After the step 226, the keep-alive send side 113 at the first node 110 continues at the flow point 220. Similarly, after the step 226, the keep-alive send side 133 at the second node 130 also continues at the flow point 220.
[0045] At the step 243, the keep-alive receive side 134 at the second node 130 sets a history sequence of keep-alive receive events, responsive to the command from the operator. Similarly, the keep-alive receive side 114 at the first node 110 sets its history sequence of keep-alive receive events responsive to the command from the operator. If history sequences of keep-alive receive events have never been set, they default to hexadecimal “FFFFFFFF”, representing a sequence of 32 “SUCCESS” keep-alive receive events.
[0046] After the step 243, the keep-alive receive side 134 at the second node 130 continues at the flow point 240. Similarly, after the step 243, the keep-alive receive side 114 at the first node 130 also continues at the flow point 240.
[0047] At a flow point 260, the first node 110 or the second node 130 are disposed for determining a status of the virtual circuit 140.
[0048] At a step 261, the first node 110 determines the status of the virtual circuit responsive to the history sequence for the keep-alive send side 113, responsive to the history sequence for the keep-alive receive side 114, and responsive to a status for the LMI interface for the first local communication link 111. Similarly, the second node 130 determines the status of the virtual circuit responsive to the history sequence for the keep-alive send side 133, responsive to the history sequence for the keep-alive receive side 134, and responsive to a status for the LMI interface for the second local communication link 131.
[0049] The keep-alive send history sequence is constructed responsive to a prior keep-alive send history sequence (as possibly recorded at the step 226) and a current keep-alive send event (as determined at the step 224 or the step 225). The prior keep-alive send history sequence is shifted left one bit, and the current keep-alive send event is appended at the least significant bit. This operation would be described in the “C” computer language as shown in equation 262.
[0050] new_history=(old_history<<1)|current_event (262)
[0051] Similarly, the keep-alive receive history sequence is constructed responsive to a prior keep-alive receive history sequence (as possibly recorded at the step 243) and a current keep-alive receive status (as determined at the step 242). The prior keep-alive receive history sequence is shifted left one bit, and the current keep-alive receive status is appended at the least significant bit.
[0052] The keep-alive send side 113 at the first node 110 maintains 32 bits of send history sequence information, and the keep-alive receive side 114 at the first node 110 maintains 32 bits of receive history sequence information. Similarly, the keep-alive send side 133 at the second node 130 maintains 32 bits of send history sequence information, and the keep-alive receive side 134 at the second node 130 maintains 32 bits of receive history sequence information.
[0053] The keep-alive send side 113 at the first node 110 uses the send history sequence information to determine a send status for the virtual circuit 140; it determines that the virtual circuit 140 is “up” if there have been fewer than ES errors in the past MS messages; values for ES and MS are configurable parameters which can be set by commands from the operator. In a preferred embodiment, ES is about 2 and MS is about 3. Similarly, the keep-alive send side 133 at the second node 130 uses its send history sequence information to determine its send status for the virtual circuit 140.
[0054] The keep-alive receive side 134 at the second node 130 uses the receive history sequence information to determine a receive status for the virtual circuit 140; it determines that the virtual circuit 140 is “up” if there have been fewer than ER errors in the past MR messages; values for ER and MR are configurable parameters which can be set by commands from the operator. In a preferred embodiment, ER is about 2 and MR is about 3. Similarly, the keep-alive receive side 114 at the first node 110 uses its receive history sequence information to determine its receive status for the virtual circuit 140.
[0055] In a preferred embodiment, the first node 110 and the second node 130 determine the status of the virtual circuit as shown in table 2-1.
[0056] At a step 262, the status as determined in the step 261 is reported to a level 3 protocol layer. The first node 110 or the second node 130 can act on the status as specified by the level 3 protocol layer; alternatively, the first node 110 or the second node 130 can use the status as determined in the step 261 within the frame relay protocol layer. For example, in a preferred embodiment, the first node 110 or the second node 130 can switch the virtual circuit 140 to a new virtual circuit 140 responsive to status showing that the virtual circuit 140 is inoperative.
[0057] At a flow point 270, the method 200 is complete, and the first node 110 and the second node 130 can proceed with other processing.
Content of End-to-end Keep-alive messages
[0058] FIG. 3 shows a block diagram of an end-to-end keep-alive message in a frame relay network.
[0059] An end-to-end keep-alive message comprises a format 300 having a sequence of eight-bit bytes; in the figure, bits in these bytes are labeled from a least significant bit 1 to a most significant bit 8. In a preferred embodiment, the keep-alive REQUEST message 231 and the keep-alive REPLY message 232 have the same format.
[0060] The format 300 begins with four bytes of frame-relay header information. A first byte 301 and a second byte 302 collectively comprise a two-byte frame-relay header having a ten-bit DLCI and six bits of control information. Frame-relay headers are known in the art of frame-relay network processing. A third byte 303 and a fourth byte 304 collectively comprise a two-byte type field value reserved for end-to-end keep-alive messages, which is hexadecimal “8037”, thus indicating that the frame-relay message is an end-to-end keep-alive message. The hexadecimal value “8037” is arbitrarily selected and can be any value so long as it is used consistently and does not interfere with values selected for other types of frame-relay messages.
[0061] The format 300 continues with three bytes of keep-alive report-type information. A fifth byte 305 comprises a keep-alive report type identifier, which is hexadecimal “01”. A sixth byte 306 comprises a keep-alive report type length field, which is hexadecimal “01”, to indicate a one-byte report type value. A seventh byte 307 comprises a keep-alive report type value, which distinguishes between a keep-alive REQUEST message 231 and a keep-alive REPLY message 232. In a preferred embodiment, the value hexadecimal “01” indicates a keep-alive REQUEST message 231 and the value hexadecimal “02” indicates a keep-alive REPLY message 232.
[0062] The format 300 continues with four bytes of keep-alive sequence-number information. An eighth byte 308 comprises a keep-alive sequence-number identifier, which is hexadecimal “03”. A ninth byte 309 comprises a keep-alive sequence-number length field, which is hexadecimal “02”, to indicate a two-byte sequence-number value. A tenth byte 310 comprises the value for the keep-alive send sequence-number (SSN) and an eleventh byte 311 comprises the value for the keep-alive receive sequence-number (RSN). Both the keep-alive send sequence-number (SSN) and the keep-alive receive sequence-number (RSN) are represented as modulo-255 unsigned integers.
[0063] Keep-alive messages can also include information regarding configuration of the virtual circuit and congestion at the sending node. For example, certain applications, such as compression or voice transmission, might require consistent configuration at both the sending and receiving ends of the virtual circuit 140.
ALTERNATIVE EMBODIMENTS
[0064] Although preferred embodiments are disclosed herein, many variations are possible which remain within the concept, scope, and spirit of the invention, and these variations would become clear to those skilled in the art after perusal of this application.
Claims
We claim:
1. A system for providing keep-alive detection between end nodes of a virtual circuit in a data network, the system comprising:
said virtual circuit including a first end node, a second end node and at least one intermediate router;
said first end node being coupled to a first router of said at least one intermediate router;
said second end node being coupled to a second router of said at least one intermediate router, said second end node further being coupled to said first end node via said virtual circuit;
said virtual circuit being represented by an associated data link connection identifier (DLCI) other than that used by a local management interface, and configured to allow transmission of data frames between said first and second end nodes;
said first end node including a first keep-alive mechanism configured to send at least one data link-layer keep-alive REQUEST message to said second end node via said virtual circuit;
said second end node including a second keep-alive mechanism configured to respond to reception of said at least one keep-alive REQUEST message by sending at least one data link-layer keep-alive REPLY message to said first end node via said virtual circuit; and
wherein said first end node is configured to take action to alter connectivity of the virtual circuit in response to a failure to receive said at least one keep-alive REPLY message within a timeout period.
2. The system of claim 1 wherein said data network is a frame relay network, and wherein first end node is configured to transmit said at least one keep-alive REQUEST message over said virtual circuit using a frame format that is compatible with data frames being transmitted over the virtual circuit represented by the selected data link connection identifier (DLCI).
3. A system as in claim 1, wherein said at least one keep-alive REQUEST message and said at least one keep-alive REPLY message comprise data link-level protocol messages.
4. A system as in claim 1, wherein said at least one keep-alive REPLY message includes information regarding configuration of said virtual circuit.
5. A system as in claim 1, wherein said at least one keep-alive REPLY message includes information regarding status of said virtual circuit.
6. A system as in claim 1, wherein said at least one keep-alive REQUEST message includes information regarding congestion in said frame relay network at said first node.
7. A system as in claim 1, wherein said at least one keep-alive REQUEST message and said at least one keep-alive REPLY message include sent and received sequence numbers.
8. A system as in claim 1, wherein said response includes attempting to reconnect said virtual circuit.
9. A system as in claim 2, wherein said second end node is coupled to said frame relay network using a second network.
10. A system as in claim 9, wherein said second network is a frame relay network.
11. A system as in claim 9, wherein said second network is other than a frame relay network.
12. A system as in claim 1, wherein said at least one keep-alive REQUEST message and said at least one keep-alive REPLY message are each configured to be transmitted as frames according to a frame relay protocol; and
wherein said at least one keep-alive REQUEST message and said at least one keep-alive REPLY message each include a respective field having a predetermined value which may be used for identifying the frame as a keep-alive message.
13. A method for providing keep-alive detection between end nodes of a virtual circuit in a data network, the method comprising:
sending, via the virtual circuit, at least one data link-layer keep-alive REQUEST message from a first end node to a second end node of the virtual circuit, said first end node including a keep-alive mechanism for detecting a failure of communication with said second end node, said virtual circuit being identified by an associated data link connection identifier (DLCI) other than that used by a local management interface, and configured to allow transmission of data frames between said first and second end nodes;
waiting for receipt of a data link-layer keep-alive REPLY message from said second end node via said virtual circuit; and
taking action to alter connectivity of said virtual circuit in response to a failure to receive said at least one keep-alive REPLY message within a predetermined timeout period.
14. The method of claim 13 wherein said sending includes sending a plurality of keep-alive REQUEST message to said second end node at predetermined intervals.
15. The method of claim 13, further comprising:
receiving at said second end node, via said virtual circuit, said at least one keep-alive REQUEST message; and
responding to said at least one keep-alive REQUEST message by sending at least one data link-layer keep-alive REPLY message over said virtual circuit to said first end node.
16. The method of claim 13 wherein the data network is a frame relay network.
17. A method for providing keep-alive detection between end nodes of a virtual circuit in a data network, the method comprising:
receiving at a keep-alive mechanism of a second end node, a plurality of data link-layer keep-alive REQUEST messages, at least one of said keep-alive REQUEST messages being sent from a first end node via said virtual circuit, said at least one keep-alive REQUEST message being used by the first node to detect a failure of communication with the second end node, said virtual circuit being identified by an associated data link connection identifier (DLCI) other than that used by a local management interface, and configured to allow transmission of data frames between said first and second end nodes; and
responding to each received keep-alive REQUEST message by sending a respective data link-layer keep-alive REPLY message to said first end node over said virtual circuit.
18. The method of claim 17, further comprising:
sending, via said virtual circuit, each of said plurality of said at least one keep-alive REQUEST messages from a first keep-alive mechanism at said first node;
waiting for said at least one keep-alive REPLY messages at said first keep-alive mechanism; and
taking action to alter connectivity of said virtual circuit in response to a failure to receive a keep-alive REPLY message within a selected timeout period.
19. The method of claim 17 wherein said data network is a frame relay network.
20. A computer program product for providing keep-alive detection between end nodes of a virtual circuit in a data network, the computer program product comprising:
a computer readable medium comprising:
computer code for sending, via the virtual circuit, at least one data link-layer keep-alive REQUEST message from a first end node to a second end node of the virtual circuit, said first end node including a keep-alive mechanism for detecting a failure of communication with said second end node, said virtual circuit being identified by an associated data link connection identifier (DLCI) other than that used by a local management interface, and configured to allow transmission of data frames between said first and second end nodes;
computer code for waiting for receipt of a data link-layer keep-alive REPLY message from said second end node via said virtual circuit; and
computer code for taking action to alter connectivity of said virtual circuit in response to a failure to receive said at least one keep-alive REPLY message within a predetermined timeout period.
21. The computer program product of claim 20 wherein said sending code includes computer code for sending a plurality of keep-alive REQUEST message to said second end node at predetermined intervals.
22. The computer program product of claim 20, further comprising:
computer code for receiving at said second end node, via said virtual circuit, said at least one keep-alive REQUEST message; and
computer code for responding to said at least one keep-alive REQUEST message by sending at least one data link-layer keep-alive REPLY message over said virtual circuit to said first end node.
23. The computer program product of claim 20 wherein the data network is a frame relay network.
24. A system for providing keep-alive detection between end nodes of a virtual circuit in a data network, the system comprising:
means for sending, via the virtual circuit, at least one data link-layer keep-alive REQUEST message from a first end node to a second end node of the virtual circuit, said first end node including a keep-alive mechanism for detecting a failure of communication with said second end node, said virtual circuit being identified by an associated data link connection identifier (DLCI) other than that used by a local management interface, and configured to allow transmission of data frames between said first and second end nodes;
means for waiting for receipt of a data link-layer keep-alive REPLY message from said second end node via said virtual circuit; and
means for taking action to alter connectivity of said virtual circuit in response to a failure to receive said at least one keep-alive REPLY message within a predetermined timeout period.
25. A method for providing keep-alive detection between end nodes of a virtual circuit in a data network, the method comprising:
sending, via said virtual circuit, a data link-layer keep-alive REQUEST message from a first keep-alive mechanism disposed at a first end node of the virtual circuit, said at least one keep-alive REQUEST message being addressed to a second end node of the virtual circuit, said virtual circuit being identified by an associated data link connection identifier (DLCI) other than that used by a local management interface, and configured to allow transmission of data frames between said first and second end nodes;
receiving said at least one keep-alive REQUEST message at a second keep-alive mechanism disposed at said second end node;
responding to said at least one keep-alive REQUEST message by sending at least one data link-layer keep-alive REPLY message to said first end node via said virtual circuit;
waiting for said at least one keep-alive REPLY message at said first end node; and
taking action to alter connectivity of said virtual circuit in response to a failure to receive said at least one keep-alive REPLY message within a timeout period.
26. A method as in claim 25, wherein said taking action includes attempting to reconnect said virtual circuit.
27. An end node coupled to one or more routers which are part of a virtual circuit of a frame relay network, said end node including:
a keep-alive mechanism including:
a send mechanism configured to send at least one data link-layer keep-alive REQUEST message over the virtual circuit, said virtual circuit being represented by an associated data link connection identifier (DLCI) other than that used by a local management interface, and configured to allow transmission of data frames between end nodes of the virtual circuit;
a reply receive mechanism configured to receive, via said virtual circuit, a data link-layer keep-alive REPLY message, responsive to said at least one keep-alive REQUEST message; and
a timeout mechanism configured to initiate at least one action in response to a failure to receive said at least one keep-alive REPLY message at the reply receive mechanism within a timeout period.
28. The node of claim 27, wherein the virtual circuit connects the end node to a second end node, said second end node including:
a keep-alive receive mechanism in communication with said send mechanism via said virtual circuit, said at least one keep-alive receive mechanism including:
a request receive mechanism configured to receive said at least one keep-alive REQUEST message from the first end node; and
a send reply mechanism configured to send said at least one keep-alive REPLY message responsive to the request receive mechanism.
29. The node of claim 28, wherein said second end node includes a second keep-alive mechanism.
30. The node of claim 27, wherein said at least one keep-alive mechanism further comprises a receive mechanism in communication with a second keep-alive mechanism of a second end node via a second virtual circuit represented by a second DLCI, said receive mechanism including:
a request receive mechanism configured to receive said at least one keep-alive REQUEST message from said second node; and
a send reply mechanism configured to send said at least one keep-alive REPLY message to the request receive mechanism in response to receiving said at least one keep-alive REQUEST message.
31. The node of claim 27, wherein said at least one keep-alive REQUEST message and said at least one keep-alive REPLY message comprise link-level protocol messages.
Patent Citations (175)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| USRe.33900 | 1992-04-01 | Howson | Applicant |
| US4131767 | 1978-12-01 | Weinstein | Applicant |
| US4161719 | 1979-07-01 | Parikh et al. | Applicant |
| US4316284 | 1982-02-01 | Howson | Applicant |
| US4397020 | 1983-08-01 | Howson | Applicant |
| US4419728 | 1983-12-01 | Larson | Applicant |
| US4424565 | 1984-01-01 | Larson | Applicant |
| US4437087 | 1984-03-01 | Petr | Applicant |
| US4438511 | 1984-03-01 | Baran | Applicant |
| US4439763 | 1984-03-01 | Limb | Applicant |
| US4445213 | 1984-04-01 | Baugh et al. | Applicant |
| US4446555 | 1984-05-01 | Devault et al. | Applicant |
| US4456957 | 1984-06-01 | Schieltz | Applicant |
| US4464658 | 1984-08-01 | Thelen | Applicant |
| US4499576 | 1985-02-01 | Fraser | Applicant |
| US4506358 | 1985-03-01 | Montgomery | Applicant |
| US4507760 | 1985-03-01 | Fraser | Applicant |
| US4532626 | 1985-07-01 | Flores et al. | Applicant |
| US4644532 | 1987-02-01 | George et al. | Applicant |
| US4646287 | 1987-02-01 | Larson et al. | Applicant |
| US4677423 | 1987-06-01 | Benvenuto et al. | Applicant |
| US4679227 | 1987-07-01 | Hughes-Hartogs | Applicant |
| US4723267 | 1988-02-01 | Jones et al. | Applicant |
| US4731816 | 1988-03-01 | Hughes-Hartogs | Applicant |
| US4750136 | 1988-06-01 | Arpin et al. | Applicant |
| US4757495 | 1988-07-01 | Decker et al. | Applicant |
| US4763194 | 1988-08-01 | Gordon et al. | Applicant |
| US4769810 | 1988-09-01 | Eckberg, Jr. et al. | Applicant |
| US4769811 | 1988-09-01 | Eckberg, Jr. et al. | Applicant |
| US4771425 | 1988-09-01 | Baran et al. | Applicant |
| US4819228 | 1989-04-01 | Baran et al. | Applicant |
| US4827411 | 1989-05-01 | Arrowood et al. | Applicant |
| US4833706 | 1989-05-01 | Hughes-Hartogs | Applicant |
| US4835737 | 1989-05-01 | Herrig et al. | Applicant |
| US4879551 | 1989-11-01 | Georgiou et al. | Applicant |
| US4893306 | 1990-01-01 | Chao et al. | Applicant |
| US4903261 | 1990-02-01 | Baran et al. | Applicant |
| US4922486 | 1990-05-01 | Lidinsky et al. | Applicant |
| US4933937 | 1990-06-01 | Konishi | Applicant |
| US4960310 | 1990-10-01 | Cushing | Applicant |
| US4962497 | 1990-10-01 | Ferenc et al. | Applicant |
| US4962532 | 1990-10-01 | Kasiraj et al. | Applicant |
| US4965772 | 1990-10-01 | Daniel et al. | Applicant |
| US4970678 | 1990-11-01 | Sladowski et al. | Applicant |
| US4980897 | 1990-12-01 | Decker et al. | Applicant |
| US4991169 | 1991-02-01 | Davis et al. | Applicant |
| US5003595 | 1991-03-01 | Collins et al. | Applicant |
| US5014265 | 1991-05-01 | Hahne et al. | Applicant |
| US5020058 | 1991-05-01 | Holden et al. | Applicant |
| US5033076 | 1991-07-01 | Jones et al. | Applicant |
| US5054034 | 1991-10-01 | Hughes-Hartogs | Applicant |
| US5059925 | 1991-10-01 | Weisbloom | Applicant |
| US5072449 | 1991-12-01 | Enns et al. | Applicant |
| US5088032 | 1992-02-01 | Bosack | Applicant |
| US5115431 | 1992-05-01 | Williams et al. | Applicant |
| US5128945 | 1992-07-01 | Enns et al. | Applicant |
| US5136580 | 1992-08-01 | Videlock et al. | Applicant |
| US5166930 | 1992-11-01 | Braff et al. | Applicant |
| US5199049 | 1993-03-01 | Wilson | Applicant |
| US5206886 | 1993-04-01 | Bingham | Applicant |
| US5208811 | 1993-05-01 | Kashio et al. | Examiner |
| US5212686 | 1993-05-01 | Joy et al. | Applicant |
| US5224099 | 1993-06-01 | Corbalis et al. | Applicant |
| US5226120 | 1993-07-01 | Brown et al. | Applicant |
| US5228062 | 1993-07-01 | Bingham | Applicant |
| US5229994 | 1993-07-01 | Balzano et al. | Applicant |
| US5237564 | 1993-08-01 | Lespagnol et al. | Applicant |
| US5241682 | 1993-08-01 | Bryant et al. | Applicant |
| US5243342 | 1993-09-01 | Kattemalalavadi et al. | Applicant |
| US5243596 | 1993-09-01 | Port et al. | Applicant |
| US5247516 | 1993-09-01 | Bernstein et al. | Applicant |
| US5249178 | 1993-09-01 | Kurano et al. | Applicant |
| US5253251 | 1993-10-01 | Aramaki | Applicant |
| US5255291 | 1993-10-01 | Holden et al. | Applicant |
| US5260933 | 1993-11-01 | Rouse | Applicant |
| US5260978 | 1993-11-01 | Fleischer et al. | Applicant |
| US5268592 | 1993-12-01 | Bellamy et al. | Applicant |
| US5268900 | 1993-12-01 | Hluchyj et al. | Applicant |
| US5271004 | 1993-12-01 | Proctor et al. | Applicant |
| US5274631 | 1993-12-01 | Bhardwaj | Applicant |
| US5274635 | 1993-12-01 | Rahman et al. | Applicant |
| US5274643 | 1993-12-01 | Fisk | Applicant |
| US5280470 | 1994-01-01 | Buhrke et al. | Applicant |
| US5280480 | 1994-01-01 | Pitt et al. | Applicant |
| US5280500 | 1994-01-01 | Mazzola et al. | Applicant |
| US5283783 | 1994-02-01 | Nguyen et al. | Applicant |
| US5287103 | 1994-02-01 | Kasprzyk et al. | Applicant |
| US5291482 | 1994-03-01 | McHarg et al. | Applicant |
| US5305311 | 1994-04-01 | Lyles | Applicant |
| US5307343 | 1994-04-01 | Bostica et al. | Applicant |
| US5311509 | 1994-05-01 | Heddes et al. | Applicant |
| US5313454 | 1994-05-01 | Bustini et al. | Applicant |
| US5313582 | 1994-05-01 | Hendel et al. | Applicant |
| US5317562 | 1994-05-01 | Nardin et al. | Applicant |
| US5319644 | 1994-06-01 | Liang | Applicant |
| US5327421 | 1994-07-01 | Hiller et al. | Applicant |
| US5331637 | 1994-07-01 | Francis et al. | Applicant |
| US5345445 | 1994-09-01 | Hiller et al. | Applicant |
| US5345446 | 1994-09-01 | Hiller et al. | Applicant |
| US5359592 | 1994-10-01 | Corbalis et al. | Applicant |
| US5361250 | 1994-11-01 | Nguyen et al. | Applicant |
| US5361256 | 1994-11-01 | Doeringer et al. | Applicant |
| US5361259 | 1994-11-01 | Hunt et al. | Applicant |
| US5365524 | 1994-11-01 | Hiller et al. | Applicant |
| US5367517 | 1994-11-01 | Cidon et al. | Applicant |
| US5371852 | 1994-12-01 | Attanasio et al. | Applicant |
| US5386567 | 1995-01-01 | Lien et al. | Applicant |
| US5390170 | 1995-02-01 | Sawant et al. | Applicant |
| US5390175 | 1995-02-01 | Hiller et al. | Applicant |
| US5394394 | 1995-02-01 | Crowther et al. | Applicant |
| US5394402 | 1995-02-01 | Ross | Applicant |
| US5400325 | 1995-03-01 | Chatwani et al. | Applicant |
| US5408469 | 1995-04-01 | Opher et al. | Applicant |
| US5416842 | 1995-05-01 | Aziz | Applicant |
| US5422880 | 1995-06-01 | Heitkamp et al. | Applicant |
| US5422882 | 1995-06-01 | Hiller et al. | Applicant |
| US5423002 | 1995-06-01 | Hart | Applicant |
| US5426636 | 1995-06-01 | Hiller et al. | Applicant |
| US5428607 | 1995-06-01 | Hiller et al. | Applicant |
| US5430715 | 1995-07-01 | Corbalis et al. | Applicant |
| US5442457 | 1995-08-01 | Najafi | Applicant |
| US5442630 | 1995-08-01 | Gagliardi et al. | Applicant |
| US5452297 | 1995-09-01 | Hiller et al. | Applicant |
| US5473599 | 1995-12-01 | Li et al. | Applicant |
| US5473607 | 1995-12-01 | Hausman et al. | Applicant |
| US5477541 | 1995-12-01 | White et al. | Examiner |
| US5485455 | 1996-01-01 | Dobbins et al. | Applicant |
| US5490140 | 1996-02-01 | Abensour et al. | Examiner |
| US5491687 | 1996-02-01 | Christensen et al. | Applicant |
| US5491804 | 1996-02-01 | Heath et al. | Applicant |
| US5497368 | 1996-03-01 | Beijnierse et al. | Applicant |
| US5504747 | 1996-04-01 | Sweazey | Applicant |
| US5509006 | 1996-04-01 | Wilford et al. | Applicant |
| US5517494 | 1996-05-01 | Green | Applicant |
| US5519704 | 1996-05-01 | Farinacci et al. | Applicant |
| US5526489 | 1996-06-01 | Nilakantan et al. | Applicant |
| US5530963 | 1996-06-01 | Moore et al. | Applicant |
| US5535195 | 1996-07-01 | Lee | Applicant |
| US5539734 | 1996-07-01 | Burwell et al. | Examiner |
| US5555244 | 1996-09-01 | Gupta et al. | Applicant |
| US5561669 | 1996-10-01 | Lenney et al. | Applicant |
| US5583862 | 1996-12-01 | Callon | Applicant |
| US5592470 | 1997-01-01 | Rudrapatna et al. | Applicant |
| US5598581 | 1997-01-01 | Daines et al. | Applicant |
| US5600798 | 1997-02-01 | Cherukuri et al. | Examiner |
| US5604868 | 1997-02-01 | Komine et al. | Applicant |
| US5608726 | 1997-03-01 | Virgile | Applicant |
| US5617417 | 1997-04-01 | Sathe et al. | Applicant |
| US5617421 | 1997-04-01 | Chin et al. | Applicant |
| US5631908 | 1997-05-01 | Saxe | Applicant |
| US5632021 | 1997-05-01 | Jennings et al. | Applicant |
| US5634010 | 1997-05-01 | Ciscon et al. | Applicant |
| US5638359 | 1997-06-01 | Peltola et al. | Examiner |
| US5644718 | 1997-07-01 | Belove et al. | Applicant |
| US5659684 | 1997-08-01 | Giovannoni et al. | Examiner |
| US5666353 | 1997-09-01 | Klausmeier et al. | Applicant |
| US5673265 | 1997-09-01 | Gupta et al. | Applicant |
| US5678006 | 1997-10-01 | Valizadeh et al. | Applicant |
| US5684797 | 1997-11-01 | Aznar et al. | Applicant |
| US5687324 | 1997-11-01 | Green et al. | Applicant |
| US5689506 | 1997-11-01 | Chiussi et al. | Applicant |
| US5694390 | 1997-12-01 | Yamato et al. | Examiner |
| US5724351 | 1998-03-01 | Chao et al. | Applicant |
| US5748617 | 1998-05-01 | McLain, Jr. | Examiner |
| US5754547 | 1998-05-01 | Nakazawa | Applicant |
| US5835710 | 1998-11-01 | Nagami et al. | Examiner |
| US5854903 | 1998-12-01 | Morrison et al. | Applicant |
| US5898686 | 1999-04-01 | Virgile | Applicant |
| EP384758 | 1990-02-01 | Applicant | |
| EP431751A1 | 1990-11-01 | Applicant | |
| EP567217A2 | 1993-10-01 | Applicant | |
| WO93/07692 | 1993-04-01 | Applicant | |
| WO93/07569 | 1993-04-01 | Applicant | |
| WO94/01828 | 1994-01-01 | Applicant | |
| WO95/20850 | 1995-08-01 | Applicant |
Non-Patent Literature (11)
- Esaki, et al., “Datagram Delivery in an ATM-Internet,” IEICE Transactions on Communications vol. E77-B, No. 3, (1994) Mar., Tokyo, Japan.Applicant
- Doeringer, et al., “Routing on Longest-Matching Prefixes,” IEEE Transactions on Networking, vol. 4, No. 1, Feb. 1996, pp. 86-97.Applicant
- Allen, M., “Novell IPX Over Various WAN Media (IPXW AN),” Network Working Group, RFC 1551, Dec. 1993, pp. 1-22.Applicant
- Becker, D., “3c589.c: A 3c589 EtherLink3 ethernet driver for linux.” [email protected]. nasa.gov, May 3, 1994, pp. 1-13.Applicant
- Pei, et al., “Putting Routing Tables in Silicon,” IEEE Network Magazine, Jan. 1992, pp. 42-50.Applicant
- Perkins, D., “Requiements for an Internet Standard Point-to-Point Protocol,” Network Working Group, RFC 1547, Dec. 1993, pp. 1-19.Applicant
- Simpson, W., “The Point-to-Point Protocol (PPP),” Network Working Group, RFC 1548, Dec. 1993, pp. 1-53.Applicant
- Tsuchiya, P.F., “A Search Algorithm for Table Entries with Non-contiguous Wildcarding,” Abstract, Bellcore.Applicant
- Chowdhury, et al. “Alternative Bandwith Allocation”, 1992, IEEE Infocom '92, pp. 1061-1068.Applicant
- Zhang, et al. “Rate-Controlled Static-Priority Queueing”, 1993, IEEE, pp. 227-236.Applicant
- IBM, “Method and Apparatus for the Statistical Multiplexing of Voice, Data, and Image Signals”, Nov., 1992, IBM Technical Data Bulletin n6 Nov. 1992, pp. 409-411.Applicant