Abstract: A method for re-routing a request in a distributed system, that includes sending the request for an originating object, receiving the request at a root node of the originating object, determining whether the root node comprises a first forwarding pointer associated with the originating object, determining a first target object using the first forwarding pointer, if the first forwarding pointer is associated with the originating object, and re-routing the request to the first target object, wherein the distributed system implements an overlay network for message delivery.

Abstract: A method for managing object evolution in a distributed object store (DOS) involving requesting an update of an object, wherein the object includes an active globally unique identifier (AGUID) object and at least one version globally unique identifier (VGUID) object, wherein the at least one VGUID object includes a first generation number and a first serializer name, locating a first serializer using the first serializer name, wherein the first serializer is associated with the first generation number, obtaining an order of the update using the first serializer, and creating a new VGUID object, wherein the new VGUID object includes a new version number, the first generation number, and the first serializer name.

Abstract: A method for locating a resource involves maintaining a capacity object configured to store server information for a plurality of servers, transmitting a resource request from a client to an indirection server comprising the capacity object, selecting one of the plurality of servers to service the resource request using server associated with the capacity object to obtain a selected server, and redirecting the resource request from the indirection server to the selected server.

Abstract: A method for locating a free resource involves maintaining an address space containing a plurality of regions, wherein each of the plurality of regions is mapped with a server to obtain a mapping, transmitting a request for the free resource from a client to a request address that belongs to one of the plurality of regions, determining a selected server using the mapping, and directing the request for the free resource to the selected server.

Abstract: A method for storing a first copy of an object, including obtaining the object including a globally unique identifier (GUID), generating a first derived GUID using the GUID of the object, storing the first copy of the object identified by the first derived GUID in a root node of the object, publishing possession of the first copy of the object identified by the first derived GUID by the root node of the object, associating a first shadow root with the first copy of the object, and storing the first copy of the object identified by the GUID in the first shadow root.

Abstract: A method for monitoring a target node in a distributed system, that includes determining a plurality of neighbor nodes of the target node, determining a plurality of neighbor watch nodes, wherein the plurality of neighbor watch nodes are selected from the plurality of neighbor nodes, monitoring at least one selected from the group consisting of data sent by the target node and data received by the target node, using at least one of the plurality of neighbor watch nodes to obtain tracking information, and determining, using at least one the plurality of neighbor watch nodes, an action to perform using the tracking information and a response policy, wherein the action is specified in the response policy, wherein the distributed system implements an overlay network for message delivery.

Abstract: A method for approving a response or a decision of an observed node in a distributed system that includes generating at least one selected from the group consisting of the response and the decision by the observed node, forwarding the at least one selected from the group consisting of the response and the decision to at least one of the plurality of chaperones associated with the observed node based on a chaperone scheme, and approving the least one selected from the group consisting of the response and the decision by the plurality of chaperones using a chaperone voting policy and a chaperone approval policy to obtain at least one selected from the group consisting of a approved response and a approved decision, wherein the distributed system implements an overlay network for message delivery, and wherein the observed node and the plurality of chaperones communicate using the overlay network.

Abstract: A method for serializer maintenance and coalescing in a distributed object store (DOS) including a first partition and a second partition, involving requesting an update of an object, wherein the object includes an active globally unique identifier (AGUID) object and at least one version globally unique identifier (VGUID) object, wherein the least one VGUID object includes a first generation number and a first serializer name, determining whether a first serializer is located in the first partition using the first serializer name, wherein the first serializer is associated with the first generation number, if the first serializer is not located in the first partition, constructing a second serializer using the first serializer name, assigning a second generation number to the second serializer, obtaining an order of the update to the object using the second serializer, and creating a new VGUID object.

Abstract: The invention involves a method for aggregating data in a distributed system. The method includes specifying an aggregation scope including a plurality of nodes, where the plurality of nodes includes a destination node and a plurality of non-destination nodes. The method also includes defining an aggregation tree for the plurality of nodes using at least one Distributed Hash Table, where the destination node is the root of the aggregation tree and where each of the plurality of non-destination nodes is one selected from a group of an interior node and a leaf node in the aggregation tree. The method also includes determining a final aggregation result for the aggregation tree using an aggregation function and aggregation data stored on the destination node and the plurality of non-destination nodes.

Abstract: An upstream bandwidth allocation scheduler is provided for use within a Line Termination (LT) unit in a point to multi-point data communications network in order to service multiple Network Termination (NT) units. The scheduler first allocates bandwidth among the several categories of data handled by the network (e.g., voice, IP, and ATM data), and then allocates bandwidth among the several users for each category within the network. A function ƒ is defined, as part of a “min-max weighted fairness” scheme, in order to allocate surplus bandwidth among both the categories and users of the network. The scheduler of the present invention, while allocating upstream bandwidth, also supports various quality of service (QoS) categories to subscribers of the network.

Abstract: One embodiment of the present invention provides a system that resolves conflicts between rules for network services. During operation, the system receives a set of network service rules for network data traffic from multiple network services, wherein network service rules from different network services can possibly conflict. Next, the system identifies conflicts between pairs of network service rules in the set of network service rules. The system then determines a priority relationship between each pair of conflicting network service rules, and assigns priorities to the network service rules in a manner consistent with the determined priority relationships. This allows conflicts between network service rules to be subsequently resolved based on the assigned priorities.

Abstract: An upstream bandwidth allocation scheduler is provided for use within a Line Termination (LT) unit in a point to multi-point data communications network in order to service multiple Network Termination (NT) units. The scheduler first allocates bandwidth among the several categories of data handled by the network (e.g., voice, IP, and ATM data), and then allocates bandwidth among the several users for each category within the network. A function ƒ is defined, as part of a “min-max weighted fairness” scheme, in order to allocate surplus bandwidth among both the categories and users of the network. The scheduler of the present invention, while allocating upstream bandwidth, also supports various quality of service (QoS) categories to subscribers of the network.