Implementation and performance of a new multiple objective dynamic routing method for multiexchange networks
DOI:
https://doi.org/10.26636/jtit.2003.3.190Keywords:
dynamic routing, multiple objective routing, multiexchange telecommunication network performanceAbstract
The paper describes new developments of a multiple objective dynamic routing method (MODR) for circuit-switched networks previously presented, based on the periodic calculation of alternative paths for every node pair by a specialised bi-objective shortest path algorithm (MMRA). A model is presented that enables the numerical calculation of two global network performance parameters, when using MMRA. This model puts in evidence an instability problem in the synchronous path computation model which may lead to solutions with poor global network performance, measured in terms of network mean blocking probability and maximum node-to-node blocking probability. The essential requirements of a heuristic procedure enabling to overcome this problem and select "good" routing solutions in every path updating period, are also discussed.
Downloads
References
[1] C. H. Antunes, J. Craveirinha, J. Climaco, and C. Barrico, "A multiple objective routing algorithm for integrated communication networks", in ITC-16 Teletraffic Engineering in a Competitive World, P. Key and D. Smith, Eds., Elsevier Science B.V., 1999, vol. 3b, pp. 1291-1300.
View in Google Scholar
[2] G. R. Ash, Dynamic Routing in Telecommunications Networks. McGraw-Hill, 1998.
View in Google Scholar
[3] G. R. Ash, R. H. Cardwell, and R. P. Murray, "Design and optimization of networks with dynamic routing", Bell Syst. Tech. J., vol. 60, no. 8, pp. 1787-1820, 1981.
View in Google Scholar
[4] D. Bertsekas and R. Gallager, Data Networks. Prentice-Hall, 1992.
View in Google Scholar
[5] J. Craveirinha, L. Martins, T. Gomes, C. H. Antunes, and J. Clímaco, "A new multiple objective dynamic routing method using implied costs", J. Telecommun. Inform. Technol., no. 3, pp. 50-59, 2003.
View in Google Scholar
[6] A. Girard, Routing and Dimensioning in Circuit-Switched Networks. Addison-Wesley, 1990.
View in Google Scholar
[7] T. Gomes, L. Martins, and J. F. Craveirinha, "An efficient algorithm for calculating k shortest paths with a maximum number of arcs", Invest. Oper., vol. 21, pp. 235-244, 2001.
View in Google Scholar
[8] F. P. Kelly, "Blocking probabilities in large circuit-switched networks", Adv. Appl. Probab., vol. 18, pp. 473-505, 1986.
View in Google Scholar
[9] F. P. Kelly, "Routing in circuit-switched networks: optimization, shadow prices and decentralization", Adv. Appl. Probab., vol. 20, pp. 112-144, 1988.
View in Google Scholar
[10] E. Q. V. Martins, M. M. B. Pascoal, and J. L. E. Santos, "Deviation algorithms for ranking shortest paths", Int. J. Found. Comput. Sci., vol. 10, pp. 247-263, 1999.
View in Google Scholar
[11] C. Pornavalai, G. Chakraborty, and N. Shiratori, "Routing with multiple QoS requirements for supporting multimedia applications", Telecommun. Syst., vol. 9, pp. 357-373, 1998.
View in Google Scholar
[12] R. Vogel, R. G. Herrtwich, W. Kalfa, H. Wittig, and L. C. Wolf, "QoS - based routing of multimedia streams in computer networks", IEEE J. Selec. Areas Commun., vol. 14, no. 7, pp. 1235-1244, 1996.
View in Google Scholar
[13] Z. Wang and J. Crowcroft, "Quality-of-service routing for supporting multimedia applications", IEEE J. Selec. Areas Commun., vol. 14, no. 7, pp. 1228-1234, 1996.
View in Google Scholar
Downloads
Submitted
Published
Issue
Section
License
Copyright (c) 2003 Journal of Telecommunications and Information Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
