Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Optimal Multicast Loop Algorithm for Multimedia Traffic Distribution

  • Conference paper
Embedded and Ubiquitous Computing – EUC 2005 (EUC 2005)

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

Included in the following conference series:

Abstract

We have presented an optimal algorithm for minimal cost loop problem (MCLP), which consists of finding a set of minimum cost loops rooted at a source node. In the MCLP, the objective function is to minimize the total link cost. The proposed algorithm is composed of two phases: in the first phase, it generates feasible paths to satisfy the traffic capacity constraint, and finds the exact solution through matching in the second phase. In addition, we have derived several properties of the proposed algorithm. Performance evaluation shows that the proposed algorithm has good efficiency for small network with light traffic. Our proposed algorithm can be applied to find multicast loops for real-time multimedia traffic distribution.

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

Access this chapter

Log in via an institution

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
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

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. Breibart, Y., Garofalakis, M., Martin, C., Seshadri, S., Silberschatz, A.: Topology Discovery in Heterogeneous IP Networks. In: INFOCOM, pp. 265–274 (2000)

    Google Scholar 

  2. Lin, H., Lai, H., Lai, S.: Automatic Link Layer Topology Discovery of IP Networks. In: IEEE ICC 1999, pp. 1034–1038 (1999)

    Google Scholar 

  3. Lee, Y., Atiquzzaman, M.: Least Cost Multicast Spanning Tree Algorithm for Local Computer Network. In: IEEE ICCNMC 2005, pp. 268–275 (2005)

    Google Scholar 

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

    Article  Google Scholar 

  5. Gavish, B.: Topological Design of Telecommunication Networks-Local Access Design Methods. Annals of Operations Research 33, 17–71 (1991)

    Article  MATH  Google Scholar 

  6. Lee, Y.: Minimal Cost Heuristic Algorithm for Delay Constrained Loop Network. International Journal of Computer Systems Science &Engineering 19(4), 209–219 (2004)

    Google Scholar 

  7. Lenster, J., Kan, R.: Complexity of Vehicle Routing and Scheduling Problems. Networks 11, 221–227 (1981)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Technology Education, Korea National University of Education, San 7 Darakri, Chungbuk, 363-791, Korea

    Yong-Jin Lee

  2. School of Computer Science, University of Oklahoma, 200 Felgar Street, Norman, OK, 73019, USA

    M. Atiquzzaman

Authors
  1. Yong-Jin Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Atiquzzaman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, St. Francis Xavier University, Antigonish, Canada

    Laurence T. Yang

  2. Faculty of Information Science and Electrical Engineering, Kyushu University, 744 Motooka, Nishi-ku, 819-0395, Fukuoka, Japan

    Makoto Amamiya

  3. IBM T.J. Watson Research Center, Hawthorne, NY, USA

    Zhen Liu

  4. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200030, Shanghai, China

    Minyi Guo

  5. Heinz Nixdorf Institute, University of Paderborn, Fuerstenallee 11, 33102, Paderborn, Germany

    Franz J. Rammig

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, YJ., Atiquzzaman, M. (2005). Optimal Multicast Loop Algorithm for Multimedia Traffic Distribution. In: Yang, L.T., Amamiya, M., Liu, Z., Guo, M., Rammig, F.J. (eds) Embedded and Ubiquitous Computing – EUC 2005. EUC 2005. Lecture Notes in Computer Science, vol 3824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596356_109

Download citation

  • DOI: https://doi.org/10.1007/11596356_109

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30807-2

  • Online ISBN: 978-3-540-32295-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation