Locality-aware randomized load balancing algorithms for DHT networks

Proceedings of the International Conference on Parallel Processing

Volumn 2005, Issue , 2005, Pages 529-536

  Shen, Haiying ^a   Xu, Cheng Zhong ^a  

^a Wayne State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOCALITY-AWARE ALGORITHMS; P2P OVERLAY NETWORKS; RANDOMIZED LOAD BALANCING EFFICIENCY; SEQUENTIAL ALGORITHMS;

ALGORITHMS; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES;

COMPUTER NETWORKS;

EID: 33745152727     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2005.49     Document Type: Conference Paper

References (16)

1. Y. Azar, A. Broder, A. Karlin, and E. Upfal. Balanced allocations. In Proc. of ACM STOC. pages 593-602, 1994.
2. B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica. Load balancing in dynamic structured p2p systems. In Proc. of IEEE INFOCOM, 2004.
3. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and P. R. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proc. of STOC, pages 654-663. 1997.
4. D. R. Karger and M. Ruhl. Simple efficient load balancing algorithms for peer-to-peer systems. In Porc. of IPTPS, 2004.
5. M. Mitzenmacher. On the analysis of randomized load balancing schemes. In Proc. of the 9th ACM SPAA, pages 292-301, 1997.
6. A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica. Load balancing in structured p2p systems. In Proc. of IPTPS. 2003.
7. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proc. of ACM SIGCOMM, pages 329-350, 2001.
8. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In Proc. of IFIP/ACM Middleware, 2001.
9. H. Shen and C. Xu. Locality-aware randomized load balancing algorithms for structured p2p systems. Technical report, LCL Department. Wayne State University, 2004.
10. H. Shen, C. Xu, and G. Chen. Cycloid: A scalable constantdegree p2p overlay network. Performance Evaluation, 2005.
11. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek. and H. Balakrishnan. Chord: A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networking. 1(1): 17-32.
12. K. Whitehouse, C. Sharp, E. Brewer, and D. Culler. Hood: A neighborhood abstraction for sensor networks. In Proc. of MOBISYS, 2004.
13. Z. Xu, C. Tang, and Z. Zhang. Building topology-aware overlays using global soft-state. In Proc. of ICDCS, 2003.
14. B. Yang and H. Garcia-Molina. Designing a super-peer network. In Proc. of ICDE, 2003.
15. E. Zegura, K. Calvert, and S. Bhattacharjee. How to model an internet work. In Proc. of IEEE INFOCOM. 1996.
16. Y. Zhu and Y Hu. Towards efficient load balancing in structured p2p systems. In Proc. of IPDPS. 2004.