Failure-tolerant overlay trees for large-scale dynamic networks

Proceedings - P2P'08, 8th International Conference on Peer-to-Peer Computing

Volumn , Issue , 2008, Pages 351-361

  Frey, Davide ^a   Murphy, Amy L ^b  

^a INRIA   (France)

^b ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; DATA STRUCTURES; TOPOLOGY;

DATA DISSEMINATIONS; DISTRIBUTED APPLICATIONS; DYNAMIC NETWORKS; DYNAMIC SETTINGS; EXTENSIVE SIMULATIONS; FUNDAMENTAL STRUCTURES; MESH TOPOLOGIES; NETWORK SCENARIOS; NODE DEGREES; NUMBER OF NODES; OVERLAY TREES; TREE TOPOLOGIES;

TREES (MATHEMATICS);

EID: 55149085998     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/P2P.2008.30     Document Type: Conference Paper

References (27)

1. th Int. Wkshp. on Distributed Algorithms, pages 15-28. Springer-Verlag New York, Inc., 1991.
2. R. Baldoni, R. Beraldi, L. Querzoni, and A. Virgillito. A self-organizing crash-resilient topology management system for content-based publish/subscribe. In DEBS, Edinburgh, Scotland, UK, May 2004.
3. S. Banerjee, B. Bhattacharjee, and C. Kommareddy. Scalable application layer multicast. In SIGCOMM, 2002.
4. M. Bawa, H. Deshpande, and H. Garcia-Molina. Transience of peers and streaming media. In HotNets-I, Princeton, NJ, pages 107-112, Oct. 2002.
5. A. Carzaniga, D.S. Rosenblum, and A.L. Wolf. Design and evaluation of a wide-area event notification service. ACM TOCS, 19(3):332-383, August 2001.
6. M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh. SplitStream: High-bandwidth multicast in a cooperative environment. In SOSP, October 2003.
7. M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron. Scribe: A large-scale and decentralized application-level multicast infrastructure. IEEE J-SAC, 20(8), October 2002.
8. th Int. COST264 Wkshp., September 2003.
9. N.-S. Chen, H.-P Yu, and S.-T. Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39(3):147-151, 1991.
10. Y.-H. Chu, S.G. Rao, and H. Zhang. A case for end system multicast. In Measurement and Modeling of Computer Systems, pages 1-12, 2000.
11. P. Costa and D. Frey. Publish-Subscribe Tree Maintenance over a DHT. In DEBS, Columbus, Oh, USA, June 2005.
12. G. Cugola, D. Frey, A. L. Murphy, and G. P. Picco. Minimizing the reconfiguration overhead in content-based publish-subscribe. In SAC, 2004.
13. P. Francis. Yoid Tree Management Protocol (YTMP) Specification. ACIRI, April 2000. http://www.icir.org/yoid/docs/ytmp.pdf.
14. J. J. Garcia-Luna-Ac eves and S.Murthy. A path-finding algorithm for loop-free routing. IEEE/ACM TON, 5(1), 1997.
15. J. Jannotti, D.K. Gifford, K.L. Johnson, M.F. Kaashoek, and J.W. O'Toole, Jr. Overcast: Reliable multicasting with an overlay network. In OSDI, pages 197-212, Oct. 2000.
16. M. Jelasity, S. Voulgaris, R. Guerraoui, A.-M. Kermarrec, and M. van Steen. Gossip-based peer sampling. ACM TOCS, Aug. 2007.
17. A. Klingaman, M. Huang, S. Muir, and L. Peterson. PlanetLab Core Specification 4.0. Technical Report PDN-06-032, PlanetLab Consortium, June 2006.
18. K. Lakshminarayanan, A. Rao, I. Stoica, and S. Shenker. End-host controlled multicast routing. Elsevier Computer Networks, Special Issue on Overlay Distribution Structures and their Applications, 2005.
19. V.N. Padmanabhan, H.J. Wang, P.A. Chou, and K. Sripanidkulchai. Distributing streaming media content using cooperative networking. In Wkshp. on Network and operating systems support for digital audio and video, pages 177-186, New York, NY, USA, 2002.
20. th Symp. on Data communications, pages 44-53. ACM Press, 1985.
21. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Middleware, pages 329-350, November 2001.
22. E.M. Royer and C.E. Perkins. Multicast Operation of the Ad-hoc On-Demand Distance Vector Routing Protocol. In MobiCom, pages 207-218, Seattle, WA, USA, August 1999.
23. S. Saroiu, P. Gummadi, and S. Gribble. A measurement study of peer-to-peer file sharing systems. In Multimedia Computing and Networking, 2002.
24. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In ACM Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communication, 2001.
25. A. Varga. OMNeT++ Discrete Event Simulator, www.omnetpp.org.
26. B.Y Zhao, L. Huang, S.C. Rhea, J. Stribling, A.D. Joseph, and J.D. Kubiatowicz. Tapestry: A global-scale overlay for rapid service deployment. IEEE J-SAC, 22(1), January 2004.
27. S.Q. Zhuang, B.Y. Zhao, A.D. Joseph, R.H. Katz, and J.D. Kubiatowicz. Bayeux: An architecture for scalable and faulttolerant wide-area data dissemination. In Wkshp. on Network and operating systems support for digital audio and video, pages 11-20, New York, NY, USA, 2001. ACM Press.