Elastic routing table with provable performance for congestion control in DHT networks

Proceedings - International Conference on Distributed Computing Systems

Volumn 2006, Issue , 2006, Pages

  Shen, Haiying ^a   Xu, Cheng Zhong ^a  

^a Wayne State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED HASH TABLE (DHT); ELASTIC ROUTING TABLE (ERT); LOAD BALANCING PROBLEM; RANDOMIZED QUERY;

ALGORITHMS; COMPUTER SIMULATION; MATHEMATICAL MODELS; QUERY LANGUAGES; TABLE LOOKUP; TIME VARYING NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33947676851     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2006.35     Document Type: Conference Paper

References (17)

1. L. A. Adamic, B. A. Huberman, R. M. Lukose, and A. R. Puniyani. Search in power law networks. In Physical Review E, volume 64, pages 46135-46143, 2001.
2. A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: supporting scalable multi-attribute range queries. In Proc. of ACM SIGCOMM, 2004.
3. M. Bienkowski, M. Korzeniowski, and F. M. auf der Heide. Dynamic load balancing in distributed hash tables. In Proc. of IPTPS, 2005.
4. M. Castro, M. Costa, and A. Rowstron. Debunking some myths about structured and unstructured overlays. In Proc. of NSDI, 2005.
5. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker. Making gnutella-like p2p systems scalable. In Proc. of ACM SIGCOMM, 2003.
6. I. Clarke and O. Sandberg et al. Freenet: A distributed anonymous information storage and retrieval system. In Proc. International Workshop on Design Issues in Anonymity and Unobservability, pages 46-66, 2001.
7. B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica. Load balancing in dynamic structured p2p systems. Performance Evaluation, 63(3), 2006.
8. B. Godfrey and 1. Stoica. Heterogeneity and load balance in distributed hash tables. In Proc. of INFOCOM, 2005.
9. B. Levine and C. Shields. Hordes: A multicast-based protocol for anonymity. Journal of Computer Security, 10(3):213-240, 2002.
10. Q. Lv, S. Ratnasamy, and S. Shenker. Can heterogeneity make gnutella scalable? In Proc. of IPTPS, 2002.
11. G. Manku. Balanced binary trees for ID management and load balance in distributed hash tables. In Proc. of PODC, 2004.
12. M. Mitzenmacher. On the analysis of randomized load balancing schemes. In Proc. of SPAA, 1997.
13. M. Mitzenmacher, B. Prabhakar, and D. Shah. Load balancing with memory. In Proc. of FOCS, 2002.
14. H. Shen and C. Xu. Elastic routing table for congestion control in chord. Technical report, Electrical and Computer Engineering Dept, Wayne State University, 2005.
15. H. Shen and C. Xu. Locality-aware randomized load balancing algorithms for structured p2p networks. In Proc. of ICPP, pages 529-536, 2005.
16. H. Shen, C. Xu, and G. Chen. Cycloid: A scalable constant-degree p2p overlay network. Performance Evaluation, 63(3): 195-216, 2006.
17. I. Stoica and R. Morris et al. Chord: A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networking, 2003.