Multicriteria routing models in telecommunication networks - Overview and a case study

Advances in Multiple Criteria Decision Making and Human Systems Management: Knowledge and Wisdom

Volumn , Issue , 2007, Pages 17-46

  Clímaco, João C N ^a   Craveirinha, José M F ^b   Pascoal, Marta M B ^b  

^a UNIVERSITY OF COIMBRA   (Portugal)

^b UNIVERSITY OF COIMBRA   (Portugal)

Author keywords

Multicriteria analysis; Routing; Telecommunication networks

Indexed keywords

EID: 84880187541     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (106)

1. Aboelela, E. and Douligeris, C. (1999). Fuzzy generalized network approach for solving an optimization model for routing in B-ISDN. Telecommunication Systems, 12:237-263.
2. Agrawal, G., Huang, D., and D. Medhi (2005). Network protection design for MPLS networks. In Proceedings of the 5th International Workshop on Design of Reliable Communication Networks, Naples, Italy.
3. Akkanen, J. and Nurminen, J. K. (2001). Case study of the evolution of routing algorithms in a network plannig tool. The Journal of Systems and Software, 58(3):181-198.
4. Al-Sharhan, S. (2005). A fast evolutionary algorithm for multicast routing in wireless networks. In Proceedings of the Internet and Multimedia Systems, and Applications (IMSA 2005), pages 77-106, Hawaii, USA.
5. Anandalingam, G. and Nam, K. (1997). Conflict and cooperation in designing international telecommunication networks. Journal of the Operational Research Society, 48:600-611.
6. Aneja, Y. and Nair, K. (1978). The constrained shortest path problem. Naval Research Logistics Quarterly, 25:549-555.
7. Antunes, C. H., Clímaco, J., Craveirinha, J., and Barrico, C. (1999). Multiple objective routing in integrated communication networks. In Smith, D. and Key, P., editors, Teletraffic Engineering in a Competitive World. Proceedings of the 16th International Teletraffic Congress -ITC 16, pages 1291-1300. Elsevier.
8. Ash, G. R. (1998). Dynamic Routing in Telecommunication Networks. McGraw-Hill.
9. Assi, C., Shami, A., Ali, M. A., Kurtz, R., and Guo, D. (2001). Optical networking and real-time provisioning: an integrated vision for the next-generation internet. IEEE Network, 15(4):36-45.
10. Avallone, S., Kuipers, F., Ventre, G., and Mieghem, P. V. (2005). Dynamic routing in QoS-aware traffic engineered networks. In Proceedings of EUNICE 2005: Networks and Applications Towards a Ubiquitously Connected World, IFIP WG 6.6, WG 6.4 and WG 6.9 Workshop, pages 222-228,.
11. Colmenarejo, Spain. Universidad Carlos III de Madrid. The paper has also been published by Springer (ISBN-10: 0-387-30815-6), edited by C. Delgado Kloos, A. Marin, and D. Larrabeiti, pp. 45-58, 2006.
12. Banerjee, A., Drake, J., Lang, J., Turner, B., Kompella, K., and Rekhter, Y. (2001). Generalized multiprotocol label switching: an overview of routing and management enhancements. IEEE Communications Magazine, 39(1):144-149.
13. Beugnies, F. and Gandibleux, X. (2003). Multiobjective routing in IP networks. In 7th PM2O Workshop (Programmation Mathématique Multi-Objectifs), Valenciennes, France.
14. Beugnies, F. and Gandibleux, X. (2006). A multi-objective routing procedure for IP networks. In The 18th International Conference on Multiple Criteria Decision Making, Chania, Grèce.
15. Blokh, D. and Gutin, G. (1996). An approximate algorithm for combinatorial optimization problems with two parameters. Australasian Journal of Combinatorics, 14:157-164.
16. Chen, S. and Nahrstedt, K. (1998a). On finding multi-constrained paths. In Proceedings of International Communications Conference '98 IEEE, pages 874-879, New York.
17. Chen, S. and Nahrstedt, K. (1998b). An overview of quality of service routing for next-generation high-speed networks: problems and solutions. IEEE Network, 12(6).
18. Clímaco, J. and Craveirinha, J. (2005). Multiple criteria decision analysis -state of the art surveys. In Figueira, J., Greco, S., and Erghott, M., editors, Int. Series in Operations Research and Management Science, volume 78, chapterMulticriteria Analysis in Telecommunication Network Planning and Design -Problems and Issues, pages 899-951. Springer.
19. Clímaco, J., Craveirinha, J., and Pascoal,M. (2003). A bicriterion approach for routing problems in multimedia networks. Networks, 41(4):206-220.
20. Clímaco, J., Craveirinha, J., and Pascoal, M. (2006). An automated reference pointlike approach for multicriteria shortest path problems. Journal of Systems Science and Systems Engineering, 15(3):314-329.
21. Clímaco, J. and Martins, E. (1982). A bicriterion shortest path algorithm. European Journal of Operational Research, 11:399-404.
22. Clímaco, J., Craveirinha, J., and Pascoal, M. (2004). Routing calculation in multimedia: A procedure based on a bicriteria model. In Neittaanmi, P., Rossi, T., Majava, K., and Pironneau, O., editors, Proceedings of the European Congress on Computational Methods in Applied Sciences and Engineering ECCOMAS'04, Jyväskylä, Finland.
23. Conte, M. (2003). Dynamic Routing in Broadband Networks, volume 3. Springer.
24. Craveirinha, J., Girão-Silva, R., and Clímaco, J. (2005). A meta-model for multiobjective routing in MPLS. In Proceedings of the 5th International Conference on Decision Support for Telecommunications and Information Society, pages 11-34, Varsaw, Poland.
25. Craveirinha, J., Martins, L., Gomes, T., Antunes, C. H., and Clímaco, J. (2003). A new multiple objective dynamic routing method using implied cost. Journal of Telecommunications and Information Technologies, 3:51-59. special issue, Ed. by the Institute of Telecommunications, Warsaw, 2003.
26. Crichigno, J. and Barán, B. (2004). Multiobjective multicast routing algorithm for traffic engineering. In IEEE International Conference on Computers and Communication Networks (ICCCN'2004), Chicago, Estados Unidos.
27. Cui, X., Lin, C., and Wei, Y. (2003). A multiobjective model for QoS multicast routing based on genetic algorithm. In Proceedings of International Conference on Computer Networks and Mobile Computing (ICCNM'03), page 49.
28. Donoso, Y., Fabregat, R., and Marzo, J.-L. (2004). A multi-objective optimization scheme for multicast routing: A multitree approach. Telecommunication Systems, 27(2-4):229-251.
29. Douligeris, C. (1991). Multiobjective telecommunication networks flow control. In Proceedings of IEEE Southeastcon '91, volume 2, pages 647-651, Williamsburg, VA, USA.
30. El-Sayed, M. and Jaffe, J. (2002). A view of telecommunications network evolution. IEEE Communications Magazine, 40(12):74-81.
31. Erbas, S. C. and Erbas, C. (2003). A multiobjective off-line routing model for MPLS networks. In Charzinski, J., Lehnert, R., and Tran-Gia, P., editors, Proceedings of the 18th International Teletraffic Congress. Elsevier.
32. Erbas, S. C. andMathar, R. (2002). An off-line traffic engineering model for MPLS networks. In Proceedings of IEEE 27th Annual Conference on Local Computer Networks, pages 166-174, Tampa, Florida.
33. Ergun, F., Sinha, R., and Zhang, L. (2000). QoS routing with performance-dependent cost. In Proceedings of INFOCOM2000, volume 1, pages 137-146.
34. Fabregat, R., Donoso, Y., Baran, B., Solano, F., and Marzo, J. (2005). Multi-objective optimization scheme for multicast flows: a survey, a model and a MOEA solution. In LANC '05: Proceedings of the 3rd international IFIP/ACM Latin American conference on Networking, pages 73-86, New York, NY, USA. ACM Press.
35. Fortz, B. and Thorup, M. (2000). Internet traffic engineering by optimizing OSPF weights. In Proceedings of INFOCOM2000, volume 2, pages 519-528.
36. Fournie, L., Hong, D., and Randriamasy, S. (2006). Distributed multi-path and multiobjective routing for network operation and dimensioning. In Proceedings of the 2nd Conference on Next Generation Internet Design and Engineering, 2006 (NGI'06).
37. Goel, A., Ramakrishnan, K. G., Kataria, D., and Logothetis, D. (2001). Efficient computation of delay-sensitive routes from one source to all destinations. In Proceedings of INFOCOM2001 Conference, volume 2, pages 854-858. IEEE.
38. Granat, J. and Guerriero, F. (2003). The interactive analysis of the multicriteria shortest path problem by the reference point method. European Journal of Operational Research, 151(1):103-118.
39. Granat, J. and Wierzbicki, A. P. (2004). Multicriteria analysis in telecommunications. In Proceedings of the 37th Annual Hawaii International Conference on System Sciences, Hawaii, USA.
40. Guerin, R. and Orda, A. (2000). Networks with advanced reservations: The routing perspective. In Proceedings of INFOCOM2000, pages 26-30.
41. Guo, L. and Matta, I. (1999). Search space reduction in QoS routing. In Proceedings of the 19th IEEE International Conference on Distributed Computing Systems, volume 3, pages 142-149.
42. Handler, G. Y. and Zang, I. (1980). A dual algorithm for the constrained shortest path problem. Networks, 10:293-310.
43. Hardy, D., Malleus, G., and Mereur, J. (2003). Networks: Internet, Telephony, Multimedia. Springer.
44. Hassin, R. (1992). Approximation schemes for the restriced shortest path problem. Mathematics of Operations Research, 17(1):36-42.
45. Haßlinger, G. and Schnitter, S. (2003). Optimized Traffic Load Distribution in MPLS Networks, chapter 7, pages 125-141. Kluwer Academic Publishers.
46. Jaffe, J. M. (2004). Algorithms for finding paths multiple constraints. Networks, 14:95-116.
47. Kennington, J., Lewis, K., Olinick, E., Ortynski, A., and Spiride, G. (2003). Robust solutions for the DWDM routing and provisioning problem: Models and algorithms. Optical Networks Magazine, 4(2):74-84. Technical Report 01-EMIS-03.
48. Kerbache, L. and Smith, J. (2000). Multi-objective routing within large scale facilities using open finite queueing network. European Journal of Operational Research, 121:105-123.
49. Kim, S., Lim, K., and Kim, C. (1998). A scalable QoS-based inter-domain routing scheme in a high speed wide area network. Computer Communications, 21:390-399.
50. Knowles, J., Oates, M., and Corne, D. (2000). Advanced multi-objecive evolutionary algorithms applied to two problems in telecommunications. British Telecom Technology Journal, 18(4): 51-65.
51. Korkmaz, T. and Krunz, M. (2001). A randomized algorithm for finding a path subject to multiple QoS requirements. Computer Networks, 36:251-268.
52. Kuipers, F., Korkmaz, T., Krunz, M., and Mieghem, P. V. (2002a). A review of constraint-based routing algorithms. http://www.tvs.et.tveldft.nl/people/fernado/- papers/TRreviewqosalg.pdf.
53. Kuipers, F., Korkmaz, T., Krunz, M., and Mieghem, P. V. (2004). Performance evaluation of constraint-based path selection algorithms. IEEE Network, 18(5):16-23.
54. Kuipers, F. and Mieghem, P. V. (2002). MAMCRA: A constrained-base multicast routing algorithm. Computer Communications, 25(8):801-810.
55. Kuipers, F. and Mieghem, P. V. (2005a). Conditions that impact the complexity of QoS routing. IEEE/ACM Transaction on Networking, 13(4):717-730.
56. Kuipers, F. and Mieghem, P. V. (2005b). Non-dominance in QoS routing: an implementational perspective. IEEE Communications Letters, 9(3):267-269.
57. Kuipers, F., Mieghem, P. V., Korkmaz, T., and Krunz, M. (2002b). An overview of constraint-based path selection algorithms for routing. IEEE Communications Magazine, 40(12):50-55.
58. Kuipers, F., Orda, A., Raz, D., and Mieghem, P. V. (2006). A comparison of exact and e-approximation algorithms for constrained routing. In Proceedings of Networking 2006 -Fifth IFIP Networking Conference, Coimbra, Portugal.
59. Kyeongja, L., Armand, T., Aurelien, N., Ahmed, R., and Cheeha, K. (2005). Comparison of multipath algorithms for load balancing in a MPLS network. In Proceedings of International conference on information networking, ICOIN 2005, Jeju Island, South Korea.
60. Lee,W. C., Hluchyj,M. G., and Humblet, P. A. (1995). Routing subject to quality of service constraints in integrated communication networks. IEEE Network, 9(4):46-55.
61. Li, Q., Beaver, J., Amer, A., Chrysanthis, P., Labrinidis, A., and Santhankrishnan, G. (2005). Multi-criteria routing in wireless sensor-based pervasive environments. Jounal of Pervasive Computing and Communications, 1(4).
62. Liu, G. and Ramakrishnan, K. (2001). A&z.ast; prune: An algorithm for finding K shortest paths subject to multiple constraints. In Proceedings of INFOCOM 2001 IEEE Conference, pages 743-749, Anchorage.
63. Liu, H., Li, J., Zhang, Y.-Q., and Pan, Y. (2005). An adaptive genetic fuzzy multi-path routing protocol for wireless ad hoc networks. In Proceedings of the Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks (SNPD/SAWN'05), pages 468-475, Washington, DC, USA. IEEE Computer Society.
64. Lukac, K. (2002). Multicriteria dynamic routing in communication networks based on F learning automata. In Proceedings of Communications and Computer Networks.
65. Lukac, K. (2003). Multicriteria telecommunication traffic routing based on stochastic automata in fuzzy environments. PhD thesis, Faculty of Electrical Engineering and Computing, University of Zagreb, Croatia.
66. Lukac, K., Lukac, Z., and Tkalic, M. (2003). Behaviour of F learning automata as multicriteria routing agents in connection oriented networks. In Proceedings of FUZZ-IEEE2003, The IEEE International Conference on Fuzzy Systems, pages 296-301, St. Louis, MO.
67. Ma, Q. and Steenkiste, P. (1997). On path selection for traffic with bandwidth guarantees. In Proceedings of IEEE International Conference on Network Protocols (ICNP '97), pages 191-202, Atlanta, Georgia.
68. Ma, Q. and Steenkiste, P. (1998). Routing traffic with quality-of-service guarantees in integrated services networks. In Proceedings of NOSSDAV'98.
69. Malakooti, B. and Thomas, I. (2006). A distributed composite multiple criteria routing using distance vector. In Proceedings of IEEE International Conference on Networking, Sensing and Control, ICNSC'06, pages 42-47, Ft. Lauderdale, FL, USA.
70. Martins, E., Pascoal,M., and Santos, J. (1999). Deviation algorithms for ranking shortest paths. International Journal of Foundations of Computer Science, 10(3):247-263.
71. Martins, L., Craveirinha, J., and Clímaco, J. (2003). A new multiobjective dynamic routing method for multiservice networks -modelling and performance. In Proceedings of the International Networks Optimization Conference (INOC 2003), pages 404-409, Evry/Paris, France. Institut National des Télécommunications.
72. Martins, L., Craveirinha, J., and Clímaco, J. (2006). A new multiobjective dynamic routing method for multiservice networks: modelling and performance. Computational Management Science, 3:225-244.
73. Martins, L., Craveirinha, J., Clímaco, J., and Gomes, T. (2005). On a bi-dimensional dynamic alternative routing method. European Journal of Operational Research, 166:828-842. Special issue on Advances in Complex Systems Modeling, Ed. byM.Makowski, Y. Nakamori and H.-J. Sebastian.
74. Marwaha, S., Srinivasan, D., Tham, C. K., and Vasilakos, A. (2004). Evolutionary fuzzy multi-objective routing for wireless mobile ad hoc networks. In Proceedings of Congress on Evolutionary Computation (CEC'2004), volume 2, pages 1964-1971, Portland, Oregon, USA. IEEE Service Center.
75. Masip-Bruin, X., Yannuzzi, M., Domingo-Pascual, J., Fonte, A., Curado, M., Monteiro, E., Kuipers, F., Mieghem, P. V., Avallone, S., Ventre, G., Aranda-Gutiérrez, P., Hollick, M., Steinmetz, R., and L. Iannone, K. S. (2006). Research challenges in qos routing. Computer Communications, NoE E-Next special issue, 29(5). http://www.nas.its.tudelft.nl/ people/Fernando/papers/CompCom_QoSRouting.pdf.
76. Meisel, Y. (2005). Multi-Objective Optimization Scheme for Static and Dynamic Multicast Flows. PhD thesis, Girona, Spain.
77. Meisel, Y., Fabregat, R., and Fàbrega, L. (2003). Multi-objective scheme over multitree routing in multicast MPLS networks. In Proceedings of the IFIP/ACM Latin America Networking Conference 2003 (LANC03), volume 6, La Paz, Bolivia. ACM Press.
78. Mieghem, P. V., Neve, H. D., and Kuipers, F. (2001). Hop-by-hop quality of service routing. Computer Networks, 37(3-4):407-423.
79. Mitra, D. and Ramakrishnan, K. (2001). Techniques for traffic engineering of multiservice, multipriority networks. Bell Labs Technical Journal, 6(1):139-151.
80. Neve, H. D. and Mieghem, P. V. (2000). Tamcra, a tunable accuracy multiple constraints routing algorithm. Computer Communications, 33:667-679.
81. Orda, A. (1999). Routing with end-to-end QoS guarantees in broadband networks. IEEE/ACM Transactions of Networking, 7(3):365-374.
82. Osman, M. and M. Abo-Sinna, A. M. (2005). An effective genetic algorithm approach to multiobjective routing problems (morps). Applied mathematics and computation, 163(2):769-781.
83. Oueslti-Boulahia, S. and Oubagha, E. (1999). An approach to routing elastic flows. In Proceedings of the 16th International Telegraffc Congress, pages 1311-1320,Washington, USA. Elsevier Science B. V.
84. Pinto, D. and Barán, B. (2005). Solving multiobjective multicast routing problem with a new ant colony optimization approach. In LANC '05: Proceedings of the 3rd international IFIP/ACM Latin American conference on Networking, pages 11-19, New York, NY, USA. ACM Press.
85. Pioro, M., Dzida, M., Kubilinskas, E., Nilsson, P., Ogryczak, W., Tomaszewski, A., and Zagozdzon, M. (2005). Applications of the max-min fairness principle in telecommunication network design. In Proceedings of the 1st Conference on Next Generation Internet Networks Engineering (NGI 2005), pages 219-225, Rome, Italy.
86. Pornavalai, C., Chakraborty, G., and Shiratori, N. (1997). QoS based routing algorithm in integrated services packet networks. In Proceedings of IEEE International Conference on Network Protocols (ICNP'97), pages 167-174, Atlanta, Georgia.
87. Pornavalai, C., Chakraborty, G., and Shiratori, N. (1998). Routing with multiple QoS requirements for supporting multimedia applications. Telecommunication Systems, 9:357-373.
88. Prasithsangaree, P. and Niehaus, D. (2002). Multiple QoS routing in large pnni atm networks with heavy traffic. In Proceedings of the 2002 International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS'02), pages 438-442, San Diego, California.
89. Prieto, J., Barán, B., and Crichigno, J. (2006). Multitree-multiobjective multicast routing for traffic engineering. In Proceedings of the 1st. International Conference on Artificial Intelligence in Theory and Practice, IFIP World Computer Congress 2006, Santiago, Chile.
90. Puri, A. and Tripakis, S. (2002). Algorithms for routing with multiple constraints. In Proceedings of SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, volume 2, pages 338-347, Turku, Finland.
91. Rajagopalen, B., Pendarakis, D., Saha, D., Ramamoorthy, R., and Bala, K. (2004). IP over optical netwoks: architectural aspects. IEEE Communications Magazine, 38(9):94-102.
92. Resende, M. and Ribeiro, C. (2003). A grasp with path-relinking for private virtual circuit routing. Networks, 41(3):104-114.
93. Rocha, M., Sousa, P., Rio, M., and Cortez, P. (2006). QoS constrained internet routing with evolutionary algorithms. In Proceedings of 2006 IEEE Congress on Evolutionary Computation, pages 9270-9277, Vancouver, Canada.
94. Roy, A., Banerjee, N., and Das, S. K. (2002). An efficient multi-objective QoS routing algorithm for real-time wireless multicasting. In Jackson, P., editor, Proceedings of IEEE Semiannual Vehicular Technology Conference, volume 3, pages 1160-1164, Birmingham, Alabama.
95. Roy, A. and Das, S. (2002). Optimizing QoS-based multicast routing in wireless networks: A multi-objective genetic algorithmic approach. In Proceedings of the Second IFIP-TC6 Networking Conference (Networking 2002), volume 2345 of Lecture Notes in Computer Science, pages 28-48, Pisa, Italy.
96. Roy, A. and Das, S. (2004). Qbmmrp: A QoS-based mobile multicast routing protocol using multiobjective genetic algorithms. Wireless Networks, 10(3):271-286.
97. Schnitter, S. and Haßlinger, G. (2002). Heuristic solutions to the lsp-design for MPLS traffic engineering. In Proceedings of Telecommunication Network Strategy and Olanning Symposium, Munich, Germany.
98. Shin, D. (2003). Multicriteria Routing for Guaranteed Performance Communications. PhD thesis, Purdue University. CERIAS Tech Report 2003-21.
99. Sobrinho, J. (2001). Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet. In Proceedings of IEEE INPCOM2001, Anchorage.
100. Song, J., Pung, H., and Jacob, L. (2000). A multi-constrained distributed QoS routingalgorithm. In Proceedings of the Eighth IEEE International Conference on Networks (ICON'00), pages 165-171.
101. Steuer, R. (1986). Multiple Criteria Optimization: Theory Computation and Application. John Wiley & Sons.
102. Thirumalasetty, S. and Medhi, D. (2001). MPLS traffic engineering for survivable book-ahead guaranteed services. http://www.estp.umkc.edu/public/papers/ dmedhi/tm-bag-te.pdf.
103. Tsai, W. and Dai, W. (2001). Joint routing and rate assignment in MPLS based networks. In Proceedings of the Ninth IEEE International Conference on Networks (ICON'01), page 196.
104. Wang, Z. and Crowcroft, J. (1996). Quality-of-service routing for supporting multimedia applications. IEEE Journal on Select Areas in Communications, 14(7):1228-1234.
105. Widyono, R. (1994). The design and evaluation of routing algorithms for real-time channels. Technical Report 94-024, University of California at Berkeley & International Computer Science Institute.
106. Wierzbicki, A. (2005). Telecommunications, multiple criteria analysis and knowledge theory. Journal of Telecommunications and Information Technology, 3. http://www.itl.waw.pl/ czasopisma/JTIT/2005/3/3.pdf.