INTER-PROXIMITY COMMUNICATION WITHIN A RENDEZVOUS FEDERATION

• US 20060282547A1
• Filed: 06/30/2006
• Published: 12/14/2006
• Est. Priority Date: 10/22/2004
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Hasha, Richard L., Kakivaya, Gopala Krishna R., Xun, Lu
• Granted Patent: US 8,095,600 B2
• Time in Patent Office: Days
• US Class Current: 709/251
• CPC Class Codes: H04L 12/4637 Interconnected ring systems
• CPC Class Codes: H04L 45/02 Topology update or discovery

Abstract

The present invention extends to methods, systems, and computer program products for facilitating inter-proximity communication within a rendezvous federation. Nodes maintain collateral ring set entry tables that include collateral rings and corresponding entry nodes into the collateral rings. Nodes can exchange collateral ring set entry state to update one another on the configuration of rings within a tree of rings. Nodes can refer to collateral ring set entry tables, as well as to other nodes, to identify entry nodes into rings that are collateral rings of the node. Messages can be sent to entry nodes in collateral rings. A message can include an indication that an entry node in a target proximity ring is to resolve the message to the node in the target proximity ring which has a node ID closest to an indicated destination node.

Claims

1. At a computer system, a method for sending inter-proximity communication in a tree of rings, the method comprising:

an act of determining that a node is to send a message to a specified collateral ring of the node;

an act of the node accessing a collateral ring set entry table configured to store collateral ring set entries for the node, each collateral ring set entry configured to indicate a collateral ring of the node and a corresponding at least one entry node into the collateral ring of the node;

an act of identifying at least one collateral ring set entry for the specified collateral ring from the node'"'"'s collateral ring set entry table, each of the at least one collateral ring set entries indicating at least one an entry node of the specified collateral ring; and

an act of sending the message to at least one indicated entry node.

2. The method as recited in claim 1, wherein the act of determining that a node is to send a message to a specified collateral ring of the node comprises an act of receiving an indication from an application related with the node.

3. The method as recited in claim 1, wherein the act of determining that a node is to send a message to a specified collateral ring of the node comprises an act of receiving an indication from another node in the tree of rings.

4. The method as recited in claim 1, wherein the act of determining that the node is to send a message to a specified collateral ring comprises an act of the node accessing one or more collateral ring/entry node items.

5. The method as recited in claim 1, wherein the act of identifying at least one collateral ring set entry for the specified collateral ring from the node'"'"'s collateral ring set entry table comprises an act of identifying a collateral ring/entry node item that identifies the specified collateral ring and a plurality of entry nodes into the specified collateral ring.

6. The method as recited in claim 5, further comprising:

an act of resolving the plurality of entry nodes into an appropriate subset of entry nodes.

7. The method as recited in claim 5, further comprising:

an act of resolving the plurality of entry nodes into a single appropriate entry node.

8. At a computer system, a method for sending inter-proximity communication in a tree of rings, the method comprising:

an act of a node determining that an originating node intends to route a message to a destination node that is closest to a given node ID in a target proximity ring within the tree of rings;

an act of identifying one or more entry nodes known to be a member node of at least one of the target proximity ring and an ancestor ring of the target proximity ring; and

an act of sending the message to an identified entry node, the message indicating that the identified entry node is to resolve the message to the node which has a node ID closest to an indicated destination node in the target proximity ring.

9. The method as recited in claim 8, wherein the act of a node determining that an originating node intends to route a message to a destination node that is closest to a given node ID in a target proximity ring within the tree of rings comprises an act of the node accessing an indication that an originating node intends to route a message to a destination node that is closest to a given node ID in a target proximity ring within the tree of rings.

10. The method as recited in claim 9, wherein the act of the node accessing an indication that an originating node intends to route a message to a destination node that is closest to a given node ID in a target proximity ring within the tree of rings comprises an act of the node receiving an indication that a sending node intends to route a message to a destination node that is closest to a given node ID in a target proximity ring that is a collateral ring of the sending node.

11. The method as recited in claim 9, wherein the act of the node accessing an indication that an originating node intends to route a message to a destination node that is closest to a given node ID in a target proximity ring within the tree of rings comprises an act of the node receiving an indication that a sending node intends to route a message to a destination node that is closest to a given node ID in a target proximity ring that is a sub-ring of a collateral ring of the sending node.

12. The method as recited in claim 9, wherein the act of accessing an indication that an originating node intends to route a message to a destination node that is closest to a given node ID in a target proximity ring that is collateral ring of the node comprises an act of receiving an indication from an application related to the node.

13. The method as recited in claim 9, wherein the act of accessing an indication that an originating node intends to route a message to a destination node that is closest to a given node ID in a target proximity ring that is collateral ring of the node comprises an act of receiving an indication in another message.

14. The method as recited in claim 13, wherein the act of receiving an indication in another message comprises an act of receiving an indication in a message from another node in the tree of rings.

15. The method as recited in claim 9, wherein the act of a node accessing an indication that an originating node intends to route a message to a destination node that is closest to a given node ID in a target proximity ring within the tree of rings comprises an act of receiving an indication that an originating node intends to route a message to a destination node that is closest to a given node ID in a collateral ring of the originating node.

16. The method as recited in claim 9, wherein the act of a accessing an indication that an originating node intends to route a message to a destination node that is closest to a given node ID in a target proximity ring within the tree of rings comprises an act of receiving an indication that an originating node intends to route a message to a destination node that is closest to a given node ID in a sub-ring of a collateral ring of the originating node.

17. The method as recited in claim 8, wherein the act of a node determining that an originating node intends to route a message to a destination node that is closest to a given node ID in a target proximity ring within the tree of rings comprises an act of the originating node determining that the originating node intends to route a message to a destination node that is closest to a given node ID in a target proximity ring within the tree of ring.

18. The method as recited in claim 8, wherein the act of identifying one or more entry nodes known to be member nodes of at least one of the target proximity ring and an ancestor ring of the target proximity ring comprises an act of referring to local knowledge at the node to identify any nodes in the target proximity ring.

19. The method as recited in claim 8, wherein the act of identifying one or more entry nodes known to be member nodes of at least one of the target proximity ring and an ancestor ring of the target proximity ring comprises an act of identifying an entry node that is a member of the target proximity ring.

20. The method as recited in claim 8, wherein the act of identifying one or more entry nodes known to be member nodes of at least one of the target proximity ring and an ancestor ring of the target proximity ring comprises an act of identifying an entry node that is a member of an ancestor ring of the target proximity ring.

21. The method as recited in claim 20, wherein the act of identifying an entry node that is a member of an ancestor ring of the target proximity ring comprises an act of identifying an entry node that is a member of an ancestor ring of the target proximity ring that is the closest ancestor ring of the target proximity ring

22. The method as recited in claim 8, wherein the act of identifying one or more entry nodes known to be member nodes of at least one of the target proximity ring and an ancestor ring of the target proximity ring comprises:

an act of the node referring to a collateral ring set entry table to identify a node in a sending node'"'"'s collateral ring set entry table that is in an ancestor ring of the target proximity ring; and

an act of sending the message to the identified node in the ancestor ring.

23. The method as recited in claim 22, further comprising:

an act of the node in the ancestor ring referring to local knowledge to identify any nodes in the target proximity ring.

24. The method as recited in claim 22, further comprising:

an act of the node in the ancestor ring referring to a collateral ring set entry table to identify a further node in the identified node'"'"'s collateral ring set that is in the closest ancestor ring of the target proximity ring; and

an act of sending the message to the further node.

25. The method as recited in claim 8, wherein the act of identifying one or more entry nodes known to be member nodes of at least one of the target proximity ring and an ancestor ring of the target proximity ring comprises an act of the node utilizing an entry node directory mechanism to identify an entry node known to be a member node of the target proximity ring.

26. The method as recited in claim 25, wherein the act of the sending node utilizing an entry node directory mechanism to identify an entry node known to be a member node of the target proximity ring comprises:

an act of routing an entry node lookup request message to a rendezvous point; and

an act of receiving an entry node lookup response corresponding to the lookup request, the entry node lookup response including a plurality of entry nodes.

27. The method as recited in claim 26, wherein the act of receiving an entry node lookup response corresponding to the lookup request comprises an act of receiving an entry node lookup response from the rendezvous point.

28. The method as recited in claim 26, wherein the act of receiving an entry node lookup response corresponding to the lookup request comprises an act of receiving an entry node lookup response that includes one or more entry nodes that are registered with an entry node directory mechanism.

29. The method as recited in claim 28, wherein the act of receiving an entry node lookup response that includes one or more entry nodes that are registered with an entry node directory mechanism comprises an act of receiving an entry node lookup response that includes one or more entry nodes that are registered with the rendezvous point.

30. The method as recited in claim 28, wherein the act of receiving an entry node lookup response that includes one or more entry nodes that are registered with an entry node directory mechanism comprises an act of receiving an entry node lookup response that includes an entry node that registered itself with the rendezvous point.

31. The method as recited in claim 28, wherein the act of receiving an entry node lookup response that includes one or more nodes that are registered with an entry node directory mechanism comprises an act of receiving an entry node lookup response that includes an entry node that was registered with the entry node directory mechanism by another party.

32. The method as recited in claim 31, wherein the act of receiving an entry node lookup response that includes an entry node that was registered with the entry node directory mechanism by another party comprises an act of receiving an entry node lookup response that includes an entry node that was registered with the entry node directory mechanism by another rendezvous point.

33. The method as recited in claim 26, further comprising:

an act of receiving an entry node registration request for an entry node; and

an act of registering the entry node with the rendezvous point.

34. A computer program product for use at a computer system, the computer program product for implementing a method for sending inter-proximity communication in a tree of rings, the computer program product comprising one or more computer-readable storage media having stored therein computer-executable instruction that, when executed by a processor, causes a node to perform the following:

determine that a node is to send a message to a specified collateral ring of the node;

access a collateral ring set entry table configured to store collateral ring set entries for the node, each collateral ring set entry configured to indicate a collateral ring of the node and a corresponding at least one entry node into the collateral ring of the node;

identify at least one collateral ring set entry for the specified collateral ring from the node'"'"'s collateral ring set entry table, each of the at least one collateral ring set entries indicating at least one an entry node of the specified collateral ring; and

send the message to at least one indicated entry node.

35. The computer program product as recited in claim 34, wherein the computer-readable storage media comprise system memory.

36. The computer program product as recited in claim 34, wherein the computer-readable storage media comprise a magnetic disk.

37. A computer program product for use at a computer system, the computer program product for implementing a method for sending inter-proximity communication in a tree of rings, the computer program product comprising one or more computer-readable storage media having stored therein computer-executable instruction that, when executed by a processor, causes a node to perform the following:

determine that an originating node intends to route a message to a destination node that is closest to a given node ID in a target proximity ring within the tree of rings;

identify one or more entry nodes known to be a member node of at least one of the target proximity ring and an ancestor ring of the target proximity ring; and

sending the message to an identified entry node, the message indicating that the identified entry node is to resolve the message to the node which has a node ID closest to an indicated destination node in the target proximity ring.

38. The computer program product as recited in claim 37, wherein the computer-readable storage media comprise system memory.

39. The computer program product as recited in claim 37, wherein the computer-readable storage media comprise a magnetic disk.