Skip to main content

An Evaluation of Shared Multicast Trees with Multiple Active Cores

  • Conference paper
  • First Online:
Networking — ICN 2001 (ICN 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2093))

Included in the following conference series:

  • 525 Accesses

Abstract

Core-based multicast trees use less router state, but have significant drawbacks when compared to shortest-path trees, namely higher delay and poor fault tolerance. We evaluate the feasibility of using multiple independent cores within a shared multicast tree. We consider several basic designs and discuss how using multiple cores improves fault tolerance without sacrificing router state. We examine the performance of multiple-core trees with respect to single-core trees and find that adding cores significantly lowers delay without increasing cost. Moreover, it takes only a small number of cores, placed with a k-center approximation, for a multiple-core tree to have lower delay than a single-core tree with optimal core placement. We also find that traffic concentration is avoided as long as the load is spread among a set of cores. These results indicate that shared trees with multiple active cores are a viable alternative to shortest-path trees.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. S. Kumar, P. Radoslavov, D. Thaler, C. Alaettinoglu, D. Estring, and M. Handley, “The MASC/BGMP Architecture for Inter-domain Multicast Routing” in ACM SIGCOMM, August 1998.

    Google Scholar 

  2. Liming Wei and Deborah Estrin, “The Trade-offs of Multicast Trees and Algorithms” in 1994 International Conference on Computer Communications Networks, September 1994.

    Google Scholar 

  3. Stephen Deering, Deborah Estrin, Dino Farinacci, Van Jacobson, Ching-Gung Liu, and Liming Wei, “An Architecture for Wide-Area Multicast Routing” in ACM SIGCOMM, August 1994.

    Google Scholar 

  4. Deborah Estrin, Mark Handley, Ahmed Helmy, Polly Huang, and David Thaler, “A Dynamic Bootstrap Mechanism for Rendezvous-based Multicast Routing” submitted to ACM/IEEE Transactions on Networking.

    Google Scholar 

  5. K.L. Calvert, E.W. Zegura, and M.J. Donahoo, “Core Selection Methods for Multicast Routing” in International Conference on Computer Communications Networks, September 1995.

    Google Scholar 

  6. A. J. Ballardie, P.F. Francis, and J. Crowcroft, “Core Based Trees” in ACM SIGCOMM, August 1993.

    Google Scholar 

  7. C. Shields and J.J. Garcia-Luna-Aceves, “The Ordered Core Based Tree Protocol” in IEEE INFOCOM, 1997.

    Google Scholar 

  8. Bernard M. Waxman, “Routing of Multipoint Connections” IEEE Journal on SelectedA reas in Communications, vol. 6, no. 9, December 1988.

    Google Scholar 

  9. Ken Calvert and Ellen Zegura, “Georgia Tech Internetwork Topology Models” http://www.cc.gatech.edu/fac/Ellen.Zegura/graphs.html.

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zappala, D., Fabbri, A. (2001). An Evaluation of Shared Multicast Trees with Multiple Active Cores. In: Lorenz, P. (eds) Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2093. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47728-4_61

Download citation

  • DOI: https://doi.org/10.1007/3-540-47728-4_61

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42302-7

  • Online ISBN: 978-3-540-47728-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics