System and method for deterministic routing in a peer-to-peer hybrid communications network

• US 7,623,516 B2
• Filed: 12/29/2006
• Issued: 11/24/2009
• Est. Priority Date: 06/29/2004
• Status: Active Grant

• Current Assignee: Damaka, Inc.
• Original Assignee: Damaka, Inc.
• Inventors: Gundabathula, Satish, Chaturvedi, Sivakumar R.
• Primary Examiner(s): Yao; Kwang B
• Assistant Examiner(s): Tran; Tung Q
• Application Number:
  US11/647,606
• Publication Number:
  US 20070165597A1
• Time in Patent Office: 1,061 Days
• Field of Search: 370/389, 370392-393, 3703952-3953, 709/389
• US Class Current: 370/389
• CPC Class Codes: H04L 63/102 Entity profiles

Abstract

An improved system and method are disclosed for peer-to-peer communications. In one example, the method provides for deterministic routing.

Claims

1. A method for use in a peer-to-peer hybrid network comprising:

identifying, by a first source node, a first set of nodes linking the first source node to a target node and a second set of nodes linking a second source node to the target node;

determining, by the first source node, whether the first and second source nodes are in a single network or in different networks using the first and second sets of nodes, wherein the determining includes identifying a set of internal boundary nodes based on the first and second sets and determining whether a size of the set of internal boundary nodes is greater than one, wherein the first and second source nodes are in different networks if the size of the set of internal boundary nodes is greater than one;

identifying, by the first source node, at least one network address that must be used when sending communications from the first source node to the second source node, wherein the network address is included in at least one of the first and second sets; and

communicating, by the first source node, via the at least one network address with the second source node.

3. The method of claim 1 further comprising identifying first and second boundary nodes corresponding to the first and second source nodes, respectively, wherein each boundary node provides a demarcation point separating its respective source node from a publicly accessible portion of the network.

4. The method of claim 3 wherein the first and second boundary nodes are a single node.

2. A method for use in a peer-to-peer hybrid network comprising:

identifying, by a first source node, a first set of nodes linking the first source node to a target node and a second set of nodes linking a second source node to the target node;

determining, by the first source node, whether the first and second source nodes are in a single network or in different networks using the first and second sets of nodes, wherein the determining includes;

identifying a pivot node based on the first and second sets, wherein the pivot node is a node in the network providing an entry point used to access the target node;

comparing a first and second publicly accessible network address of the first and second source nodes, respectively, to a network address of the pivot node, wherein the first and second source nodes are in the same network if the first and second publicly accessible network addresses are equivalent to the network address of the pivot node;

identifying a set of internal boundary nodes based on the first and second sets; and

determining whether a size of the set of internal boundary nodes is greater than one, wherein the first and second source nodes are in different networks if the size of the set of internal boundary nodes is greater than one;

identifying, by the first source node, at least one network address that must be used when sending communications from the first source node to the second source node, wherein the network address is included in at least one of the first and second sets; and

communicating, by the first source node, via the at least one network address with the second source node.

5. A method for use in a peer-to-peer hybrid network comprising:

identifying, by a first source node, a first set of nodes S_a-t linking the first source node N_a to a target node N_t and a second set of nodes S_b-t linking a second source node N_b to the target node N_t;

identifying, by the first source node, a first boundary node N_ab associated with N_a and a second boundary node N_bb associated with N_b, wherein each boundary node provides a demarcation point separating its respective source node from a publicly accessible portion of the network;

determining, by the first source node, at least one of a pivot node N_p and a set of internal boundary nodes N_ib; and

determining, by the first source node, whether N_a and N_b are in a single network or in different networks using at least one of N_p and the set of N_ib, wherein the determining whether N_a and N_b are in a single network or in different networks includes determining whether a size of the set of N_ib is greater than one.

6. The method of claim 5 wherein both N_p and the set of internal boundary nodes N_ib are determined, and wherein the set of internal boundary nodes N_ib is used to determine whether N_a and N_b are in a single network or in different networks only if N_a and N_b are determined to be in different networks based on N_p.

7. The method of claim 5 wherein both N_p and the set of internal boundary nodes N_ib are determined, and wherein the set of internal boundary nodes N_ib is used to determine whether N_a and N_b are in a single network or in different networks regardless of the determination based on N_p.

8. The method of claim 5 wherein determining N_p includes calculating N_p as N_p=(S_a-t∩

S_b-t)[0].

9. The method of claim 5 wherein determining N_ib includes calculating N_ib as N_ib=(S_a-t∪

S_b-t)−

(S_a-t∩

S_b-t)−

{N_a}−

{N_b}.

10. The method of claim 5 wherein determining whether N_a and N_b are in a single network or in different networks using N_p includes comparing a first publicly accessible network address Of N_a and a second publicly accessible network address of N_b to a network address of N_a.

11. The method of claim 10 wherein N_a and N_b are in the same network if the first and second publicly accessible network addresses are equivalent to the network address of N_p.

12. The method of claim 5 wherein N_a and N_b are in different networks if the size of the set of N_ib is greater than one.

13. A first endpoint for use in a peer-to-peer hybrid network comprising:

a processor;

a memory coupled to the processor; and

a plurality of executable instructions stored in the memory for execution by the processor, the instructions including instructions for;

identifying a first set of nodes linking the first endpoint to an access server that is publicly accessible on the network;

storing the first set of nodes on the access server;

retrieving from a target node a second set of nodes linking a second endpoint to the access server;

merging the first and second sets of nodes to identify a network address that must be used by the first endpoint to communicate with the second endpoint, wherein the merging includes determining at least one of a pivot node and a set of internal boundary nodes and determining whether the first and second endpoints are in a single network or in different networks using at least one of the pivot node and the set of internal boundary nodes, and wherein determining whether the first and second endpoints are in a single network or in different networks using the set of internal boundary nodes includes determining whether a size of the set of internal boundary nodes is greater than one; and

sending a message to the second endpoint using the network address.

14. The first endpoint of claim 13 wherein determining whether the first and second endpoints are in a single network or in different networks using the pivot node includes comparing a first publicly accessible network address of the first endpoint and a second publicly accessible network address of the second endpoint to a network address of the pivot node.

15. The method of claim 14 wherein the first and second endpoints are in the same network if the first and second publicly accessible network addresses are equivalent to the network address of the pivot node.

16. The method of claim 13 wherein the first and second endpoints are in different networks if the size of the set of internal boundary nodes is greater than one.