Skip to main content
Log in

A meta-model for multiobjective routing in MPLS networks

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

MPLS (Multiprotocol Label Switching) enables the utilisation of explicit routes and other advanced routing mechanisms in multiservice packet networks, capable of dealing with multiple and heterogeneous QoS (Quality of Service) parameters. Firstly the paper presents a discussion of conceptual and methodological issues raised by multiobjective routing optimisation models for MPLS networks. The major contribution is the proposal of a multiobjective routing optimisation framework for MPLS networks. The major features of this modelling framework are: the formulation of a three-level hierarchical routing optimisation problem including network and service performance objectives, the inclusion of fairness objectives in the different levels of optimisation and a two-level stochastic representation of the traffic in the network (traffic flow and packet stream levels). A variant of the general model for two classes of traffic flows, QoS traffic and Best Effort traffic, is also presented. Finally a stochastic teletraffic modelling approach, underlying the optimisation model, is fully described.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Akimaru H and Kawashima K (1993). Teletraffic: theory and applications, telecommunication networks and computer systems. Springer, Heidelberg

    Google Scholar 

  • Awduche D, Malcolm J, Agogbua J, O’Dell M, McManus J (1999) Requirements for traffic engineering over MPLS. RFC 2702, Network Working Group

  • Awduche D, Chiu A, Elwalid A, Widjaja I, Xiao X (2002) Overview and principles of Internet traffic engineering. RFC 3272, Network Working Group

  • 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

    Google Scholar 

  • Clímaco JCN, Craveirinha JMF and Pascoal MMB (2003). A bicriterion approach for routing problems in multimedia networks. Networks 41(4): 206–220

    Article  Google Scholar 

  • Elwalid A, Jin C, Low S, Widjaja I (2001) MATE: MPLS adaptive traffic engineering. In: Proceedings of IEEE Infocom 2001, Anchorage, Alaska

  • 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

    Article  Google Scholar 

  • 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

    Google Scholar 

  • 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

  • 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

  • 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

  • Gelenbe E, Lent R, Montuori A, Xu Z (2002) Cognitive packet networks: QoS and performance. In: MASCOTS symposium. IEEE Computer Society

  • Gelenbe E, Lent R and Nunez A (2004). Self-aware networks and QoS. Proc IEEE 92: 1478–1489

    Article  Google Scholar 

  • Haßlinger G, Schnitter S (2002) Algorithms for traffic engineering. In: Proceedings of 6th INFORMS telecommunications conference. Boca Raton, FL

  • Haßlinger G, Schnitter S (2003) Optimized traffic load distribution in mpls networks. In: Telecommunications network design and management. Kluwer, Dordrecht, pp 125–141

  • Kaufman JS (1981). Blocking in a shared resource environment. IEEE Trans Commun COM-29 10: 1474–1481

    Article  Google Scholar 

  • Kelly FP (1988). Routing in circuit-switched networks: optimization, shadow prices and decentralization. Adv Appl Probab 20(1): 112–144

    Article  Google Scholar 

  • Kelly FP (1990). Routing and capacity allocation in networks with trunk reservation. Math Oper Res 15(4): 771–793

    Article  Google Scholar 

  • 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

  • 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

    Article  Google Scholar 

  • 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

  • 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

  • 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

  • Kuipers FA, Korkmaz T, Krunz M, Van Mieghem P (2002b) A review of constraint-based routing algorithms. Technical report. Technical University Delft, Delft

  • 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

  • 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

  • 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

    Google Scholar 

  • 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

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • Mitra D and Morrison JA (1994). Erlang capacity and uniform approximations for shared unbuffered resources. IEEE/ACM Trans Netw 2(6): 558–570

    Article  Google Scholar 

  • Mitra D and Ramakrishnan KG (2001). Techniques for traffic engineering of multiservice, multipriority networks. Bell Labs Tech J 6(1): 139–151

    Article  Google Scholar 

  • Mitra D, Morrison JA and Ramakrishnan KG (1999). Optimization and design of network routing using refined asymptotic approximations. Perform Eval 36–37: 267–288

    Article  Google Scholar 

  • Pornavalai C, Chakraborty G and Shiratori N (1998). Routing with multiple QoS requirements for supporting multimedia applications. Telecommun Syst 9(3-4): 357–373

    Article  Google Scholar 

  • Roberts JW (1983) Teletraffic models for the Telecom 1 integrated services network. In: Proceedings of 10th international teletraffic congress. Montreal, Canada

  • 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

  • Rosen E, Viswanathan A, Callon R (2001) Multiprotocol label switching architecture. RFC 3031, Network Working Group

  • 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

  • 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

  • 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

  • Wierzbicki AP, Makowski M, Wessels J (eds) (2000) Model-based decision support methodology with environmental applications. Kluwer, Dordrecht

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to José Craveirinha.

Additional information

Work partially supported by programme POSI of the III EC programme cosponsored by FEDER and national funds.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Craveirinha, J., Girão-Silva, R. & Clímaco, J. A meta-model for multiobjective routing in MPLS networks. cent.eur.j.oper.res. 16, 79–105 (2008). https://doi.org/10.1007/s10100-007-0044-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-007-0044-9

Keywords

Navigation