Hierarchical multiobjective routing in multiprotocol label switching networks with two service classes: A heuristic solution

International Transactions in Operational Research

Volumn 16, Issue 3, 2009, Pages 275-305

  Girão Silva, Rita ^a,b   Craveirinha, José ^a,b   Clímaco, João ^b,c  

^a UNIVERSITY OF COIMBRA   (Portugal)

^b INESC COIMBRA   (Portugal)

^c UNIVERSITY OF COIMBRA   (Portugal)

Author keywords

Communication networks; Internet; Multiobjective optimization; Routing models

Indexed keywords

EID: 84860005695     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2009.00669.x     Document Type: Article

References (41)

1. Antunes, C.H., Craveirinha, J., Clímaco, J., Barrico, C., 1999. A multiple objective routing approach for integrated communication networks. In Smith, D., Key, P. (eds) Proceedings of the 16th International Teletraffic Congress (ITC16) – Teletraffic Engineering in a Competitive World. Elsevier, Amsterdam, pp. 1291–1300.
2. Ash, G.R., 1998. Dynamic Routing in Telecommunications Networks, (1st edn), McGraw-Hill, New York.
3. Banks, J., Carson, J.S., 1984. Discrete-Event System Simulation. International Series in Industrial and Systems Engineering, Prentice-Hall, Englewood Cliffs, NJ.
4. Clímaco, J., Craveirinha, J., 2005. Multicriteria analysis in telecommunication network planning and design – Problems and issues. In Figueira, J., Greco, S., Ehrgott, M. (eds) Multiple Criteria Decision Analysis – State of the Art Surveys. Vol. 78 of International Series in Operations Research & Management Science. Springer, Berlin, pp. 899–951.
5. Clímaco, J.C.N., Martins, E.Q.V., 1982. A bicriterion shortest path algorithm. European Journal of Operational Research 11, 4, 399–404.
6. Clímaco, J.C.N., Craveirinha, J.M.F., Pascoal, M.M.B., 2003. A bicriterion approach for routing problems in multimedia networks. Networks 41, 4, 206–220.
7. Conte, M., 2003. Dynamic Routing in Broadband Networks. Broadband Networks and Services. Kluwer Academic Publishers, Dordrecht.
8. Craveirinha, J., Girão-Silva, R., Clímaco, J., 2008. A meta-model for multiobjective routing in MPLS networks. Central European Journal of Operations Research 16, 1, 79–105.
9. Craveirinha, J., Girão-Silva, R., Clímaco, J., Martins, L., 2007. A hierarchical multiobjective routing model for MPLS networks with two service classes – Analysis and resolution approach. Research Report 5/2007 (ISSN 1645-2631), INESC-Coimbra (http://www.inescc.pt). (A shorter version was presented at an invited session in the 23rd IFIP TC 7 Conference on System Modelling and Optimization, Cracow, Poland, July 23–27, 2007).
10. Craveirinha, J., Gomes, T., Esteves, S., Martins, L., 1998. A method for calculating marginal variances in teletraffic networks with multiple overflows. In Janssen, J., Osaki, S. (eds) Proceedings of the First Euro-Japanese Workshop on Stochastic Risk Modelling for Finance, Insurance, Production and Reliability, Bruxelles, Belgique, Vol. II.
11. Craveirinha, J., Martins, L., Clímaco, J.N., 2004. Dealing with complexity in a multiobjective dynamic routing model for multiservice networks – A heuristic approach. Proceedings of the 15th Mini-EURO Conference on Managing Uncertainty in Decision Support Models (MUDSM 2004). Coimbra, Portugal.
12. Craveirinha, J., Martins, L., Gomes, T., Antunes, C.H., Clímaco, J.N., 2003. A new multiple objective dynamic routing method using implied costs. Journal of Telecommunications and Information Technology 3, 50–59.
13. Elsayed, H.M., Mahmoud, M.S., Bilal, A.Y., Bernussou, J., 1988. Adaptive alternate-routing in telephone networks: Optimal and equilibrium solutions. Information and Decision Technologies 14, 65–74.
14. Erbas, S.C., 2003. Utilizing evolutionary algorithms for multiobjective problems in traffic engineering. In Ben-Ameur, W., Petrowski, A. (eds) Proceedings of the International Networks Optimization Conference (INOC 2003). Institut National des Télécommunications, Evry/Paris, France, pp. 207–212.
15. Erbas, S.C., Erbas, C., 2003. A multiobjective off-line routing model for MPLS networks. In Charzinski, J., Lehnert, R., Tran-Gia, P. (eds) Proceedings of the 18th International Teletraffic Congress (ITC-18), Berlin, Germany. Elsevier, Amsterdam, pp. 471–480.
16. Erbas, S.C., Mathar, R., 2002. An off-line traffic engineering model for MPLS networks. In Bakshi, B., Stiller, B. (eds) Proceedings of the 27th Annual IEEE Conference on Local Computer Networks (27th LCN). IEEE Computer Society, Tampa, FL, pp. 166–174.
17. Faragó, A., Blaabjerg, S., Ast, L., Gordos, G., Henk, T., 1995. A new degree of freedom in ATM network dimensioning: Optimizing the logical configuration. IEEE Journal on Selected Areas in Communications 13, 7, 1199–1206.
18. Gomes, T., Martins, L., Craveirinha, J., 2001. An algorithm for calculating k shortest paths with a maximum number of arcs. Investigação Operacional 21, 235–244.
19. Haßlinger, G., Schnitter, S., 2002 Algorithms for traffic engineering. Proceedings of 6th INFORMS Telecommunications Conference, Boca Raton, FL.
20. Haßlinger, G., Schnitter, S., 2003. Optimized traffic load distribution in MPLS networks. In Anandalingam, G., Raghavan, S. (eds) Telecommunications Network Design and Management. Kluwer Academic Publishers, Dordrecht, pp. 125–141.
21. Jorge, L., 2001. Um estudo simulacional de redes inter-centrais com encaminhamento dinâmico (incluindo redes com integração de serviços). Master's thesis, Faculdade de Ciências e Tecnologia da Universidade de Coimbra, Coimbra, Portugal (In Portuguese).
22. Jorge, L., Craveirinha, J., Gomes, T., 2004. Network performance of multi-service circuit switched networks – simulational comparison of variants of DAR and RTNR. In DeGroot, D., Harrison, P. (eds) Proceedings of the IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2004). Voledam, the Netherlands, pp. 513–521.
23. Kaufman, J.S., 1981. Blocking in a shared resource environment. IEEE Transactions on Communications COM-29, 10, 1474–1481.
24. Kelly, F., 1996. Notes on effective bandwidths. In Kelly, F.P., Zachary, S., Ziedins, I. (eds) Stochastic Networks: Theory and Applications. Vol. 4 of Royal Statistical Society Lecture Notes Series. Oxford University Press, Oxford, pp. 141–168.
25. Kelly, F.P., 1988. Routing in circuit-switched networks: Optimization, shadow prices and decentralization. Advances in Applied Probability 20, 1, 112–144.
26. Kelly, F.P., 1990. Routing and capacity allocation in networks with trunk reservation. Mathematics of Operations Research 15, 4, 771–793.
27. Knowles, J., Oates, M., Corne, D., 2000. Advanced multi-objective evolutionary algorithms applied to two problems in telecommunications. BT Technology Journal 18, 4, 51–65.
28. Martins, E.Q.V., Pascoal, M.M.B., Santos, J.L.E., 1999. Deviation algorithms for ranking shortest paths. International Journal of Foundations of Computer Science 10, 3, 247–263.
29. Martins, L., Craveirinha, J., Clímaco, J., 2005b. A new multiobjective dynamic routing method for multiservice networks – Modelling, resolution and performance. Research Report 2/2005, INESC-Coimbra (http://www.inescc.pt).
30. Martins, L., Craveirinha, J., Clímaco, J., 2006. A new multiobjective dynamic routing method for multiservice networks: Modelling and performance. Computational Management Science 3, 3, 225–244.
31. Martins, L., Craveirinha, J., Clímaco, J., Gomes, T., 2002. Modeling and performance analysis of a new multiple objective dynamic routing method for multiexchange networks. Research Report ET-N8-5; 11/2002, INESC-Coimbra (http://www.inescc.pt).
32. Martins, L., Craveirinha, J., Clímaco, J., Gomes, T., 2005a. On a bi-dimensional dynamic alternative routing method. European Journal of Operational Research 166, 3, 828–842.
33. Martins, L., Craveirinha, J., Clímaco, J.N., Gomes, T., 2003. Implementation and performance of a new multiple objective dynamic routing method for multiexchange networks. Journal of Telecommunications and Information Technology 3, 60–66.
34. Mitra, D., Morrison, J.A., 1994. Erlang capacity and uniform approximations for shared unbuffered resources. IEEE/ACM Transactions on Networking 2, 6, 558–570.
35. Mitra, D., Ramakrishnan, K.G., 2001. Techniques for traffic engineering of multiservice, multipriority networks. Bell Labs Technical Journal 6, 1, 139–151.
36. Mitra, D., Morrison, J.A., Ramakrishnan, K.G., 1999. Optimization and design of network routing using refined asymptotic approximations. Performance Evaluation 36–37, 267–288.
37. Pornavalai, C., Chakraborty, G., Shiratori, N., 1998. Routing with multiple QoS requirements for supporting multimedia applications. Telecommunication Systems 9, 3–4, 357–373.
38. Roberts, J.W., 1983, Teletraffic models for the Telecom 1 integrated services network. Proceedings of 10th International Teletraffic Congress, Montreal, Canada.
39. Rodrigues, J.M., Clímaco, J.C., Current, J.R., 1999. An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions. Computers and Operations Research 26, 789–798.
40. Schnitter, S., Haßlinger, G., 2002. Heuristic solutions to the LSP-design for MPLS traffic engineering. Proceedings of NETWORKS 2002 – 10th International Telecommunication Network Strategy and Planning Symposium, München, Germany, pp. 269–273.
41. Widyono, R., 1994. The design and evaluation of routing algorithms for real-time channels. Technical Report TR-94-024, Tenet Group, University of California at Berkeley and International Computer Science Institute.