Dynamic distributed data system and method
DCFirst Claim
Patent Images
1. A method for maintaining storage object consistency among nodes in a distributed storage architecture including a repository of last resort, the method comprising the steps of:
- (a) monitoring storage object requests to the repository of last resort;
(b) deciding whether to migrate the repository of last resort; and
(c) migrating the repository of last resort.
10 Assignments
Litigations
3 Petitions
Accused Products
Abstract
A system and method for maintaining storage object consistency across a distributed storage network including a migratable repository of last resort which stores a last or only remaining data replica that may not be deleted. The method includes the steps of monitoring data requests to the repository of last resort, deciding whether to move the repository of last resort, and migrating the repository of last resort.
-
Citations
36 Claims
-
1. A method for maintaining storage object consistency among nodes in a distributed storage architecture including a repository of last resort, the method comprising the steps of:
-
(a) monitoring storage object requests to the repository of last resort;
(b) deciding whether to migrate the repository of last resort; and
(c) migrating the repository of last resort. - View Dependent Claims (2, 3, 4)
-
-
5. A system for maintaining storage object consistency among nodes in a distributed system architecture including a repository of last resort, comprising:
-
a processor;
a storage coupled to the processor;
the processor operable to monitor data requests to the repository of last resort, decide whether to move the repository of last resort, and migrate the repository of last resort.
-
-
6. A system for maintaining storage object consistency among nodes in a distributed system architecture, each node including a processor and a storage coupled to the processor, the distributed system architecture having a repository of last resort, the system comprising:
a plurality of bits stored in an associated routing table of each node, the processor of each node operable to read the bits stored in the associated routing table and determine a direction to the repository of last resort through a neighbor node.
-
7. A distributed storage network, comprising:
-
a plurality of connected nodes, each node being capable of caching a storage object, a name tag for the storage object, and state bits for the storage object including an ownership bit, a shared direction bit, and a repository of last resort pointer. - View Dependent Claims (8, 9, 10, 11, 12, 13, 14, 15)
-
-
16. A distributed storage network, comprising:
-
a plurality of nodes connected by links, each node including a cache memory configured to cache a plurality of storage objects; and
a routing table configured to store an entry for a storage object, the entry having a name tag, an ownership bit, a shared direction bit, and a repository of last resort pointer. - View Dependent Claims (17, 18, 19, 20, 21, 22, 23, 24, 25, 26)
-
-
27. A cache only memory architecture, comprising:
-
a plurality of storage objects;
a plurality of nodes, each node including a processor, a cache memory attached to the processor and configured to store one or more of the plurality of storage objects such that the plurality of storage objects are distributed over the plurality of nodes, and a routing table configured to store for each of the plurality of storage objects an ownership bit, a shared direction bit, and a pointer to a repository of last resort, the repository of last resort being one of the plurality of nodes designated to cache an undeletable copy of the storage object; and
a plurality of links coupling the plurality of nodes.
-
-
28. A method for adding a new node to a distributed storage network including a plurality of connected nodes, comprising:
-
linking the new node to one of the plurality of connected nodes; and
configuring a routing table of the new node to be able to store an entry for a storage object, the entry having a name tag, an ownership bit, a shared direction bit, and a pointer to a repository of last resort, the repository of last resort being one of the plurality of connected nodes designed to cache an undeletable copy of the storage object.
-
-
29. A method for transferring ownership of a storage object in a distributed storage network including a plurality of connected nodes, each node having a routing table configured to store for the storage object an ownership bit and a pointer for a repository of last resort, the repository of last resort being a node designated to cache an undeletable copy of the storage object, comprising:
-
routing a request ownership transaction from a requesting node to the repository of last resort by following a link specified by the pointer; and
routing a response from the repository of last resort to the requesting node. - View Dependent Claims (30, 31, 32, 33)
-
-
34. A method for supplying a copy of a storage object to a requesting node in a distributed storage network including a plurality of connected nodes, each node having a routing table configured to store for the storage object an ownership bit and a pointer for a repository of last resort, the repository of last resort being a node designated to cache an undeletable copy of the storage object, comprising:
-
routing a request for the storage object from the requesting node towards the repository of last resort by following a link specified by the pointer; and
routing a copy of the storage object to the requesting node. - View Dependent Claims (35, 36)
-
Specification