A network-wide exact optimization approach for multiobjective routing with path protection in multiservice multiprotocol label switching networks

References

• Alouneh, S., A. Agarwal, and A. En-Nouaary. 2009. “A Novel Path Protection Scheme for MPLS Networks Using Multi-Path Routing.” Computer Networks 53 (9): 1530–1545. doi: 10.1016/j.comnet.2009.02.001
   Web of Science ®Google Scholar
• Alvarez, S. 2006. QoS for IP/MPLS Networks. Indianapolis, IN: Cisco Press.
   Google Scholar
• Banks, J., and J. S. Carson. 1984. Discrete-Event System Simulation. International Series in Industrial and Systems Engineering. Upper Saddle River, NJ: Prentice-Hall.
   Google Scholar
• Clímaco, J., J. Craveirinha, and R. GirãoSilva. 2016. “Multicriteria Analysis in Telecommunication Network Planning and Design: A Survey.” Chap. 26 in Multiple Criteria Decision Analysis—State of the Art Surveys, edited by S. Greco, M. Ehrgott and J. R. Figueira, 1167–1233, Vol. 233 of International Series in Operations Research & Management Science. New York, NY: Springer.
   Google Scholar
• Clímaco, J. C. N., J. M. F. Craveirinha, and M. M. B. Pascoal. 2007. “Multicriteria Routing Models in Telecommunication Networks—Overview and a Case Study.” In Advances in Multiple Criteria Decision Making and Human Systems Management: Knowledge and Wisdom, edited by Y. Shi, D. L. Olson and A. Stam, 17–46. Amsterdam, the Netherlands: IOS Press.
   Google Scholar
• Cohon, J. L. 1978. Multiobjective Programming and Planning. Mathematics in Science and Engineering series. New York, NY: Academic Press.
   Google Scholar
• Craveirinha, J., J. Clímaco, L. Martins, C. G. daSilva, and N. Ferreira. 2013. “A Bi-Criteria Minimum Spanning Tree Routing Model for MPLS/Overlay Networks.” Telecommunication Systems 52 (1): 203–215. doi: 10.1007/s11235-011-9553-x
   Web of Science ®Google Scholar
• Craveirinha, J., R. Girão-Silva, and J. Clímaco. 2008. “A Meta-Model for Multiobjective Routing in MPLS Networks.” Central European Journal of Operations Research 16 (1): 79–105. doi: 10.1007/s10100-007-0044-9
   Web of Science ®Google Scholar
• Craveirinha, J. M. F, J. C. N. Clímaco, M. M. B. Pascoal, and L. M. R. A Martins. 2007. “Traffic Splitting in MPLS Networks—A Hierarchical Multicriteria Approach.” Journal of Telecommunications and Information Technology 2007 (4): 3–10. http://www.nit.eu/czasopisma/JTIT/2007/4/3.pdf.
   Google Scholar
• Doar, M., and I. M. Leslie. 1993. “How Bad Is Naive Multicast Routing?” In Proceedings of IEEE INFOCOM'93, 12th Annual Joint Conference of the IEEE Computer & Communications Societies, 28 March–1 April 1993, San Francisco, Vol. 1, 82–89. doi: 10.1109/INFCOM.1993.253246.
   Google Scholar
• Ehrgott, M., and X. Gandibleux. 2000. “A Survey and Annotated Bibliography of Multiobjective Combinatorial Optimization.” OR Spektrum 22 (4): 425–460. doi: 10.1007/s002910000046
   Google Scholar
• Erbas, S. C, and C. Erbas. 2003. “A Multiobjective Off-Line Routing Model for MPLS Networks.” In Proceedings of the 18th International Teletraffic Congress (ITC-18), 31 August–5 September 2003, Berlin, edited by J. Charzinski, R. Lehnert and P. Tran-Gia, 471–480, Vol. 5 of Teletraffic Science and Engineering series. Amsterdam: Elsevier. doi: 10.1016/S1388-3437(03)80192-0.
   Google Scholar
• Fortz, B., and M. Thorup. 2000. “Internet Traffic Engineering by Optimizing OSPF Weights.” In Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000), 26–30 March 2000, Tel Aviv, Israel, edited by M. Sidi, I. Katzela and Y. Shavitt, Vol. 2, 519–528. Piscataway, NJ: IEEE Computer and Communications Societies.
   Google Scholar
• Fortz, B., and M. Thorup. 2002. “Optimizing OSPF/IS-IS Weights in a Changing World.” IEEE Journal on Selected Areas in Communications 20 (4): 756–767. doi: 10.1109/JSAC.2002.1003042
   Web of Science ®Google Scholar
• Girão-Silva, R., J. Craveirinha, J. Clímaco, and M. E. Captivo. 2015. “Multiobjective Routing in Multiservice MPLS Networks with Traffic Splitting—A Network Flow Approach.” Journal of Systems Science and Systems Engineering 24 (4): 389–432. doi: 10.1007/s11518-015-5262-4
   Web of Science ®Google Scholar
• Gomes, T., L. Martins, and J. Craveirinha. 2001. “An Algorithm for Calculating k Shortest Paths with a Maximum Number of Arcs.” Investigação Operacional 21 (2): 235–244. http://home.deec.uc.pt/~teresa/Repositorio/RReports/ET-N6.pdf.
   Google Scholar
• GT-ITM, 2000. “Modeling Topology of Large Internetworks.” GT-ITM: Georgia Tech Internetwork Topology Models. http://www.cc.gatech.edu/projects/gtitm/.
   Google Scholar
• Huang, C., V. Sharma, K. Owens, and S. Makam. 2002. “Building Reliable MPLS Networks Using a Path Protection Mechanism.” IEEE Communications Magazine 40 (3): 156–162. doi: 10.1109/35.989779
   Web of Science ®Google Scholar
• IBM. 2013a. “ILOG CPLEX Optimization Studio V12.6.” IBM.
   Google Scholar
• IBM. 2013b. “ILOG CPLEX Optimization Studio V12.6.0 documentation.” IBM. http://pic.dhe.ibm.com/infocenter/cosinfoc/v12r6/index.jsp.
   Google Scholar
• Jorge, L., and T. Gomes. 2006. “Survey of Recovery Schemes in MPLS Networks.” In Proceedings of DepCoS—International Conference on Dependability of Computer Systems (RELCOMEX 2006), 25–27 May 2006, Szklarska Poreba, Poland, edited by W. Zamojski, J. Mazurkiewicz, J. Sugier and T. Walkowiak, 110–118.
   Google Scholar
• Martins, E. Q. V, M. M. B. Pascoal, and J. L. E. Santos. 1999. “Deviation Algorithms for Ranking Shortest Paths.” International Journal of Foundations of Computer Science 10 (3): 247–263. doi: 10.1142/S0129054199000186
   Google Scholar
• Mavrotas, G. 2009. “Effective Implementation of the ε-Constraint Method in Multi-Objective Mathematical Programming Problems.” Applied Mathematics and Computation 213 (2): 455–465. doi: 10.1016/j.amc.2009.03.037
   Web of Science ®Google Scholar
• Mitra, D., and K. G. Ramakrishnan. 2001. “Techniques for Traffic Engineering of Multiservice, Multipriority Networks.” Bell Labs Technical Journal 6 (1): 139–151. doi: 10.1002/bltj.2268
   Web of Science ®Google Scholar
• Mobasheri, B., and M. H. Y. Moghadam. 2014. “A Path Protection Method Using Congestion Control in IP/MPLS Networks as an Underlying Network in Smart Grids.” The SIJ Transactions on Computer Science Engineering & Its Applications (CSEA) 2 (5): 182–189.
   Google Scholar
• NaraghiPour, M., and V. Desai. 2008. “Loop-Free Traffic Engineering with Path Protection in MPLS VPNs.” Computer Networks 52 (12): 2360–2372. doi: 10.1016/j.comnet.2008.04.015
   Web of Science ®Google Scholar
• Pan, P., G. Swallow, and A. Atlas. 2005. “Fast Reroute Extensions to RSVP-TE for LSP Tunnels.” RFC 4090, Network Working Group, The Internet Society.
   Google Scholar
• Sharma, V., and F. Hellstrand, 2003. “Framework for Multi-Protocol Label Switching (MPLS)-Based Recovery.” RFC 3469, Network Working Group, The Internet Society.
   Google Scholar
• Srivastava, S., Agrawal, G., M. Pióro, and D. Medhi. 2005. “Determining Link Weight System under Various Objectives for OSPF Networks Using a Lagrangian Relaxation-Based Approach.” IEEE Transactions on Network and Service Management 2 (1): 9–18. doi: 10.1109/TNSM.2005.4798297
   Google Scholar
• Steuer, Ralph E. 1986. Multiple Criteria Optimization: Theory, Computation and Application. Book 10 of the Wiley Series in Probability and Mathematical Statistics. New York: Wiley.
   Google Scholar
• Wang, D., and F. Ergun. 2005. “Path Protection with Pre-Identification for MPLS Networks.” In Proceedings of the 2nd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE'05), 24–24 August 2005, Lake Vista, FL. doi: 10.1109/QSHINE.2005.41.
   Google Scholar
• Wierzbicki, A. P, and W. Burakowski. 2011. “A Conceptual Framework for Multiple-Criteria Routing in QoS IP Networks.” International Transactions in Operational Research 18 (3): 377–399. doi: 10.1111/j.1475-3995.2010.00770.x
   Web of Science ®Google Scholar