Skip to main content
SpringerLink
Log in

Modified Least Load Multicast Routings for Single Rate Fully-Connected Loss Networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

In this paper, we investigate the dynamic multicast routing problem and briefly discuss the common dynamic multicast routing algorithm called Least Load Multicast Routing (LLMR). We propose two new multicast routing algorithms called Least Load Multicast Routing with Maximum Occupied Circuits (LLMRMOC) and Least Load Multicast Routing with Minimum Measured Blocking Time (LLMRMMBT), both of which are based on LLMR. Simulation results show that these algorithms, compared with LLMR, not only produce a smaller network revenue loss, but also result in smaller call blocking probabilities for all classes of traffic. The moderate gain in the network performance comes only a slight additional cost. The implementation issues of the proposed algorithms are also discussed.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C.C. Cheung, H.W. Chu, D.H.K. Tsang and S. Gupta, Least loaded first multicast routing in single rate loss networks, in: Proc. of the IEEE Internat. Conf. of Communications, 1996, pp. 513-517.

  2. C.C. Cheung, D.H.K. Tsang and S. Gupta, State dependent multicast routing for single rate loss networks, in: Proc. of the Internat. Conf. on Telecommunications, 1997, pp. 1425-1430.

  3. S. Gupta, K.W. Ross and M. El Zarki, On routing in ATM networks, in: Routing in Communications Networks (Prentice-Hall and Manning, 1995).

  4. S. Hakimi, Steiner's problems in graphs and its implications, Networks 1 (1971) 113-133.

    Google Scholar 

  5. R.H. Hwang, Adaptive multicast routing in single rate loss networks, in: Proc. of the IEEE INFOCOM, 1995, pp. 571-578.

  6. R. Karp, Reducibility among combinatorial problems, in: Complexity of Computer Computations, 1972, pp. 85-103.

  7. V.P. Kompella, J.C. Pasquale and G.C. Polyzos, Multicast routing for multimedia communications, IEEE/ACM Transactions on Networking 1 (June 1993) 286-292.

  8. D. Mitra, R.J. Gibbens and B.D. Huang, State-dependent routing on symmetric loss networks with trunk reservations-I, IEEE Transactions on Communications 41(2) (Feburary 1993) 400-411.

    Google Scholar 

  9. R. Tode, Y. Sakai, M. Yamamoto, H. Okada and Y. Tezuka, Multicasting routing algorithm for nodal load balancing, in: Proc. of the IEEE INFOCOM, 1992, pp. 2086-2095.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon Tong, Hong Kong

    Chi-Chung Cheung

  2. Department of Electrical and Electronic Engineering, HKUST, Clear Water Bay, Kowloon, Hong Kong

    Danny H.K. Tsang

  3. EDGE System Division, Motorola, Arlington Heights, Illinois, 60004, USA

    Sanjay Gupta

Authors
  1. Chi-Chung Cheung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Danny H.K. Tsang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sanjay Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cheung, CC., Tsang, D.H. & Gupta, S. Modified Least Load Multicast Routings for Single Rate Fully-Connected Loss Networks. Telecommunication Systems 16, 455–466 (2001). https://doi.org/10.1023/A:1016679330709

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016679330709

Search

Navigation