ALLOCATING AND RECLAIMING RESOURCES WITHIN A RENDEZVOUS FEDERATION
First Claim
1. In a federation infrastructure of a ring of nodes configured for bi-directional routing, the ring of nodes including at least a receiving node, an immediate predecessor neighbor node preceding the receiving node on the ring of nodes, and an immediate successor neighbor node succeeding the receiving node on the ring of nodes, a method for routing a message towards a destination node, the method comprising:
- an act of a receiving node receiving a message along with a destination identifier indicating a destination on the ring of nodes, the destination identifier located between the receiving node and an immediate neighborhood node selected from among the immediate predecessor neighbor node and the immediate successor neighborhood node;
an act of the receiving node referring to a cached two-way agreement between the receiving node and the immediate neighbor node to determine the next appropriate node that is to receive the message, the cached two-way agreement at least implying a division of responsibility for the identifier space between the receiving node and an immediate neighbor node;
an act of sending the message to the next appropriate component based on the determination of the next appropriate node.
2 Assignments
0 Petitions
Accused Products
Abstract
The present invention extends to methods, systems, and computer program products for allocating and reclaiming resources within a rendezvous federation. Embodiments of the invention include formulating and routing messages in accordance with cached two-way agreements between adjacent nodes on a ring of nodes. Cached two-way agreements divide responsibility for at least unoccupied identifiers between the adjacent nodes on a ring. When a message is received at a node, the node can refer to a cached two-way agreement to determine if it or an adjacent node is responsible for the message. The node then sends the message to the next appropriate component in accordance with the cached two-way agreement.
99 Citations
20 Claims
-
1. In a federation infrastructure of a ring of nodes configured for bi-directional routing, the ring of nodes including at least a receiving node, an immediate predecessor neighbor node preceding the receiving node on the ring of nodes, and an immediate successor neighbor node succeeding the receiving node on the ring of nodes, a method for routing a message towards a destination node, the method comprising:
-
an act of a receiving node receiving a message along with a destination identifier indicating a destination on the ring of nodes, the destination identifier located between the receiving node and an immediate neighborhood node selected from among the immediate predecessor neighbor node and the immediate successor neighborhood node;
an act of the receiving node referring to a cached two-way agreement between the receiving node and the immediate neighbor node to determine the next appropriate node that is to receive the message, the cached two-way agreement at least implying a division of responsibility for the identifier space between the receiving node and an immediate neighbor node;
an act of sending the message to the next appropriate component based on the determination of the next appropriate node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. In a federation infrastructure of a ring of nodes configured for bi-directional routing, the ring of nodes including at least a receiving node, an immediate predecessor neighborhood node for the receiving node, and an immediate successor neighborhood node for the receiving node, a method for routing a message towards a destination node, the method comprising:
-
an act of a receiving node receiving a message along with a destination identifier indicating a destination on the ring of nodes;
an act of the receiving node referring to a first cached two-way agreement with the immediate predecessor neighborhood node and a second cached two-way agreement with the immediate successor neighborhood node to determine the next appropriate node that is to receive the message, the first and second cached two-way agreements at least implying a division of responsibility for the identifier space between the immediate predecessor neighbor node and the immediate successor neighbor node; and
an act of sending the message to the next appropriate component based on the determination of the next appropriate node.
-
-
12. In a federation infrastructure of a ring of nodes configured for bi-directional routing, the ring of nodes including at least a current node, a current immediate predecessor neighbor node preceding the receiving node on the ring of nodes, and a current immediate successor neighbor node succeeding the receiving node on the ring of node, a method for formulating a two-way agreement between the current node and an immediate neighborhood node, the method comprising:
-
an act of the current node accessing an indication that the configuration of the ring of nodes has changed, the indication indicative of a change in at least a current immediate neighbor node selected from among the current immediate predecessor node and the current immediate successor node, the change resulting in a new immediate neighbor node, the indication further indicative of a need to formulate a two-way agreement dividing responsibility for at least unoccupied identifiers on the ring between the current node and the new immediate neighbor node; and
an act of the current node and the new immediate neighbor node agreeing to a responsibility boundary between the current node and new immediate neighbor node that is to divide responsibility for the unoccupied identifiers between the current node and the new immediate neighbor node, unoccupied identifiers between the current node and the responsibility boundary being the responsibility of the current node and unoccupied identifiers between the responsibility boundary and the new immediate neighbor node being the responsibility of the new immediate neighbor node. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19, 20)
-
Specification