Address generation and cluster extension in distributed systems using tree method

A computer-accessible, non-transitory, storage medium encoded with computer-readable instructions configured to cause one or more data processing apparatus to:

• establish a cluster of leaf nodes and a cluster of back-end servers, the cluster of back-end servers organized into a data structure of at least one leaf node, each leaf node in the cluster of leaf nodes assigned a unique leaf node identifier, each element of the leaf node identifier identifying a branch of the data structure traversed to reach the leaf node, and each back-end server assigned to a particular leaf node and mirroring other back-end servers assigned to the same particular leaf node;
• store new data objects on each back-end server assigned to the particular leaf node, the particular leaf node providing for each new data object a universal identifier including:
• (i) an object identifier that is unique on the particular leaf node;
• and
• (ii) a server identifier including the leaf node identifier of the particular leaf node to which the assigned back-end servers storing the new data objects are assigned;
• and
• split, by operation of a computer, the particular leaf node into at least two new leaf nodes to replace the particular leaf node, wherein splitting the particular leaf node includes reassigning the cluster of back-end servers, originally organized into the particular leaf node, to the at least two new leaf nodes such that each new leaf node is assigned at least two back-end servers of the cluster of back-end servers, and wherein a first back-end server of the back-end servers assigned to each new leaf node mirrors other back-end servers assigned to the same particular new leaf node but does not mirror the back-end servers reassigned to other new leaf nodes replacing the particular leaf node.

A system, comprising:

• at least one computer configured to:
• establish a cluster of leaf nodes and a cluster of back-end servers, the cluster of back-end servers organized into a data structure of at least one leaf node, each leaf node in the cluster of leaf nodes assigned a unique leaf node identifier, each element of the leaf node identifier identifying a branch of the data structure traversed to reach the leaf node, and each back-end server assigned to a particular leaf node and mirroring other back-end servers assigned to the same particular leaf node;
• store new data objects on each back-end server assigned to the particular leaf node, the particular leaf node providing for each new data object a universal identifier including:
• (i) an object identifier that is unique on the particular leaf node;
• and
• (ii) a server identifier including the leaf node identifier of the particular leaf node to which the assigned back-end servers storing the new data objects are assigned;
• and
• split, by operation of a computer, the particular leaf node into at least two new leaf nodes to replace the particular leaf node, wherein splitting the particular leaf node includes reassigning the cluster of back-end servers, originally organized into the particular leaf node, to the at least two new leaf nodes such that each new leaf node is assigned at least two back-end servers of the cluster of back-end servers, and wherein a first back-end server of the back-end servers assigned to each new leaf node mirrors other back-end servers assigned to the same particular new leaf node but does not mirror the back-end servers reassigned to other new leaf nodes replacing the particular leaf node.