Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/48488
Title: | Multiobjective routing in multiservice MPLS networks with traffic splitting — A network flow approach | Authors: | Girão-Silva, Rita Craveirinha, José Clímaco, João Captivo, M. Eugénia |
Keywords: | Routing models; Multiobjective optimization; Telecommunication networks; Network flow approach; Traffic splitting | Issue Date: | Dec-2015 | Publisher: | Journal of Systems Science and Systems Engineering, Springer | Citation: | Girão-Silva, R., Craveirinha, J., Clímaco, J. et al. J. Syst. Sci. Syst. Eng. (2015) 24: 389. https://doi.org/10.1007/s11518-015-5262-4 | Project: | info:eu-repo/grantAgreement/FCT/5876-PPCDTI/101884/PT info:eu-repo/grantAgreement/FCT/5876/136033/PT info:eu-repo/grantAgreement/FCT/3599-PPCDT/132959/PT |
Volume: | 24 | Abstract: | A multiobjective routing model for Multiprotocol Label Switching networks with multiple service types and traffic splitting is presented in this paper. The routing problem is formulated as a multiobjective mixed-integer program, where the considered objectives are the minimization of the bandwidth routing cost and the minimization of the load cost in the network links with a constraint on the maximal splitting of traffic trunks. Two different exact methods are developed for solving the formulated problem, one based on the classical constraint method and another based on a modified constraint method. A very extensive experimental study, with results on network performance measures in various reference test networks and in randomly generated networks, is also presented and its results are discussed. | URI: | https://hdl.handle.net/10316/48488 | DOI: | 10.1007/s11518-015-5262-4 | Rights: | embargoedAccess |
Appears in Collections: | I&D INESCC - Artigos em Revistas Internacionais FCTUC Eng.Electrotécnica - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
GiraoCravClimCapt.pdf | 1.56 MB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License