Overlay mesh construction using interleaved spanning trees

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2004, Pages 396-407

  Young, Anthony ^a   Chen, Jiang ^a   Ma, Zheng ^a   Krishnamurthy, Arvind ^a   Peterson, Larry ^b   Wang, Randolph Y ^b  

^a YALE UNIVERSITY   (United States)

^b Princeton University   (United States)

Author keywords

Experimentation with real networks Testbeds; System design

Indexed keywords

MESH CONSTRUCTION; MULTI-PATH ROUTING; SPANNING TREES;

BROADCASTING; DATA ACQUISITION; PROBLEM SOLVING; QUALITY OF SERVICE; ROUTERS; TREES (MATHEMATICS); VIDEO CONFERENCING;

INTERNET;

EID: 8344275898     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (38)

1. Stefan Savage, Andy Collins, Eric Hoffman, John Snell, and Thomas E. Anderson, "The end-to-end effects of internet path selection," in SIGCOMM, 1999, pp. 289-299.
2. David G. Andersen, Hari Balakrishnan, M. Frans Kaashoek, and Robert Morris, "Resilient overlay networks," in Proceedings of SOSP, 2001, pp. 131-145.
3. T. Nguyen and A. Zakhor, "Path diversity with forward error correction (pdf) system for packet switched networks," in Proceedings of IEEE INFOCOM, 2003.
4. J. Apostolopoulos, T. Wong, W. Tan, and S. Wee, "On multiple description streaming with content delivery networks," in Proceedings of IEEE INFOCOM, 2002.
5. Yang hua Chu, Sanjay G. Rao, and Hui Zhang, "A case for end system multicast," in Proceedings of SIGMETRICS, 2000.
6. John Jannotti, David K. Gifford, Kirk L. Johnson, M. Frans Kaashoek, and James W. O'Toole, Jr., "Overcast: Reliable multicasting with an overlay network," in Proceedings of OSDI, 2000, pp. 197-212.
7. S. Q. Zhuang, B. Y. Zhao, A. D. Joseph, R. H. Katz, and J. Kubiatowicz, "Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination," in Proceedings of NOSSDAV, 2001.
8. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, "Application- level multicast using content-addressable networks," in Proceedings of NGC, 2001.
9. Suman Banerjee, Christopher Kommareddy, Koushik Kar, Bobby Bhattacharjee, and Samir Khuller, "Construction of an efficient overlay multicast infrastructure for real-time applications," in INFOCOM, 2003.
10. V. Padmanabhan, H. Wang, P. Chou, and K. Sripanidkulchai, "Distributing streaming media content using cooperative networking," in Proceedings of NOSSDAV, 2002.
11. John Byers, Jeffrey Considine, Michael Mitzenmacher, and Stanislav Rost, "Informed content delivery across adaptive overlay networks," in Proceedings of ACM SIGCOMM, 2002.
12. W. C. Cheng, C. Chou, L. Golubchik, S. Khuller, and Y. Wan, "Large-scale data collection: a coordinated approach," in Proceedings of IEEE INFOCOM, 2003.
13. Dimitris Pendarakis, Sherlia Shi, Dinesh Verma, and Marcel Waldvogel, "ALMI: An application level multicast infrastructure," in Proceedings of the USITS, 2001.
14. Paul Francis, "Yoid: Extending the internet multicast architecture," 2000.
15. Beichuan Zhang, Sugih Jamin, and Lixia Zhang, "Host multicast: A framework for delivering multicast to end users," in INFOCOM, 2002.
16. David A. Helder and Sugih Jamin, "End-host multicast communication using switch-trees protocols," in Global and Peer-to-Peer Computing on Large Scale Distributed Systems, 2002.
17. Wnejie Wang, David Helder, Sugih Jamin, and Lixia Zhang, "Overlay optimizations for end-host multicast," in Proceedings of Fourth International Workshop on Networked Group Communication, 2002.
18. Suman Banerjee, Bobby Bhattacharjee, and Christopher Kommareddy, "Scalable application layer multicast," in Proceedings of ACM SIGCOMM, 2002.
19. Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," in Proceedings of SIGCOMM, 2001.
20. Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker, "A scalable content addressable network," in Proceedings of ACM SIGCOMM, 2001.
21. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. Kubiatowicz, "Tapestry: A resilient global-scale overlay for service deployment," IEEE Journal on Selected Areas in Communications.
22. A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," in International Conference on Distributed Systems Platforms, 2002.
23. M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron, "Scribe : A large-scale and decentralized application-level multicast infrastructure, " IEEE Journal on Selected Areas in communications, 2002.
24. M. Castro, P. Druschel, Y. Hu, and A. Rowstron, "Topology aware routing in structured peer-to-peer overlay networks," 2002.
25. P. Keleher, B. Bhattacharjee, and B. Silaghi, "Are virtualized overlay networks too much of a good thing," 2002.
26. Sushant Jain, Ratal Mahajan, and David Wetherall, "A study of the performance potential of dht-based overlays," in Proc. of USITS, 2003.
27. Samir Khuller and Uzi Vishkin, "Biconnectivity approximations and graph carvings," in Proceedings of ACM STOC, 1992.
28. Robert G. Gallager, Pierre A. Humblet, and P. M. Spira, "A distributed algorithm for minimum-weight spanning trees," ACM TOPLAS, vol. 5, no. 1, pp. 66-77, January 1983.
29. Sylvia Ratnasamy, Mark Handley, Richard Karp, and Scott Shenker, "Topologically-aware overlay construction and server selection," in Proc. of IEEE INFOCOM, 2002.
30. Gurdip Singh and Arthur J. Bernstein, "A highly asynchronous minimum spanning tree protocol," Distributed Computing, vol. 8, no. 3, 1995.
31. H. N. Gabow, "A matroid approach to finding edge connectivity and packing arborescences," J. Computer & System Sciences, 1995.
32. James Roskind and Robert E. Tarjan, "A note on finding minimum cost edge disjoint spanning trees," Mathematics of Operations Research, vol. 10, no. 4, pp. 701-708, November 1985.
33. B. Awerbuch, "Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems," in Proceedings of STOC, 1987, pp. 230-240.
34. Nancy Lynch, Distributed Algorithms, Morgan Kaufmann Publishers, Inc., 1996.
35. Radia Perlman, Interconnections: bridges and routers, Addison Wesley Longman Publishing Co., Inc., 1992.
36. Michalis Faloutsos and Mart Molle, "What features really make distributed algorithms efficient," International Conference on Parallel and Distributed Systems, 1996.
37. Ramesh Govindan and Hongsuda Tangmunarunkit, "Heuristics for internet map discovery," in Proc IEEE Infocom, 2000.
38. Hongsuda Tangmunarunkit, Ramesh Govindan, Sugih Jamin, Scott Shenker, and Walter Willinger, "Network topology generators: Degree based vs. structural," in Proceedings of ACM SIGCOMM, 2002.