A meta-model for multiobjective routing in MPLS networks

Central European Journal of Operations Research

Volumn 16, Issue 1, 2008, Pages 79-105

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

^a INESC COIMBRA   (Portugal)

^b UNIVERSITY OF COIMBRA   (Portugal)

^c UNIVERSITY OF COIMBRA   (Portugal)

Author keywords

MPLS Internet; Multiobjective optimisation; Routing; Telecommunication networks

Indexed keywords

EID: 38949178749     PISSN: 1435246X     EISSN: 16139178     Source Type: Journal    
DOI: 10.1007/s10100-007-0044-9     Document Type: Article

References (40)

1. Akimaru H and Kawashima K (1993). Teletraffic: theory and applications, telecommunication networks and computer systems. Springer, Heidelberg
2. Awduche D, Malcolm J, Agogbua J, O'Dell M, McManus J (1999) Requirements for traffic engineering over MPLS. RFC 2702, Network Working Group
3. Awduche D, Chiu A, Elwalid A, Widjaja I, Xiao X (2002) Overview and principles of Internet traffic engineering. RFC 3272, Network Working Group
4. Bourquia N, Ameur WB, Gourdin E and Tolla P (2003). Optimal shortest path routing for Internet networks. In: Ben-Ameur, W and Petrowski, A (eds) Proceedings of the international network optimization conference (INOC 2003), pp 119-125. Institut National des Télécommunications, Evry/Paris, France
5. Clímaco JCN, Craveirinha JMF and Pascoal MMB (2003). A bicriterion approach for routing problems in multimedia networks. Networks 41(4): 206-220
6. Elwalid A, Jin C, Low S, Widjaja I (2001) MATE: MPLS adaptive traffic engineering. In: Proceedings of IEEE Infocom 2001, Anchorage, Alaska
7. Elwalid A, Mitra D, Saniee I and Widjaja I (2003). Routing and protection in GMPLS networks: from shortest paths to optimized designs. J Lightwave Technol 21(11): 2828-2838
8. Erbas SC (2003). Utilizing evolutionary algorithms for multiobjective problems in traffic engineering. In: Ben-Ameur, W and Petrowski, A (eds) Proceedings of the international networks optimization conference (INOC 2003), pp 207-212. Institut National des Télécommunications, Evry/Paris, France
9. Erbas SC, 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
10. Erbas SC, 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). Tampa, FL. IEEE Computer Society, pp 166-174
11. Franzke M, Pönitz A (2002) Global shortest path solutions for the traffic engineering problem. In: Proceedings of NETWORKS 2002-10th international telecommunication network strategy and planning symposium. München, Germany, pp 275-278
12. Gelenbe E, Lent R, Montuori A, Xu Z (2002) Cognitive packet networks: QoS and performance. In: MASCOTS symposium. IEEE Computer Society
13. Gelenbe E, Lent R and Nunez A (2004). Self-aware networks and QoS. Proc IEEE 92: 1478-1489
14. Haßlinger G, Schnitter S (2002) Algorithms for traffic engineering. In: Proceedings of 6th INFORMS telecommunications conference. Boca Raton, FL
15. Haßlinger G, Schnitter S (2003) Optimized traffic load distribution in mpls networks. In: Telecommunications network design and management. Kluwer, Dordrecht, pp 125-141
16. Kaufman JS (1981). Blocking in a shared resource environment. IEEE Trans Commun COM-29 10: 1474-1481
17. Kelly FP (1988). Routing in circuit-switched networks: optimization, shadow prices and decentralization. Adv Appl Probab 20(1): 112-144
18. Kelly FP (1990). Routing and capacity allocation in networks with trunk reservation. Math Oper Res 15(4): 771-793
19. Kelly F (1996) Notes on effective bandwidths. In: Kelly FP, Zachary S, Ziedins I (eds) Stochastic networks: theory and applications. Royal Statistical Society Lecture Notes Series, vol 4. Oxford University Press, New York, pp 141-168
20. Knowles J, Oates M and Corne D (2000). Advanced multi-objective evolutionary algorithms applied to two problems in telecommunications. BT Technol J 18(4): 51-65
21. Kochkar H, Ikenaga T, Oie Y (2001) QoS routing algorithm based on multiclasses traffic load. In: Proceedings of global telecommunications conference-GLOBECOM'01, San Antonio, TX, pp 2193-2198
22. Kochkar H, Ikenaga T, Hori Y, Oie Y (2003) Multi-class QoS routing with multiple routing tables. In: Proceedings of IEEE PACRIM'03, Victoria, BC, Canada, pp 388-391
23. Kuipers F, Van Mieghem P, Korkmaz T, Krunz M (2002a) An overview of constraint-based path selection algorithms for QoS routing. IEEE Commun Mag, pp 50-55
24. Kuipers FA, Korkmaz T, Krunz M, Van Mieghem P (2002b) A review of constraint-based routing algorithms. Technical report. Technical University Delft, Delft
25. Ma Q, Steenkiste P (1999) Supporting dynamic inter-class resource sharing: a multi-class QoS routing algorithm. In: Proceedings of IEEE Infocom'99. New York, pp 649-660
26. Martins L (2004) Um Método de Encaminhamento Dinâmico Multiobjectivo em Redes de Telecomunicações - Modelaçã o e Desempenho. Ph.D. thesis, Faculdade de Ciências e Tecnologia da Universidade de Coimbra, Coimbra
27. Martins L, Craveirinha J and Clímaco J (2003). A new multiobjective dynamic routing method for multiservice networks-modelling and performance. In: Ben-Ameur, W and Petrowski, A (eds) Proceedings of the International Networks Optimization Conference (INOC 2003), pp 404-409. Institut National des Télécommunications, Evry/Paris, France
28. Martins L, Craveirinha J and Clímaco J (2006). A new multiobjective dynamic routing method for multiservice networks: modelling and performance. Computat Manag Sci 3(3): 225-244
29. Medhi D and Sukiman I (2000). Multi-service dynamic QoS routing schemes with call admission control: a comparative study. J Netw Syst Manag 8(2): 157-190
30. Mitra D and Morrison JA (1994). Erlang capacity and uniform approximations for shared unbuffered resources. IEEE/ACM Trans Netw 2(6): 558-570
31. Mitra D and Ramakrishnan KG (2001). Techniques for traffic engineering of multiservice, multipriority networks. Bell Labs Tech J 6(1): 139-151
32. Mitra D, Morrison JA and Ramakrishnan KG (1999). Optimization and design of network routing using refined asymptotic approximations. Perform Eval 36-37: 267-288
33. Pornavalai C, Chakraborty G and Shiratori N (1998). Routing with multiple QoS requirements for supporting multimedia applications. Telecommun Syst 9(3-4): 357-373
34. Roberts JW (1983) Teletraffic models for the Telecom 1 integrated services network. In: Proceedings of 10th international teletraffic congress. Montreal, Canada
35. Rombaut M, Hébuterne G, Priem M (2002) The limited version of the mille feuilles: a routing algorithm for packet networks and circuit switched networks with a constraint number of paths. In: Proceedings of NETWORKS 2002-10th international telecommunication network strategy and planning symposium. München, Germany, pp 365-372
36. Rosen E, Viswanathan A, Callon R (2001) Multiprotocol label switching architecture. RFC 3031, Network Working Group
37. Schnitter S, Haßlinger G (2002) Heuristic solutions to the LSP-design for MPLS traffic engineering. In: Proceedings of NETWORKS 2002-10th international telecommunication network strategy and planning symposium. München, Germany, pp 269-273
38. Tralhão L, Craveirinha J, Paixão J (1994) A study on a stochastic system with multiple MMPP inputs subject to access functions. In: New progress in probability and statistics-4th international symposium on statistics of the base country. VSP International Publishers, pp 415-428
39. 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 & International Computer Science Institute
40. Wierzbicki AP, Makowski M, Wessels J (eds) (2000) Model-based decision support methodology with environmental applications. Kluwer, Dordrecht