Implementation and performance of a new multiple objective dynamic routing method for multiexchange networks

• Autorzy: Martins L. , Craveirinha J. , Climaco J.N. , Gomez T.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

dynamic routing; multiple objective routing; multiexchange telecommunication network performance

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2003
• Tom: nr 3
• Strony: 60--66
• Opis fizyczny: Bibliogr. 13 poz., tab., rys.

Twórcy

autor

Martins L.

• Departamento de Engenharia Electrotecnica e Computadores, Universidade de Coimbra, Coimbra, Portugal

autor

Craveirinha J.

• Departamento de Engenharia Electrotecnica e Computadores, Universidade de Coimbra, Coimbra, Portugal

autor

Climaco J.N.

• Departamento de Engenharia Electrotecnica e Computadores, Universidade de Coimbra, Coimbra, Portugal

autor

Gomez T.

• Departamento de Engenharia Electrotecnica e Computadores, Universidade de Coimbra, Coimbra, Portugal

Bibliografia

• [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.
• [2] G. R. Ash, Dynamic Routing in Telecommunications Networks. McGraw-Hill, 1998.
• [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.
• [4] D. Bertsekas and R. Gallager, Data Networks. Prentice-Hall, 1992.
• [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.
• [6] A. Girard, Routing and Dimensioning in Circuit-Switched Networks. Addison-Wesley, 1990.
• [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.
• [8] F. P. Kelly, “Blocking probabilities in large circuit-switched net- works”, Adv. Appl. Probab., vol. 18, pp. 473–505, 1986.
• [9] F. P. Kelly, “Routing in circuit-switched networks: optimization, shadow prices and decentralization”, Adv. Appl. Probab., vol. 20, pp. 112–144, 1988.
• [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.
• [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.
• [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.
• [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