Method for generating universal objects identifiers in distributed multi-purpose storage systems

An apparatus, comprising:

• a distributed storage system;
• and,
• an application server having a processor and a memory, the application server having an interface to couple to the distributed storage system that stores an object and replicas of the object, said application server to generate a key for the object or a replica of the object and pass the key through the interface, said application server comprising program code stored on a computer readable storage medium, said program code to cause the following method to be performed when executed by a processing unit of the application server:
• structure the key to include a payload comprising an application object ID, a namespace, an application type and application specific information;
• generate for inclusion into the key a dispersion field calculated as:
• for a first instance of the object:
• a dispersion constant calculated as a hash of the payload and R where R is a revision value of the object that increments with each new revision of the object;
• for the first and subsequent replicas of the object:
• a modulo operation that divides two terms, a first of the terms including a summation of the dispersion constant keyspace size term, said keyspace size term normalized by a term that increases with the number of replicas, a second of the terms being said keyspace size term;
• generate for inclusion into the key a field identifying the number of replicas for the object;
• generate for inclusion into the key a replica number specific to the key's associated object;
• perform a hash of a secret key, the payload and R and incorporate the hash with the key;
• wherein, upon the application server passing the key through the interface to the distributed data storage system, the distributed storage system proceeds to:
• route the key through the distributed data storage system based on the field that identifies the number of replicas for the object and the replica number that is specific to the key's object;
• access a keyspace location based on the dispersion field;
• prevent unwanted access to the object by an entity that does not know the secret key.

A non-transitory machine readable storage medium having stored thereon program code that when processed by a processing unit of a computing system causes the computing system to perform a method, comprising:

• structuring the key to include a payload comprising an application object ID, a namespace, an application type and application specific information, the key for accessing an object from a distributed object storage system that stores the object and replicas of the object;
• generating for inclusion into the key a dispersion field calculated as:
• for a first instance of the object:
• a dispersion constant calculated as a hash of the payload and R where R is a revision value of the object that increments with each new revision of the object;
• for the first and subsequent replicas of the object:
• a modulo operation that divides two terms, a first of the terms including a summation of the dispersion constant keyspace size term, said keyspace size term normalized by a term that increases with the number of replicas, a second of the terms being said keyspace size term;
• generating for inclusion into the key a field identifying the number of replicas for the object;
• generating for inclusion into the key a replica number specific to the key's associated object;
• performing a hash of a secret key, the payload and R and incorporate the hash with the key;
• forwarding the key toward an interface to the distributed data storage system wherein unwanted access to the object is prevented by an entity that does not know the secret key.

A method, comprising:

• structuring a key to include a payload comprising an application object ID, a namespace, an application type and application specific information, the key for accessing an object or a replica of the object from a distributed object storage system that stores the object and replicas of the object;
• generating for inclusion into the key a dispersion field calculated as:
• for a first instance of the object:
• a dispersion constant calculated as a hash of the payload and R where R is a revision value of the object that increments with each new revision of the object;
• for the first and subsequent replicas of the object:
• a modulo operation that divides two terms, a first of the terms including a summation of the dispersion constant and a keyspace size term, said keyspace size term normalized by a term that increases with the number of replicas, a second of the terms being said keyspace size term;
• generating for inclusion into the key a field identifying the number of replicas for the object;
• generating for inclusion into the key a replica number specific to the key's associated object;
• performing a hash of a secret key, the payload and R and incorporate the hash with the key;
• and,
• forwarding the key toward an interface to the distributed data storage system wherein unwanted access to the object is prevented by an entity that does not know the secret key.