Load Balancing White Papers
Multiple-Choice Random Network for Server Load Balancing
Overview In many networking applications such as file sharing, structured peer-to-peer networks are increasingly used in dynamic situations with fluctuating load, which require proper load balancing. The relationship between the network structure and its load-balancing properties has not been fully understood. This paper focus on the Plaxton-type networks, which are broad enough to include Pastry, Tapestry, and hypercube. First hypercube is used as an example and demonstrate that replicating files at nodes in decreasing order of the length of the common prefix with the original server leads to perfectly balanced load, and does so fast and efficiently. Moreover, this replication strategy coincides with a simple on-demand replication/caching strategy based on the observed load.
| Publisher | University of Florida | File Format | |
|---|---|---|---|
| Date Published | January 2007 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful? 3 out of 5 users found this white paper useful
White Paper RSS
Download
Register
