Skip to main content
SpringerLink
Log in

Multimedia Traffic Distribution Using Capacitated Multicast Tree

  • Conference paper
Distributed Computing and Internet Technology (ICDCIT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4317))

Abstract

This study deals with the capacitated multicast tree (CMT) problem, which consists of finding a set of minimum cost multicasting trees rooted at a source node satisfying the traffic requirements at end-nodes. This paper proposes a dynamic programming based algorithm with two phases. In the first phase, the algorithm generates feasible solutions to satisfy the traffic capacity constraint. It finds the optimal multicast trees using matching procedure in the second phase. The proposed algorithm for the CMT problem can be used for efficient multimedia traffic distribution in local area network. Performance evaluation shows that the proposed algorithm has good efficiency for small network with light traffic.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lee, Y., Atiquzzaman, M.: Least Cost Multicast Multicasting Tree Algorithm for Local Computer Network. In: Lu, X., Zhao, W. (eds.) ICCNMC 2005. LNCS, vol. 3619, pp. 268–275. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Lee, Y., Atiquzzaman, M.: Least Cost Heuristic for the Delay-Constrained Capacitated Minimum Multicasting Tree Problem. Computer Communications 28(11), 1371–1379 (2005)

    Article  Google Scholar 

  3. Chandy, K., Lo, T.: The Capacitated Minimum Multicasting Tree Networks. Networks 3, 173–181 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  4. Gavish, B.: Augmented Based Algorithm for Centralized Network Design. IEEE Trans. on. Comm 33(12), 1247–1257 (1985)

    Article  MathSciNet  Google Scholar 

  5. Gavish, B.: Topological Design of Centralized Computer Networks Formulations and Algorithms. Networks 12, 55–357 (1982)

    Article  MathSciNet  Google Scholar 

  6. Kershenbaum, A., Boorstyn, R.: Centralized Teleprocessing Network Design. Networks 13, 279–293 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  7. Papadimitriou, C.: The Complexity of the Capacitated Tree Problem. Networks 8, 217–230 (1978)

    Article  MathSciNet  Google Scholar 

  8. Lee, Y., Atiquzzaman, M.: Optimal Multicast Loop Algorithm for Multimedia Traffic Distribution. In: Yang, L.T., Amamiya, M., Liu, Z., Guo, M., Rammig, F.J. (eds.) EUC 2005. LNCS, vol. 3824, pp. 1099–1106. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Cheng, G., Ansari, N.: On Multiple Additively Constrained Path Selection. IEE Proc. Communications 149(5), 237–241 (2002)

    Article  Google Scholar 

  10. Cheng, G., Ansari, N.: Finding All Hop(s) Shortest Path. IEEE Communications Letters 8(2), 122–124 (2004)

    Article  Google Scholar 

  11. Cheng, G., Ansari, N.: Achieving 100% Success Ratio in Finding the Delay Constrained Least Cost Path. In: Proc. of IEEE GLOBECOM 2004, pp. 1505–1509 (2004)

    Google Scholar 

  12. Juttner, A., Szyiatowszki, M.I., Rajko, Z.: Lagrange relaxation based method for the QoS ruoting problem. In: Proc. IEEE INFOCOM 2001, pp. 859–869 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Technology Education, Korea National University of Education, San 7, Darak-Ri, Chungwon-Gun, Chungbuk, 363-791, Korea

    Yong-Jin Lee

Authors
  1. Yong-Jin Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Missouri-Rolla, USA

    Sanjay K. Madria

  2. MIT Lincoln Laboratories,  

    Kajal T. Claypool

  3. Dept of CS, Louisiana State University, 70803, Baton Rouge, LA

    Rajgopal Kannan

  4. Department of Computer Science, Radford University, 24060, Radford, VA, USA

    Prem Uppuluri

  5. Department of Computer Science and Engineering, Motilal Nehru National Institute of Technology, Allahabad, India

    Manoj Madhava Gore

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, YJ. (2006). Multimedia Traffic Distribution Using Capacitated Multicast Tree. In: Madria, S.K., Claypool, K.T., Kannan, R., Uppuluri, P., Gore, M.M. (eds) Distributed Computing and Internet Technology. ICDCIT 2006. Lecture Notes in Computer Science, vol 4317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11951957_20

Download citation

  • DOI: https://doi.org/10.1007/11951957_20

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-68380-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation