NEIGHBORHOOD MAINTENANCE IN THE FEDERATION

• US 20090213757A1
• Filed: 02/27/2008
• Published: 08/27/2009
• Est. Priority Date: 02/27/2008
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Xun, Lu, Kakivaya, Gopala Krishna Reddy
• Granted Patent: US 8,417,775 B2
• Time in Patent Office: Days
• US Class Current: 370/254
• CPC Class Codes: H04L 63/126 the source of the received data
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1046 Joining mechanisms
• CPC Class Codes: H04L 67/1065 Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT] pre-configuration of logical or physical connections H04L67/1053

Abstract

Systems and methods that provide for joining a node to a federation. A link component facilitates joining such node thru three phases of join, introduce and advise. A plurality of messages and replies are exchanged between nodes in form of introduce, advise, and response messages. Such messages contain the sending node'"'"'s full neighborhood.

Claims

1. A computer implemented system comprising the following computer executable components:

a federation that represent a collection of nodes that have established trust; and

a link component that facilitates addition of a node to the federation through introduce and advise phases.

2. The computer implemented system of claim 1, the link component further comprising a join component that implements a join phase.

3. The computer implemented system of claim 1, the link component further comprising an introduction component that introduces the node to the federation.

4. The computer implemented system of claim 2, the link component further comprising an advisory component that sends advise messages to neighboring nodes.

5. The computer implemented system of claim 3, the introduction component further comprising introduce messages sent to nodes.

6. The computer implemented system of claim 4 further comprising response messages received from nodes.

7. The computer implemented system of claim 6 further comprising neighborhoods that include a plurality of nodes.

8. The computer implemented system of claim 6 further comprising a view of neighborhoods that is updatable based on responses from nodes.

9. A computer implemented method of joining a node to a federation comprising:

joining a node to a federation;

introducing the node to the federation; and

advising the node to the federation base on message exchange between nodes of the federation.

10. The computer implemented method of claim 9 further comprising obtaining a view of nodes in the federation.

11. The computer implemented method of claim 9 further comprising uniformly populating segments of a ring associated with the federation.

12. The computer implemented method of claim 9 further comprising acquiring a routing token by the node

13. The computer implemented method of claim 11 further comprising obtaining a stable view of the nodes.

14. The computer implemented method of claim 11 further comprising updating an extended neighborhood based on received messages.

15. The computer implemented method of claim 11 further comprising ensuring a consistency by the federation.

16. The computer implemented method of claim 11 further comprising adjusting a neighborhood range.

17. The computer implemented method of claim 16 further comprising extending neighborhood of a node.

18. The method of claim 13 further comprising assigning each node a uniformly distributed number.

19. The method of claim 13 further comprising maintaining a neighborhood of nodes in a ring that forms the federation.

20. A computer implemented system comprising the following computer executable components:

means for representing a collection of nodes that have established trust; and

means for adding a node to the federation.