Distributed, Secure Load Balancing with Skew, Heterogeneity, and Churn
MetadataShow full item record
CitationLedlie, Jonathan and Margo Seltzer. 2005. Distributed, secure load balancing with skew, heterogeneity, and churn. In Proceedings of IEEE INFOCOM 2005 the conference on computer communications : 24th Annual Joint Conference of the IEEE Computer and Communications Societies : proceedings : 13-17 March, 2005, Hyatt Regency Miami, Miami, Florida, ed. Kia Makki and Edward Knightly, 1419 - 1430. Piscataway, N.J.: IEEE.
AbstractNumerous 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 heavytailed 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-thanideal conditions, but give up on important security properties. We propose an algorithm that both facilitates good performance and does not dilute security. Our 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 by basing each nodes’ set of potential identifiers on a single certificate. Our algorithm compares favorably to four others in trace-driven simulations. We have implemented our algorithm and found that it improved aggregate throughput by 20% in a widely heterogeneous system in our experiments.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:2962660
- FAS Scholarly Articles