Communication sessions for a computer network

• US 7,653,059 B1
• Filed: 03/31/2003
• Issued: 01/26/2010
• Est. Priority Date: 12/20/2002
• Status: Expired due to Fees

• Current Assignee: Clouding Corporation (Marathon Patent Group, Inc.)
• Original Assignee: Symantec Operating Corporation (Gen Digital Inc.)
• Inventors: Slaughter, Gregory L., Muth, John A., Saulpaugh, Thomas E.
• Primary Examiner(s): LY, ANH VU H
• Application Number:
  US10/403,261
• Time in Patent Office: 2,493 Days
• Field of Search: None
• US Class Current: 370/392
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/18 Loop-free operations
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04L 45/36 Backward learning
• CPC Class Codes: H04L 45/48 Routing tree calculation
• CPC Class Codes: H04L 45/484 using multiple routing trees

Abstract

A system and method supporting communication sessions for nodes in a network. A sender node may initiate a send operation to send a message to one or more receiver nodes. For each receiver node, the message may pass from the sender node to the receiver node via a path including a plurality of nodes. At each node through which the message passes, the node may store state information regarding the message. The state information may include information specifying a link via which the message was received. Each receiver node may issue one or more replies to the message. The replies from each receiver node may pass from the receiver node to the sender node via the same path by which the message reached the respective receiver node. This may be accomplished using the state information stored on each node in the path.

Claims

1. A method comprising:

a sender node sending a first message to a receiver node, wherein the first message is routed from the sender node to the receiver node via a path including a plurality of nodes;

at each node in the path through which the first message is routed, the node storing state information specifying a link via which the first message was received;

the receiver node sending a plurality of reply messages in response to the first message, wherein each reply message is separately routed from the receiver node to the sender node via the path by which the first message reached the receiver node, wherein for each node in the path, the state information stored on the node is used to determine the link by which to send the reply messages; and

wherein the receiver node sends the plurality of reply messages to the sender node sequentially, wherein a last reply message sent to the sender node is marked as the last reply; and

where each node in the path deleting the state information stored on the node in response to receiving the last reply message and determining that the last reply message is marked as the last reply.

2. The method of claim 1, further comprising:

the sender node storing state information specifying that the first message originated from the sender node.

3. The method of claim 1,

wherein the receiver node sending the plurality of reply messages to the sender node sequentially comprises the receiver node sending each reply message at a different time;

wherein each reply message is routed from the receiver node to the sender node as each reply message is sent.

4. The method of claim 1, wherein the receiver node sending the plurality of reply messages to the sender node sequentially comprises the receiver node sending each reply message at a different time;

wherein the method further comprises a first node in the path delaying one or more of the reply messages sent before the last reply message from being passed to the sender node until the first node has received the last reply message.

5. The method of claim 4,

wherein the first node aggregates all of the reply messages until receiving the last reply message and passes all of the reply messages to the sender node at once in response to receiving the last reply message marked as the last reply.

6. The method of claim 1,

wherein the path via which the first message is routed from the sender node to the receiver node includes a first node and a second node, wherein a first link enables the first node and the second node to communicate;

wherein the first link fails after the first message has been sent over the first link;

wherein the method further comprises sending a message indicating the failure of the first link to the sender node.

7. A system comprising:

a plurality of nodes, wherein the nodes include memory storing computer executable instructions;

a sender node in the plurality of nodes sending a first message to a receiver node in the plurality of nodes, wherein the first message is routed from the sender node to the receiver node via a path including one or more other nodes in the plurality of nodes;

at each node in the path through which the first message is routed, the node storing state information specifying a link via which the first message was received;

the receiver node sending a plurality of reply messages in response to the first message, wherein each reply message is separately routed from the receiver node to the sender node via the path by which the first message reached the receiver node, wherein for each node in the path, the state information stored on the node is used to determine the link by which to send the reply messages;

wherein the receiver node sends the plurality of reply messages to the sender node sequentially, wherein a last reply message sent to the sender node is marked as the last reply; and

wherein each node in the path deleting the state information stored on the node in response to receiving the last reply message and determining that the last re lv message is marked as the last reply.

8. The system of claim 7, further comprising:

the sender node storing state information specifying that the first message originated from the sender node.

9. The system of claim 7, wherein the receiver node sending the plurality of reply messages to the sender node sequentially comprises the receiver node sending each reply message at a different time;

wherein each reply message is routed from the receiver node to the sender node as each reply message is sent.

10. The system of claim 7,

wherein the receiver node sending the plurality of reply messages to the sender node sequentially comprises the receiver node sending each reply message at a different time;

wherein a first node in the path delaying one or more of the reply messages sent before the last reply message from being passed to the sender node until the first node has received the last reply message.

11. The system of claim 10,

wherein the first node aggregates all of the reply messages until receiving the last reply message and passes all of the reply messages to the sender node at once in response to receiving the last reply message.

12. The system of claim 7,

wherein the path via which the first message is routed from the sender node to the receiver node includes a first node and a second node, wherein a first link enables the first node and the second node to communicate;

wherein the first link fails after the first message has been sent over the first link; and

wherein the first node sends a message indicating the failure of the first link to the sender node.

13. A computer-readable medium comprising computer executable instructions that, when executed by a processor, cause the processor to perform a method of separately and sequentially routing reply messages comprising:

a sender node sending a first message to a receiver node, wherein the first message is routed from the sender node to the receiver node via a path including a plurality of nodes;

at each node in the path through which the first message is routed, the node storing state information specifying a link via which the first message was received;

the receiver node sending a plurality of reply messages in response to the first message, wherein each reply message is separately routed from the receiver node to the sender node via the path by which the first message reached the receiver node, wherein for each node in the path, the state information stored on the node is used to determine the link by which to send the reply messages;

wherein the receiver node sends the plurality of reply messages to the sender node sequentially, wherein a last reply message sent to the sender node is marked as the last reply; and

wherein each node in the path deleting the state information stored on the node in response to receiving the last reply message and determining that the last reply message is marked as the last reply.

14. The computer-readable medium of claim 13, further comprising:

the sender node storing state information specifying that the first message originated from the sender node.

15. The computer-readable medium of claim 13, wherein the receiver node sending the plurality of reply messages to the sender node sequentially comprises the receiver node sending each reply message at a different time;

wherein each reply message is routed from the receiver node to the sender node as each reply message is sent.

16. The computer-readable medium of claim 13, wherein the receiver node sending the plurality of reply messages to the sender node sequentially comprises the receiver node sending each reply message at a different time;

wherein a first node in the path delaying one or more of the reply messages sent before the last reply message from being passed to the sender node until the first node has received the last reply message.

17. The computer-readable medium of claim 16, wherein the first node aggregates all of the reply messages until receiving the last reply message and passes all of the reply messages to the sender node at once in response to receiving the last reply.

18. The computer-readable memory of claim 13, wherein the path via which the first message is routed from the sender node to the receiver node includes a first node and a second node, wherein a first link enables the first node and the second node to communicate;

wherein the first link fails after the first message has been sent over the first link;

wherein the first node sends a message indicating the failure of the first link to the sender node.