Hybrid overlay structure based on random walks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3640 LNCS, Issue , 2005, Pages 152-162

  Tian, Ruixiong ^a,b   Xiong, Yongqiang ^b   Zhang, Qian ^b   Li, Bo ^c   Zhao, Ben Y ^d   Li, Xing ^a  

^a TSINGHUA UNIVERSITY   (China)

^b MICROSOFT RESEARCH ASIA   (China)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^d University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION-LEVEL MULTICAST; LOCALITY-AWARE; OVERLAY STRUCTURE; STRUCTURED CLUSTERS;

BANDWIDTH; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; INTERFACES (COMPUTER); TOPOLOGY;

MULTICASTING;

EID: 33646063180     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11558989_14     Document Type: Conference Paper

References (21)

1. The pinger project.
2. ASANO, T., ET AL. Space-filling curves and their use in the design of geometric data structures. Theoretical Computer Science 181, 1 (1997), 3-15.
3. CASTRO, M., P.DRUSCHEL, HU, Y., AND ROWSTRON, A. Exploiting network proximity in distributed hash tables. In International Workshop on Peer-to-Peer Systems (2002).
4. CHU, Y., RAO, S., SESHAN, S., AND ZHANG, H. Enabling conferencing applications on the internet using an overlay multicast architecture. In ACM SIGCOMM (August 2001).
5. DABEK, F., COX, R., KAASHOEK, F., AND MORRIS, R. Vivaldi: a decentralized network coordinate system. In A CM SIGCOMM (2004).
6. FILL, A. Reversible markov chains and random walks on graphs.
7. GANESAN, P., GUMMADI, K., AND GARCIA-MOLINA, H. Canon in g major: Designing dhts with hierarchical structure. In ICDCS (March 2004).
8. GKANTSIDIS, C., MIHAIL, M., AND SABERI, A. Random walks in peer-to-peer networks. In IEEE INFOCOM (March 2004).
9. KERMARREC, A.-M., MASSOULIE, L., AND GANESH, A. J. Probabilistic reliable dissemination in large-scale systems. IEEE Transactions on Parallel and Distributed systems 14, 3 (2003), 248-258.
10. KNUTSSON, B., LU, H., XU, W., AND HOPKINS, B. Peer-to-peer support for massively multiplayer games. In IEEE INFOCOM (March 2004).
11. LOGUINOV, D., KUMAR, A., RAI, V., AND GANESH, S. Graph-theoretic analysis of structured peer-to-peer systems: Routing distances and fault resilience. In ACM SIGCOMM (August 2003).
12. NG, T. S. E., AND ZHANG, H. Towards global network positioning. In ACM SIGCOMM IMW (2001).
13. ROWSTRON, A., AND DRUSCHEL, P. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In ACM Middleware (Nov. 2001).
14. ROWSTRON, A., KERMARREC, A.-M., CASTRO, M., AND DRUSCHEL, P. Scribe: The design of a large-scale event notification infrastructure. In NGC (UCL, London, Nov. 2001).
15. SEN, S., AND WANG, J. Analyzing peer-to-peer traffic across large networks. IEEE/ACM Trans. on Networking 12, 2 (2004), 219-232.
16. STOICA, I., MORRIS, R., KARGER, D., KAASHOEK, M. F., AND BALAKRISHNAN, H. Chord: A scalable peer-to-peer lookup service for internet applications. In ACM SIGCOMM (August 2001).
17. XU, Z., MATHALINGAM, M., AND KARLSSON, M. Turning heterogeneity into an advantage in overlay routing. In IEEE INFOCOM (June 2003).
18. ZHANG, X., ET AL. A construction of locality-aware overlay network: moverlay and its performance. IEEE JSAC (Jan. 2004).
19. ZHAO, B. Y., ET AL. Brocade: Landmark routing on overlay networks. In IPTPS (2002).
20. ZHAO, B. Y., ET AL. Tapestry: A resilient global-scale overlay for service deployment. IEEE JSAC 22, 1 (Jan. 2004), 41-53.
21. ZHUANG, S. Q., ET AL. Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In NOSSDAV (2001).