Skip to main content
SpringerLink
Log in

Low-cost ATM multicast routing with constrained delays

  • Session A: Multipeer and Group Communication
  • Conference paper
  • First Online:
Multimedia Telecommunications and Applications (COST237 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1185))

Included in the following conference series:

Abstract

An increasing number of networking applications involve multiple participants and are therefore best supported by multicasting. Where a multicast application consumes high bandwidth, it is important to minimise the effect on the network by offering economical multicast routes. Many new applications made possible by networks based on ATM involve real-time components and are therefore also delay-sensitive. This paper discusses reasonably simple techniques for multicast routing which tackle both of these constraints, that is: first, the route makes efficient use of network resources and, secondly, delays to all recipients are kept within a bound. The problem is NP-complete, so we present heuristics which build up a directed graph containing potential routing solutions and use a greedy approach to select a solution from that graph. The heuristics are discussed and evaluated and are shown to offer good results for a variety of situations including both large and small multicast groups. Our approach is also compared with a previous solution to this problem, which has a greater time complexity.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. Data structures and algorithms. Addison Wesley, 1987.

    Google Scholar 

  2. A.J. Ballardie, P.F. Francis, and J. Crowcroft. Core based trees. Computer Communications Review, 23(4):85–95, 1993.

    Article  Google Scholar 

  3. K. Bharath-Kumar and J.M. Jaffe. Routing to multiple destinations in computer networks. IEEE Trans. on Communications, COM-31(3):343–351, March 1983.

    Article  Google Scholar 

  4. J.S. Crawford. Multicast routing: evaluation of a new heuristic. Master's thesis, University of Kent at Canterbury, 1994.

    Google Scholar 

  5. Y.K. Dalal and R.M. Metcalfe. Reverse path forwarding of broadcast packets. Communictaions of the ACM, 21(12):1040–1048, December 1978.

    Article  Google Scholar 

  6. S. Deering. Host extensions for ip multicasting. rfc 1112, aug 1988.

    Google Scholar 

  7. S.E. Deering and D.R. Cheriton. Multicast routing in datagram internetworks and extended lans. ACM Transactions on Computer Systems, 8(2):85–110, May 1990.

    Article  Google Scholar 

  8. S.E. Deering, D. Estrin, D. Farinacci, V. Jacobson, C-G. Liu, and L. Wei. An architecture for wide area multicast routing. Computer Communications Review, 24(4):126–135, October 1994.

    Article  Google Scholar 

  9. J.M.S. Doar. Multicast in the Asynchronous Transfer Mode Environment. Technical Report No. 298, University of Cambridge Computing Laboratory, April 1993.

    Google Scholar 

  10. S.E. Dreyfus and R.A. Wagner. The steiner problem in graphs. Networks, 1(3):195–207, 1971.

    Google Scholar 

  11. R.W. Floyd. Algorithm 97: Shortest path. Communications of the ACM, 5(6):345, 1962.

    Article  Google Scholar 

  12. Alan Gibbons. Algorithmic Graph Theory. Cambridge University Press, 1989.

    Google Scholar 

  13. ITU-T Reccomendation I.121. B-ISDN service aspects.

    Google Scholar 

  14. X. Jiang. Routing broadband multicast streams. Computer Communications, 15(1):45–51, Jan/Feb 1992.

    Article  Google Scholar 

  15. J Kadirire. Minimising packet copies in multicast routing by exploiting geographic spread. Computer Communications Review, 24(3):47–62, July 1994.

    Article  Google Scholar 

  16. V.P. Kompella, J.C. Pasquale, and G.C. Polyzos. Multicast Routing for Multimedia Communications. IEEE/ACM Transactions on Networking, 1(3):286–292, 1993.

    Article  Google Scholar 

  17. Kuzminski. T. Alternatives for multicast routing in atm networks. Master's thesis, University of Kent at Canterbury, 1996.

    Google Scholar 

  18. S. Parkinson. Multicast Routing in the Internet Evaluating Proposed Routing Mechanisms. Master's thesis, University of Kent at Canterbury, 1995.

    Google Scholar 

  19. V.J. Rayward-Smith. The computation of nearly minimal steiner trees. Int. Journal of Maths, education Science and Technology, 14(1):15–23, 1983.

    Google Scholar 

  20. H.F. Salama, D.S. Reeves, I. Vinitos, and Tsang-Ling. Sheu. Comparison of Multicast Routing Alogrithms for High Speed Networks. Technical report, North Carolina State University, September 1994.

    Google Scholar 

  21. H.F. Salama, D.S. Reeves, I. Vinitos, and Tsang-Ling. Sheu. Evaluation of Multicast Routing Algorithms for Distributed Real-Time Applications of High-Speed Networks. In Proceedings of the 6th IFIP Conference on High-Performance Networks (HPN'95), 1995.

    Google Scholar 

  22. D. Wall. mechanisms for broadcast and selective broadcast. PhD thesis, Stanford University, 1980.

    Google Scholar 

  23. A.G. Waters. Multicast Provision for High Speed Networks. In A. Danthine and O. Spaniol, editors, 4th IFIP Conference on High Performance Networking, pages G1.1–G1.16. Springer Verlag, December 1992.

    Google Scholar 

  24. A.G. Waters. A new heuristic foir atm multicast routing. In 2nd IFIP Workshop on Performance Modelling and Evaluation of ATM Networks, pages 8/1–8/9, July 1994.

    Google Scholar 

  25. A.G. Waters. Multi-party communication over packet networks. PhD thesis, University of Essex, UK, 1996.

    Google Scholar 

  26. B.M. Waxman. Routing of Multipoint Connections. IEEE journal on selected areas in communications, 6(9):1617–1622, 1988.

    Article  Google Scholar 

  27. L. Wei and D. Estrin. Multicast Routing in Dense and Sparse Modes:Simulation Study of Tradeoffs and Dynamics (95–613). Technical report, Computer Science Department, University of Southern California, 1995.

    Google Scholar 

  28. R. Widyono. The Design and Evaluation of Routing Algorithms for Real-time Channels. Tr-94-024, University of California at Berkeley and International Computer Science Institute, September 1994.

    Google Scholar 

  29. Q. Zhu, M. Parsa, and J.J. Garcia-Luna-Aceves. A Source-Based Algorithm for Near-Optimum Delay-Constrained Multicasting. In Proceedings of INFOCOM, pages 377–385, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Laboratory, University of Kent at Canterbury, CT2 7NF, Canterbury, Kent, England

    A. Gill Waters & John S. Crawford

Authors
  1. A. Gill Waters
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John S. Crawford
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ventre Jordi Domingo-Pascual André Danthine

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Waters, A.G., Crawford, J.S. (1996). Low-cost ATM multicast routing with constrained delays. In: Ventre, G., Domingo-Pascual, J., Danthine, A. (eds) Multimedia Telecommunications and Applications. COST237 1996. Lecture Notes in Computer Science, vol 1185. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020848

Download citation

  • DOI: https://doi.org/10.1007/BFb0020848

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62096-9

  • Online ISBN: 978-3-540-49680-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation