Skip to main content

A Heuristic Routing Algorithm for Degree-Constrained Minimum Overall Latency Application Layer Multicast

  • Conference paper
Parallel and Distributed Processing and Applications (ISPA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3758))

Abstract

Application Layer Multicast (ALM) shifts multicast functionality from routers to end hosts and has the potential to address most problems associated with IP multicast. It has attracted wide attention in research community in recent years. However, as an end host based solution, the applicability of ALM to realtime applications such as streaming services is constrained by node bandwidth and transmission latency. How to guarantee QoS is still a challengeable problem. In this paper, we think overall latency is a more effective metric for evaluating the QoS perceived by most users and explore the optimization problem of Degree-Constrained Minimum Overall Latency Spanning Tree (DCMOLST). We divide the optimization process into initialization phase and dynamic adjustment phase. In the former stage, we propose a heuristic algorithm through giving a more consideration to both transmission delay and node bandwidth, so as to avoid QoS degradation caused by single metrics. In the later, we present a set of distributed iterative optimizing operations for further optimization. Experimental results show that our proposal can improve overall performance efficiently and is able to cope with network dynamics.

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

Access this chapter

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.

References

  1. Chu, Y., Rao, S.G., Seshan, S., Zhang, H.: A Case for End System Multicast. In: The Proceedings of ACM SIGMETRICS (June 2000)

    Google Scholar 

  2. Chawathe, Y.: Scattercast: An Architecture for Internet Broadcast Distribution as an Infrastructure Service. Ph.D. Thesis, University of California, Berkeley (December 2000)

    Google Scholar 

  3. Fracis, P.: Yoid: Extending the Internet Multicast Architecture, White Paper (April 2000), http://www.aciri.org/yoid

  4. Castro, M., Druschel, P., Kermarrec, A.-M., Rowstron, A.: SCRIBE: A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in communications, JSAC (2002)

    Google Scholar 

  5. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MIT Press, Cambridge (1997)

    Google Scholar 

  6. Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. ACTA Informatica, 141–145 (1981)

    Google Scholar 

  7. Zhu, Q., Parsa, M., Garcia-Luna-Aceves, J.: A souorce-based algorithm for delay-constrained minimal-cost multicasting. In: Proceedings of IEEE INFOCOM 1995, pp. 377–384 (1995)

    Google Scholar 

  8. Kompella, V., Pasquale, J., Polyzo, G.: Multicast routing for multimedia communication. IEEE/ACM Transactions on Networking, 286–292 (1993)

    Google Scholar 

  9. Kompella, V., Pasquale, J., Polyzo, G.: Two distributed algorithms for multicasting multimedia information. In: Proceedings of ICCCN 1993, pp. 343–349 (1993)

    Google Scholar 

  10. Jia, X.: A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks. IEEE/ACM Transaction on Networking 6(6), 828–837 (1998)

    Article  Google Scholar 

  11. Chu, Y.H., Rao, S.G., Seshan, S., Zhang, H.: Enabling conferencing applications on the Internet using an overlay multicast architecture. In: Proceedings of ACM SIGCOMM 2001, San Diago, CA (August 2001)

    Google Scholar 

  12. Wang, Z., Crowcroft, J.: Bandwidth-delay based routing algorithms. In: IEEE GlobeCom (November 1995)

    Google Scholar 

  13. Shi, S.Y., Turner, J.S.: Routing in Overlay Multicast Networks. In: Proceedings of IEEE INFOCOM 2002 (June 2002)

    Google Scholar 

  14. Suman, B., Kommareddy, C., Kar, K., et al.: Construction of an efficient overlay multicast infrastructure for real-time applications. In: IEEE 2003, pp. 1521–1531 (2003)

    Google Scholar 

  15. Zhang, B., Jamin, S., Zhang, L.: Host multicast: A framework for delivering multicast to end users. In: Proc. of IEEE INFOCOM, New York, NY (June 2002)

    Google Scholar 

  16. Zegura, E.W., Calvert, K., Bhattacharjee, S.: How to model an internetwork. In: Proceedings of IEEE INFOCOM, San Francisco, CA (1996)

    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

Ye, B., Guo, M., Chen, D., Lu, S. (2005). A Heuristic Routing Algorithm for Degree-Constrained Minimum Overall Latency Application Layer Multicast. In: Pan, Y., Chen, D., Guo, M., Cao, J., Dongarra, J. (eds) Parallel and Distributed Processing and Applications. ISPA 2005. Lecture Notes in Computer Science, vol 3758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576235_36

Download citation

  • DOI: https://doi.org/10.1007/11576235_36

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-32100-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics