skip to main content
10.1145/378344.378347acmconferencesArticle/Chapter ViewAbstractPublication PagesmmsysConference Proceedingsconference-collections
Article

Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination

Published:01 January 2001Publication History

ABSTRACT

The demand for streaming multimedia applications is growing at an incr edible rate. In this paper, we propose Bayeux, an efficient application-level multicast system that scales to arbitrarily large receiver groups while tolerating failures in routers and network links. Bayeux also includes specific mechanisms for load-balancing across replicate root nodes and more efficient bandwidth consumption. Our simulation results indicate that Bayeux maintains these properties while keeping transmission overhead low. To achieve these properties, Bayeux leverages the architecture of Tapestry, a fault-tolerant, wide-area overlay routing and location network.

References

  1. 1.Ballardie, A. Core based trees (CBT) multicast routing architecture. Internet Request for Comments RFC 2201, September 1997. http://www.landfield.com/rfcs/rfc2201.html.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.Bhattacharjee, S., Ammar, M., Zegura, E., Shah, N., and Fei, Z. Application layer anycasting. In Proceedings of IEEE INFOCOM (June 1997).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Chawathe, Y., McCanne, S., and Brewer, E. A. An architecture for internet content distribution as an infrastructure service. http://www.cs.berkeley.edu/~yatin, 1999.]]Google ScholarGoogle Scholar
  4. 4.Chu, Y. H., Rao, S. G., and Zhang, H. A case for end system multicast. In Proceedings of SIGMETRICS (June 2000).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.Druschel, P., and Rowstron, A. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. Submission to ACM SIGCOMM, 2001.]]Google ScholarGoogle Scholar
  6. 6.Estrin, D., Farinacci, D., Helmy, A., Thaler, D., Deering, S., Handley, M., Jacobson, V., Liu, C., Sharma, P., and Wei, L. Protocol independent multicast - sparse mode (pim-sm): Protocol specification. Internet Request for Comments RFC 2117, June 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.Estrin, D., Farinacci, D., Jacobson, V., Liu, C., Wei, L., Sharma, P., and Helmy, A. Protocol independent multicast - dense mode (pim-dm): Protocol specification.]]Google ScholarGoogle Scholar
  8. 8.Fei, Z., Bhattacharjee, S., Ammar, M. H., and Zegura, E. W. A novel server technique for improving the response time of a replicated service. In Proceedings of IEEE INFOCOM (June 1998).]]Google ScholarGoogle ScholarCross RefCross Ref
  9. 9.Francis, P. Yallcast: Extending the internet multicast architecture, September 1999. http://www.yallcast.com.]]Google ScholarGoogle Scholar
  10. 10.Francis, P., Jamin, S., Paxon, V., Zhang, L., Gryniewicz, D. F., and Jin, Y. An architecture for a global host distance estimation service. In Proceedings of IEEE INFOCOM (June 1998).]]Google ScholarGoogle Scholar
  11. 11.Georgia tech internet topology model. http://www. cc.gatech.edu/fac/Ellen.Zegura/graphs.html.]]Google ScholarGoogle Scholar
  12. 12.Holbrook, H. W., and Cheriton, D. R. Ip multicast channels: EXPRESS support for large-scale single-source applications. In Proceedings of SIGMETRICS (August 1999).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.Jannotti, J., Gifford, D. K., Johnson, K. L., Kaashoek, M. F., and James W. O'TOOLE, J. Overcast: Reliable multicasting with an overlay network. In Proceedings of OSDI (October 2000).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.Kim, D., Meyer, D., Kiler, H., and Farinacci, D. Anycast RP mechanism using PIM and MSDP, 2000. Internet-Draft, http://www.join.uni-muenster.de/ drafts/draft-ietf-mboned-anycast-rp-05.txt.]]Google ScholarGoogle Scholar
  15. 15.Kubiatowicz, J., et al. OceanStore: An architecture for global-scale persistent storage. In Proceedings of ASPLOS (November 2000).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16.Myers, A., Dinda, P., and Zhang, H. Performance characteristics of mirror servers on the internet. In Proceedings of IEEE INFOCOM (June 1999).]]Google ScholarGoogle ScholarCross RefCross Ref
  17. 17.National laboratory for applied network research. http://moat.nlanr.net/Routing/rawdata/.]]Google ScholarGoogle Scholar
  18. 18.Pendarakis, D., Shi, S., Verma, D., and Waldvogel, M. ALMI: An application level multicast infrastructure. In Proceedings of USITS (March 2001).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19.Perkins, C. S., Hudson, O., and Hardman, V. Network adaptive continuous-media applications through self-organised transcoding. In Proceedings of Network and Operating Systems Support for Digital Audio and Video (Cambridge, UK., July 1998), ACM.]]Google ScholarGoogle Scholar
  20. 20.Plaxton, C. G., Rajaraman, R., and Richa, A. W. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures(SPAA) (June 1997).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21.Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Schenker, S. A scalable content-addressable network. In Proceedings of SIGCOMM (August 2001), ACM.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22.Rekhter, Y., and Li, T. An architecture for IP address allocation with CIDR. RFC 1518, http://www.isi.edu/in-notes/rfc1518.txt, 1993.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 23.Robshaw, M. J. B. MD2, MD4, MD5, SHA and other hash functions. Tech. Rep. TR-101, RSA Labs, 1995. version 4.0.]]Google ScholarGoogle Scholar
  24. 24.The SCAN project. http://www.isi.edu/scan/.]]Google ScholarGoogle Scholar
  25. 25.Seshan, S., Stemm, M., and Katz, R. SPAND: Shared passive network performance discovery. In Proceedings of USITS (March 1997).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. 26.The stanford graph base (SGB) package. ftp://labrea.stanford.edu/pub/sgb/.]]Google ScholarGoogle Scholar
  27. 27.Source-specific multicast (SSM) working group at IETF. http://sith.maoz.com/SSM.]]Google ScholarGoogle Scholar
  28. 28.Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., and Balakrishnan, H. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of SIGCOMM (August 2001), ACM.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. 29.Stoica, I., Ng, T. S. E., and Zhang, H. REUNITE: A recursive unicast approach to multicast. In Proceedings of INFOCOM (March 2000).]]Google ScholarGoogle ScholarCross RefCross Ref
  30. 30.Tiers. http: //www.isi.edu/haldar/topogen/tiers1.0.tar.gz.]]Google ScholarGoogle Scholar
  31. 31.Yano, K., and McCanne, S. The breadcrumb forwarding service: A synthesis of PGM and EXPRESS to improve and simplify global IP multicast. ACM Comp. Comm. Review 30, 2 (2000).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. 32.Zhao, B. Y., Kubiatowicz, J. D., and Joseph, A. D. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, University of California at Berkeley, Computer Science Division, April 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            NOSSDAV '01: Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
            January 2001
            187 pages
            ISBN:1581133707
            DOI:10.1145/378344

            Copyright © 2001 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 January 2001

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate118of363submissions,33%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader