Load Balancing White Papers
Dynamic Load Balancing in Distributed Hash Tables
Overview In Peer-to-Peer networks based on consistent hashing and ring topology each server is responsible for an interval chosen (pseudo-)randomly on a circle. The topology of the network, the communication load and the amount of data a server stores depend heavily on the length of its interval. Additionally the nodes are allowed to join the network or to leave it at any time. Such operations can destroy the balance of the network, even if all the intervals had equal lengths in the beginning. This paper deals with the task of keeping such a system balanced so that the lengths of intervals assigned to the nodes differ at most by a constant factor.
| Publisher | Cornell University | File Format | |
|---|---|---|---|
| Date Published | January 2005 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful? 2 out of 4 users found this white paper useful
White Paper RSS
Download
Register
