Skip to main content
SpringerLink
Log in

Adaptive multicast routing in multirate loss networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

In this paper, we study two versions of the multicast routing problem in multirate loss networks: complete and partial. In the complete version of the multicast routing problem, the identities of all destination nodes are available to the multicast routing algorithm at once. Conversely, in the partial version of the multicast problem, the identities of the destination nodes are revealed to the routing algorithm one by one. Although the complete version of the multicast routing problem, also known as the Steiner tree problem, has been well studied in the literature, less attention has been paid for the definition of link costs and evaluating the performance of multicast routing algorithm from the network revenue point of view. Therefore, in this paper, we first propose two approaches, namely, the Markov Decision Process‐based (MDP‐based) and Least Loaded Routing‐based (LLR‐based) approaches, for defining link costs. Several heuristic multicast routing algorithms are then proposed for both fully connected networks and sparsely connected networks. We have also proposed a new performance metric, referred to as fractional reward loss, for evaluating the performance of multicast routing algorithms. Our simulation results indicate that algorithms based on partial destination information yield worse performance than those based on complete information. We also found that, for fully connected networks, algorithms that use LLR‐based link costs yield very competitive performance as compared to those that use MDP approach. However, for sparsely connected networks, LLR‐based algorithms yield significantly worse performance as compared to the MDP‐based algorithms.

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. G.R. Ash, BM. Blake and S.D. Schwartz, Integrated network routing and design, in: Twelfth Internat.Teletraffic Congress, Torino (June 1988) pp. 640–647.

  2. G.R. Ash, RH. Cardwell and R. Murray, Design and optimization of networks with dynamic routing, Bell System Technical Journal 60 (1981) 1787–1820.

    Google Scholar 

  3. W.H. Cameron, J Regnier, P Galloy and A.M. Savoie, Dynamic routing for intercity telephone networks, in: Tenth Internat.Teletraffic Congress (June 1983).

  4. H.-W. Chu and D.H.K. Tsang, Dynamic routing algorithms in VP-based ATMnetworks, in: GLOBECOM' 95 (December 1995) pp. 1364–1368.

  5. S.-P. Chung and K.W. Ross, Reduced load approximations for multirate loss networks, IEEE Transactions on Communications 41(August 1993) 1222–1231.

    Google Scholar 

  6. L. Davies, ed., Genetic Algorithms and Simulated Annealing (Morgan Kaufmann, Los Altos, CA, 1987).

  7. W.-Y. Do and R.-H. Hwang, Multicast routing based on genetic algorithms, in: Proc.of Internat. Conf.on Networking and Multimedia (December 1996) pp. 211–218.

  8. Draft recommendation I.371: Traffic control and congestion control in B-ISDN, ITU-T SG. XVIII, Geneva (June 1992).

  9. Z. Dziong et al., On adaptive call routing strategy for circuit switched networks – maximum reward approach, in: Twelfth Internat.Teletraffic Congress, Torino (June 1988) pp. 998–1005.

  10. Z. Dziong and L. Mason, Control of multi-service loss networks, in: Proc.of the 28th Conf.on Decision and Control, Tampa, FL (December 1989) pp. 1099–1104.

  11. Z. Dziong and L. Mason, An analysis of near optimal call admission and routing model for multiservice loss networks, in: INFOCOM' 92, Florence, Italy (May 1992) pp. 141–152.

  12. Z. Dziong and L.G. Mason, Call admission and routing in multi-service loss networks, IEEE Transactions on Communications 42(1994) 2011–2022.

    Article  Google Scholar 

  13. A.I. Elwalid and D. Mitra, Effective bandwidth of general Markovian traffic sources and admission control of high speed networks, IEEE/ACM Transactions on Networking 1(June 1993) 329–343.

    Google Scholar 

  14. R.J. Gibbens and P.J. Hunt, Effective bandwidths for the multi-type UAS channel, Queueing Systems 9(1991) 17–28.

    Article  Google Scholar 

  15. A. Girard and G. Rosenberg, A unified framework for network design with generalized connections, in: ITC' 15 (June 1997) pp. 319–328.

  16. R. Gu´erin, H Ahmadi and M. Naghshineh, Equivalent capacity and its application to bandwidth allocation in high-speed networks, IEEE Journal on Selected Areas in Communications 9(September 1991) 968–98

    Google Scholar 

  17. S. Gupta, K Ross and M.E. Zarki, Routing in virtual path-based ATM networks, in: GLOBECOM' 92 (December 1992) pp. 571–575.

  18. S. Hakimi, Steiner's problem in graphs and its implications, Networks 1(1971) 113–133.

    Article  Google Scholar 

  19. R.-H. Hwang, Routing in high-speed networks, Technical Report 93–43, Department of Computer Science, University of Massachusetts at Amherst (1993).

    Google Scholar 

  20. R.-H. Hwang, Adaptive multicast routing in single rate loss networks, in: INFOCOM' 95 (April 1995) pp. 571–57

  21. R.-H. Hwang, Multicast routing in single rate loss networks, NSC Report No. NSC–84–2213-E–194–026, National Science Council, Taiwan, RO.C. (July 1995).

    Google Scholar 

  22. R.-H. Hwang, JF. Kurose and D. Towsley, State-dependent routing for multirate loss networks, in: GLOBECOM' 92 (December 1992) pp. 565–570.

  23. R.-H. Hwang, JF. Kurose and D. Towsley, MDP routing in ATM networks using the virtual path concept, in: INFOCOM' 94 (June 1994) pp. 1509–1518.

  24. R. Karp, Reducibility among combinatorial problems, in: Complexity of Computer Computations (Plenum, New York, 1972) pp. 85–103.

    Chapter  Google Scholar 

  25. F.P. Kelly, Routing in circuit switched networks: Optimization, shadow prices and decentralization, Advances in Applied Probability 20(1988) 112–144.

    Article  Google Scholar 

  26. F.P. Kelly, Effective bandwidths at multi-type queues, Queueing Systems 9(1991) 5–15.

    Article  Google Scholar 

  27. G. Kesidis, J Walrand and C.-S. Chang, Effective bandwidths for multiclass Markov fluids and other ATM sources, IEEE/ACM Transactions on Networking (August 1993) 424–428.

  28. P.B. Key, Optimal control and trunk reservation in loss networks, Probability in the Engineering and Informational Sciences 4(1990) 203–242.

    Article  Google Scholar 

  29. V.P. Kompella, JC. Pasquale and G.C. Polyzos, Muticast routing for multimedia communication, IEEE/ACM Transactions on Networking 1(June 1993) 286–292.

    Google Scholar 

  30. K.R. Krishnan, Adaptive state-dependent traffic routing using on-line trunk-group measurements, in: Thirteenth Internat.Teletraffic Congress, Denmark (June 1991) pp. 407–411.

  31. K.R. Krishnan and T.J. Ott, State-dependent routing of telephone traffic: Theory and results, in: Proc.of 25th CDC, Athens, Greece (December 1986) pp. 2124–2128.

  32. P.M. Lin, BJ. Leon and C.R. Stewart, Analysis of circuit-switched networks employing originatingoffice control with spill-forward, IEEE Transactions on Communications 26(June 1978) 754–765.

    Google Scholar 

  33. A. Maunder and P.S.Min, Routing for multi-rate traffic with multiple qualities of service, in: ICCCN' 94 (June 1994) pp. 104–108.

  34. K. Mehlhorn, Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness (Springer, New York, 1984).

    Book  Google Scholar 

  35. D. Mitra, RJ. Gibbens and B.D. Huang, Analysis and optimal design of aggregated least-busyalternative routing on symmetric loss networks with trunk reservations, in: Thirteenth Internat. Teletraffic Congress (1991) pp. 477–481.

  36. V. Nguyen, On the optimality of trunk reservation in overflow processes, Probability in the Engineering and Informational Sciences 5(1991) 369–390.

    Article  Google Scholar 

  37. T.J. Ott and K.R. Krishnan, State-dependent routing of telephone traffic and the use of separable routing schemes, in: Eleventh Internat.Teletraffic Congress, Kyoto, Japan (September 1985) pp. 867–872.

  38. R.C. Prim, Shortest connection networks and some generalizations, Bell System Technical Journal 36(1957) 1389–1401.

    Article  Google Scholar 

  39. V.J. Rayward-Smith and A. Clare, On finding Steiner vertices, Networks 16(1986) 283–294.

    Google Scholar 

  40. M.I. Reiman, Optimal trunk reservation for a critically loaded link, in: Thirteenth Internat.Teletraffic Congress (June 1991) pp. 247–252.

  41. H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Math. Japonica 6(1980) 573–577.

    Google Scholar 

  42. H. Tode, Y Sakai, M Yamamoto, H Okada and Y. Tezuka, Multicasting routing algorithm for nodal load balancing, in: INFOCOM' 92, Florence, Italy (May 1992) pp. 2086–2095.

  43. B.M. Waxman, Routing of multipoint connections, IEEE Journal on Selected Areas in Communications 6(December 1988) 1617–1622.

    Google Scholar 

  44. B.M. Waxman, Performance evaluation of multipoint routing algorithms, in: INFOCOM' 93, San Francisco, CA (April 1993) pp. 980–986.

  45. R.I. Wilkinson, Theories of toll traffic engineering in the USA, Bell System Technical Journal 40 (1956) 421–514.

    Article  Google Scholar 

  46. S.-C. Yang, Adaptive multicast routing in ATM networks, Master's thesis, Department of Computer Science and Information Engineering, National Chung Cheng University (June 1997).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Chung Cheng University, Chia‐Yi, Taiwan

    Ren‐Hung Hwang

Authors
  1. Ren‐Hung Hwang
    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

Hwang, R. Adaptive multicast routing in multirate loss networks. Telecommunication Systems 12, 283–313 (1999). https://doi.org/10.1023/A:1019154914513

Download citation

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation