Anthony Young, Jiang Chen, Zheng Ma, Arvind Krishnamurthy, Larry Peterson, Randolph Y. Wang  Home/Search
Context Related
| ieeeinfocom.org/2004/Papers...09_3.PDF Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ieeeinfocom.or...echnicalprogram (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we evaluate a method of using interleaved spanning trees to compose a resilient, high performance overlay mesh. Though spanning trees of arbitrary type could be used to construct an overlay mesh, we focus on a distributed algorithm that computes k minimum spanning trees on an arbitrary graph. The principal motivation behind this strategy is to provide applications with a k-redundant, high quality mesh suitable for demanding applications like A/V broadcast, video conferencing, data ... (Update)
Cited by: More
End-host Controlled Multicast Routing - Karthik Lakshminarayanan Ananth (2006) (Correct)
Maintaining High Bandwidth under Dynamic Network Conditions - Dejan Kostic Ryan (Correct)
Multicast Service Overlay Design - Lao, Cui, Gerla (2005) (Correct)
Active bibliography (related documents): More All
2.6: Overlay Mesh Construction Using Interleaved Spanning.. - Young, Chen, Ma.. (2004) (Correct)
0.3: Power-Laws and the AS-level Internet Topology - Siganos, Faloutsos.. (2003) (Correct)
0.2: Improving VoIP Quality Through Path Switching - Shu Tao Kuai (2005) (Correct)
Similar documents based on text: More All
0.2: Trading Capacity for Performance in a Disk Array - Yu, Gum, Chen, Wang, Li.. (2000) (Correct)
0.2: A Transport Layer Approach for Improving.. - Zhang, Lai.. (2004) (Correct)
0.2: Probabilistic Packet Scheduling: Achieving.. - Zhang, Wang.. (2002) (Correct)
Related documents from co-citation: More All
2: Overcast: Reliable multicasting with an overlay network - Jannotti, Gifford et al. - 2000
2: distributed object location and routing for large-scale peer-to-peer systems (context) - Rowstron, Druschel et al. - 2001
2: Almi: An application level multicast infrastructure - Pendarakis, Shi et al. - 2001
BibTeX entry: (Update)
A. Young, C. Jiang, M. Zheng, A. Krishnamurthy, L. Peterson, and R. Y. Wang. Overlay mesh construction using interleaved spanning trees. In Proceedings of IEEE INFOCOM, Mar. 2004. http://citeseer.ist.psu.edu/young04overlay.html More
@misc{ young04overlay,
author = "A. Young and C. Jiang and M. Zheng and A. Krishnamurthy and L. Peterson
and R. Wang",
title = "Overlay mesh construction using interleaved spanning trees",
text = "A. Young, C. Jiang, M. Zheng, A. Krishnamurthy, L. Peterson, and R. Y.
Wang. Overlay mesh construction using interleaved spanning trees. In Proceedings
of IEEE INFOCOM, Mar. 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/young04overlay.html" }
Citations (may not include all citations):1225 Chord: A scalable peer-to-peer lookup service for internet a.. - Stoica, Morris et al. - 2001
1023 A scalable content addressable network - Ratnasamy, Francis et al. - 2001
718 Distributed Algorithms (context) - Lynch - 1996
402 A case for end system multicast - Chu, Rao et al. - 2000
307 Resilient overlay networks - Andersen, Balakrishnan et al. - 2001
186 Bayeux: An architecture for scalable and fault-tolerant wide.. - Zhuang, Zhao et al. - 2001
166 Heuristics for internet map discovery - Govindan, Tangmunarunkit - 2000
163 Scalable application layer multicast - Banerjee, Bhattacharjee et al. - 2002
145 Scribe : A large-scale and decentralized application-level m.. - Castro, Druschel et al. - 2002
144 Application-level multicast using content-addressable networ.. - Ratnasamy, Handley et al. - 2001
140 ALMI: An application level multicast infrastructure - Pendarakis, Shi et al. - 2001
134 The end-to-end effects of internet path selection - Savage, Collins et al. - 1999
117 Topologically-aware overlay construction and server selectio.. - Ratnasamy, Handley et al. - 2002
104 Pastry: Scalable, distributed object location and routing fo.. - Rowstron, Druschel - 2002
95 Interconnections: bridges and routers (context) - Perlman - 1992
81 Distributing streaming media content using cooperative netwo.. - Padmanabhan, Wang et al. - 2002
79 Tapestry: A resilient global-scale overlay for service deplo.. - Zhao, Huang et al.
68 Informed content delivery across adaptive overlay networks - Byers, Considine et al. - 2002
68 Yoid: Extending the internet multicast architecture (context) - Francis - 2000
44 Host multicast: A framework for delivering multicast to end .. - Zhang, Jamin et al. - 2002
38 A matroid approach to finding edge connectivity and packing .. (context) - Gabow - 1995
37 Overcast: Reliable multicasting with an overlay network - Jannotti, Gifford et al. - 2000
35 Biconnectivity approximations and graph carvings - Khuller, Vishkin - 1992
31 Construction of an efficient overlay multicast infrastructur.. - Banerjee, Kommareddy et al. - 2003
30 On multiple description streaming with content delivery netw.. - Apostolopoulos, Wong et al. - 2002
29 Optimal distributed algorithms for minimum weight spanning t.. (context) - Awerbuch - 1987
25 Topology aware routing in structured peer-to-peer overlay ne.. - Castro, Druschel et al. - 2002
21 Overlay optimizations for end-host multicast - Wang, Helder et al. - 2002
15 End-host multicast communication using switch-trees protocol.. - Helder, Jamin - 2002
12 Are virtualized overlay networks too much of a good thing - Keleher, Bhattacharjee et al. - 2002
11 A distributed algorithm for minimum-weight spanning trees (context) - Gallager, Humblet et al. - 1983
7 A study of the performance potential of dht-based overlays - Jain, Mahajan et al. - 2003
6 Path diversity with forward error correction (pdf) system fo.. - Nguyen, Zakhor - 2003
6 A highly asynchronous minimum spanning tree protocol - Singh, Bernstein - 1995
5 A note on finding minimum cost edge disjoint spanning trees (context) - Roskind, Tarjan - 1985
3 Network topology generators: Degree based vs. structural - Tangmunarunkit, Govindan et al. - 2002
2 What features really make distributed algorithms efficient (context) - Faloutsos, Molle - 1996
2 Largescale data collection: a coordinated approach - Cheng, Chou et al. - 2003
Documents on the same site (http://www.ieee-infocom.org/2004/technicalprogram.htm): More
Multiple Source, Multiple Destination Network Tomography - Rabbat, Nowak, Coates (2004) (Correct)
Large Wireless Networks under Fading, Mobility, and Delay.. - Toumpis, Goldsmith (2004) (Correct)
Random Walks in Peer-to-Peer Networks - Gkantsidis, Mihail, Saberi (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC