ROUTING TOKEN TRANSFER AND RECOVERY PROTOCOL IN RENDEZVOUS FEDERATION

• US 20090193288A1
• Filed: 01/25/2008
• Published: 07/30/2009
• Est. Priority Date: 01/25/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 7,934,117 B2
• Time in Patent Office: Days
• US Class Current: 714/4.1
• CPC Class Codes: H04L 63/20 for managing network security; network security policies in general filtering policies H04L63/0227

Abstract

Systems and methods that provide for assignment and recovery of tokens as part of a plurality of nodes and distributed application framework/network. The assignment component assigns numbers and tasks to candidates and facilitates multiple leader election. Moreover, a recovery component can recover a token for a node that leaves the network (e.g., crashes). Such recovery component ensures consistency, wherein only one server is assigned recovery of the token and associated tasks.

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

an assignment component that assigns a token to a node, at no time two nodes claim ownership of a same token.

2. The computer implemented system of claim 1 further comprising a recovery component that recovers a token from a failed node and assigns to another node.

3. The computer implemented system of claim 1 further comprising probe messages that are exchanged between nodes.

4. The computer implemented system of claim 3 further comprising echo messages.

5. The computer implemented system of claim 1 further comprising a mapping function that maps node identities to nodes.

6. The computer implemented system of claim 5, the node is a synchronized node that indicates that the node has not obtained a routing token.

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 successor node and a predecessor node to create a ring that form the federation.

9. The computer implemented system of claim 8 further comprising a token that is separable into two ranges for transfer to immediate neighborhoods.

10. A method of retrieving a token in a federation comprising:

determining that a node has left the federation;

detecting a gap in a token of the node; and

recovering the token while ensuring consistency.

11. The method of claim 10 further comprising splitting the token of the node between a successor node and a predecessor of the node

12. The method of claim 10 further comprising sending a probe message from one routing node to another routing node.

13. The method of claim 12 further comprising sending an echo message in response to the probe message

14. The method of claim 13 further comprising checking unavailable nodes.

15. The method of claim 13 further comprising the echo reaching an originator of the probe message.

16. The method of claim 13 further comprising incrementing a routing token.

17. The method of claim 13 further comprising preventing acceptance of a token before obtaining an echo.

18. The method of claim 13 further comprising assigning numbers and tasks to nodes to facilitate multiple leader election.

19. The method of claim 13 further comprising claiming ownership of an identification (ID) in the federation by at most one node.

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 assigning a token to a node without two nodes claiming ownership of a same token.