Skip to main content

Least Cost Multicast Loop Algorithm for Local Computer Network

  • Conference paper
  • 778 Accesses

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

Abstract

Minimal cost loop problem consists of finding a set of loops to minimize the total link cost of end-user nodes while satisfying the traffic constraints. This paper presents a heuristic algorithm using trade-off criterion based on the node exchange and node transfer among loops by the initial algorithms. Simulation results show that the proposed algorithm produces about ten percent better solution than previous algorithms in short execution time. Our algorithm can be applied to find multicast loops in local computer network.

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

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

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

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

    Article  Google Scholar 

  7. Magnanti, T., Ahuja, R., Orlin, J.: Network Flows- Theory, Algorithms, and Applica-tions. Prentice-Hall, Englewood Cliffs (1993)

    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

Lee, YJ. (2005). Least Cost Multicast Loop Algorithm for Local Computer Network. 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_14

Download citation

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

  • 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