ROUTE OPTIMIZATION FOR DIRECTLY CONNECTED PEERS
First Claim
Patent Images
1. A method performed by a first node for moving a communication session from a network path to a directly connected path, the method comprising:
- employing a processor executing instructions stored on a computer readable storage medium to implement the following;
sending to a second node a first message that includes an address of the first node;
receiving at the first node a second message that includes a first information element, the second message is received at the address over the network path;
sending a third message to the second node over a directly connected path, the third message includes the first information element; and
tunneling messages between the first node and the second node over the directly connected path.
1 Assignment
0 Petitions
Accused Products
Abstract
Aspects relate to allowing peer nodes that establish a communication through a home agent to move that session to a directly connected link. Thus, the directly connected nodes can exchange packets natively without encapsulation. Further aspects allow a node that does not have any home agent entity to switch from a local network to a global network without losing ongoing sessions.
27 Citations
40 Claims
-
1. A method performed by a first node for moving a communication session from a network path to a directly connected path, the method comprising:
employing a processor executing instructions stored on a computer readable storage medium to implement the following; sending to a second node a first message that includes an address of the first node; receiving at the first node a second message that includes a first information element, the second message is received at the address over the network path; sending a third message to the second node over a directly connected path, the third message includes the first information element; and tunneling messages between the first node and the second node over the directly connected path. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
9. A communication apparatus, comprising:
-
a memory that retains instructions related to communicating to a node an address included in a first message, conveying to the node a second message that includes a first element received in a reply message from the node, and tunneling messages over a directly connected path, wherein the reply message is received over a network path and the second message is conveyed over the directly connected path; and a processor, coupled to the memory, configured to execute the instructions retained in the memory. - View Dependent Claims (10, 11, 12, 13, 14, 15)
-
-
16. A communication apparatus that transfers a communication session from a network path to a directly connected path, comprising:
-
means for communicating to a peer node a first message that includes a home address of communication apparatus; means for receiving from the peer node a second message that includes a first element, the second message is received over a network path; means for transmitting to the peer node a third message that includes the first element, the third message is transmitted over a directly connected path; and means for tunneling messages over the directly connected path. - View Dependent Claims (17, 18)
-
-
19. A computer program product, comprising:
a computer-readable medium comprising; a first set of codes for causing a computer to establish a communication link with a peer node over a network path; a second set of codes for causing the computer to ascertain a direct path is available for communication with the peer node; a third set of codes for causing the computer to send a first message to the peer node, the first message includes a home address; a fourth set of codes for causing the computer to receive at the home address a second message that includes a first element, the second message is received over the network path; a fifth set of codes for causing the computer to transmit a third message over the direct path; and a sixth set of codes for causing the computer to tunnel messages with the peer node over the direct path.
-
20. At least one processor configured to switch a communication session from a network path to a directly connected path, comprising:
-
a first module for sending to a peer node a first message that includes an address; a second module for receiving a second message that includes a first element, the second message is sent to the address over the network path; a third module for sending a third message to the second node over a directly connected path, the third message includes the first element; and a fourth module for tunneling messages between the first node and the second node over the directly connected path.
-
-
21. A method performed by a first node for moving a communication session from a network path to a directly connected path, the method comprising:
employing a processor executing instructions stored on a computer readable storage medium to implement the following; receiving from a second node a first message that includes an address; transmitting a second message that includes a first element to the second node, the second message is sent to the address over the network path; receiving a third message over a directly connected path; ascertaining if the third message includes the first element; and tunneling messages over the directly connected path if the third message includes the first element. - View Dependent Claims (22, 23, 24, 25, 26, 27, 28)
-
29. A communications apparatus, comprising:
-
a memory that retains instructions related to receiving a first message that includes an address of a peer node, transmitting over a network path to the address a reply message that includes a first element, receiving a second message over a directly connected path, determining if the second message includes the first element, and tunneling messages over the directly connected path if the second message includes the first element; and a processor, coupled to the memory, configured to execute the instructions retained in the memory. - View Dependent Claims (30, 31, 32, 33, 34, 35)
-
-
36. A communications apparatus that transfers a communication session from a network path to a directly connected path, comprising:
-
means for establishing a communication session with a peer node over a network path; means for receiving a first message from the peer node, the first message includes an address; means for conveying a second message to the address over the network path, the second message includes a first element; means for ascertaining if a third message received from the peer node over a directly connected path includes the first element; and means for tunneling messages over the directly connected path with the peer node if the third message includes the first element. - View Dependent Claims (37, 38)
-
-
39. A computer program product, comprising:
a computer-readable medium comprising; a first set of codes for causing a computer to establish a communication link with a peer node over a network path; a second set of codes for causing the computer to receive a first message from the peer node, the first message includes a home address; a third set of codes for causing the computer to transmit to the home address a second message that includes a first element, the second message is transmitted over the network path; a fourth set of codes for causing the computer to receive a third message over the direct path; and a fifth set of codes for causing the computer to tunnel messages with the peer node over the directly connected path if the third message includes the first element.
-
40. At least one processor configured to switch a communication session from a network path to a directly connected path, comprising:
-
a first module for receiving from a peer node a first message that includes an address of the peer node; a second module for transmitting a second message that includes a first element to the address over the network path; a third module for receiving a third message over a directly connected path; and a fourth module for tunneling messages with the peer node over the directly connected path if the third message includes the first message.
-
Specification