Load Balancing White Papers
Distributed, Secure Load Balancing With Skew, Heterogeneity, and Churn
Overview Numerous proposals exist for load balancing in peer-to-peer (p2p) networks. Some focus on namespace balancing, making the distance between nodes as uniform as possible. This technique works well under ideal conditions, but not under those found empirically. Instead, researchers have found heavy-tailed query distributions (skew), high rates of node join and leave (churn), and wide variation in node network and storage capacity (heterogeneity). Other approaches tackle these less-than-ideal conditions, but give up on important security properties. This paper proposes an algorithm that both facilitates good performance and does not dilute security. This algorithm, k-Choices, achieves load balance by greedily matching nodes' target workloads with actual applied workloads through limited sampling, and limits any fundamental decrease in security.
| Publisher | Harvard University | File Format | |
|---|---|---|---|
| Date Published | March 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
