Skip to main content

On Estimation for Reducing Multicast Delay Variation

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3726))

Abstract

The core-based multicast routing protocol plays a significant role in many multimedia applications such as video-conferencing, replicated database updating and querying, and etc. However, existing core-based multicast routing protocols construct only the shortest paths between the core and the members in a multicast group without optimizing the quality of service requirements. In this paper, we propose an efficient algorithm for multicast delay variations and tree cost. The efficiency of our algorithm is verified through the performance evaluation and the enhancements are up to about 2.5% ~ 4.5% and 3.8% ~ 15.5% in terms of the multicast delay variation and the tree cost, respectively. The time complexity of our algorithm is O(m(l + n log n)).

This work was supported in parts by Brain Korea 21 and the Ministry of Information and Communication in Republic of Korea. Dr. H. Choo is the corresponding author and Dr. Bang is the co-corresponding author.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ajuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)

    Google Scholar 

  2. Ballardie, A., Cain, B., Zhang, Z.: Core Based Trees (CBT Version 3) Multicast Routing, Internet draft (1998)

    Google Scholar 

  3. Kim, M., Bang, Y.-C., Choo, H.: The Weighted Factor Algorithm with Efficiently Combining Two Independent Measures in Routing Paths, May 2005. LNCS, vol. 3483, pp. 989–998. Springer, Heidelberg (2005)

    Google Scholar 

  4. Rodionov, A.S., Choo, H.: On generating random network structures: Connected graphs. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, pp. 483–491. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Wang, M., Xie, J.: Core placement algorithm for CBT multicast routing under multiple QoS requirements. IEE Electronics Letters 38(13), 670–672 (2002)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, M., Bang, YC., Choo, H. (2005). On Estimation for Reducing Multicast Delay Variation. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds) High Performance Computing and Communications. HPCC 2005. Lecture Notes in Computer Science, vol 3726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557654_17

Download citation

  • DOI: https://doi.org/10.1007/11557654_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29031-5

  • Online ISBN: 978-3-540-32079-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics