SAT-Match: A self-adaptive topology matching method to achieve low lookup latency in structured P2P overlay networks

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 1165-1173

  Ren, Shansi ^a   Guo, Lei ^a   Jiang, Song ^a   Zhang, Xiaodong ^a  

^a The College of William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED HASH TABLES (DHT); LOGICAL LINK LATENCY; LOGICAL OVERLAYS;

ALGORITHMS; COMPUTER SIMULATION; PROBLEM SOLVING; ROUTERS; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

NETWORK PROTOCOLS;

EID: 12444257407     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. M. Castro, P. Druschel, Y. Hu, and A. Rowstron. Exploiting network proximity in distributed hash tables. In Proceedings of FuDiCo 2002, Bertinoro, Italy, June 2002.
2. Gnutella. http://www.gnutella.com/.
3. L. Guo, S. Chen, S. Ren, X. Chen, and S. Jiang. Prop: a scalable and reliable p2p assisted proxy streaming system. In Proceedings of ICDCS 2004, Tokyo, Japan, March 2004.
4. S. Jiang, L. Guo, and X. Zhang. Lighflood: an efficient flooding scheme for file search in unstructured peer-to-peer systems. In Proceedings of ICPP 2003, pages 149-160, Kaohsiung, Taiwan, October 2003.
5. Y. Liu, X. Liu, L. Xiao, L. Ni, and X. Zhang. Location-aware topology matching in unstructured p2p systems. In Proceedings of INFOCOM 2004, Hong Kong, China, March 2004.
6. Y. Liu, Z. Zhuang, L. Xiao, and L. M. Ni. A distributed approach to solving overlay mismatching problem. In Proceedings of ICDCS 2004, Tokyo, Japan, March 2004.
7. Napster. http://www.napster.com/.
8. S. Ratnasamy, P. Francis, M. Handley, and R. Karp. A scalable content-addressable network. In Proceedings of SIGCOMM 2001, pages 161-172, San Diego, CA, USA, August 2001.
9. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Topologically-aware overlay construction and server selection. In Proceedings of INFOCOM 2002, New York, NY, USA, June 2002.
10. I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of SIGCOMM 2001, pages 149-160, San Deigo, CA, USA, August 2001.
11. M. Waldvogel and R. Rinaldi. Efficient topology-aware overlay network. In Proceedings of HotNets-I, Princeton, NJ, USA, October 2002.
12. Z. Xu, C. Tang, and Z. Zhang. Building topology-aware overlays using global soft-state. In Proceedings of ICDCS 2003, pages 500-508, Providence, RI, USA, May 2003.
13. E. W. Zegura, K. L. Calvert, and S. Bhattacharjee. How to model an internetwork. In Proceedings of INFOCOM 1996, volume 2, pages 594-602, San Francisco, CA, USA, March 1996.
14. B. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical report, UC Berkeley, April 2001.