Summary: Load Balancing and Locality in RangeQueriable Data
James Aspnes #+ Jonathan Kirsch ## Arvind Krishnamurthy #§
We describe a loadbalancing mechanism for assigning elements to
servers in a distributed data structure that supports range queries.
The mechanism ensures both loadbalancing with respect to an
arbitrary load measure specified by the user and geographical lo
cality, assigning elements with similar keys to the same server.
Though our mechanism is specifically designed to improve the per
formance of skip graphs, it can be adapted to provide deterministic,
localitypreserving loadbalancing to any distributed data structure
that orders machines in a ring or line.
Categories and Subject Descriptors
C.2.2 [Computer Communication Networks]: Network Proto
cols---Applications, routing protocols
Algorithms, Performance, Experimentation
Peertopeer systems, Overlay networks