{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T05:42:39Z","timestamp":1759815759936,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,9,10]],"date-time":"2015-09-10T00:00:00Z","timestamp":1441843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UID\/MAT\/04561\/2013"],"award-info":[{"award-number":["UID\/MAT\/04561\/2013"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UID\/MAT\/04561\/2013"],"award-info":[{"award-number":["UID\/MAT\/04561\/2013"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s11235-015-0083-9","type":"journal-article","created":{"date-parts":[[2015,9,11]],"date-time":"2015-09-11T00:34:30Z","timestamp":1441931670000},"page":"417-434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Lexicographical minimization of routing hops in hop-constrained node survivable networks"],"prefix":"10.1007","volume":"62","author":[{"given":"Luis","family":"Gouveia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Patr\u00edcio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amaro","family":"de Sousa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,10]]},"reference":[{"key":"83_CR1","doi-asserted-by":"crossref","unstructured":"Allman, M., Paxson, V., & Blanton, E. (2009). TCP congestion control. IETF RFC Standard No. 5681, Internet Engineering Task Force.","DOI":"10.17487\/rfc5681"},{"issue":"9","key":"83_CR2","doi-asserted-by":"crossref","first-page":"1530","DOI":"10.1016\/j.comnet.2009.02.001","volume":"53","author":"S Alouneh","year":"2009","unstructured":"Alouneh, S., Anjali, A., & En-Nouaary, A. (2009). A novel path protection scheme for MPLS networks using multi-path routing. Computer Networks, 53(9), 1530\u20131545.","journal-title":"Computer Networks"},{"key":"83_CR3","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s11081-005-1741-7","volume":"6","author":"W Ben-Ameur","year":"2005","unstructured":"Ben-Ameur, W., & Kerivin, H. (2005). Routing of uncertain traffic demands. Optimization and Engineering, 6, 283\u2013313.","journal-title":"Optimization and Engineering"},{"issue":"3","key":"83_CR4","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.comnet.2003.10.001","volume":"44","author":"C Chou","year":"2004","unstructured":"Chou, C. (2004). Traffic engineering for MPLS-based virtual private networks. Computer Networks, 44(3), 319\u2013333.","journal-title":"Computer Networks"},{"key":"83_CR5","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/j.cor.2006.03.022","volume":"35","author":"L Gouveia","year":"2008","unstructured":"Gouveia, L., Paias, A., & Sharma, D. (2008). Modeling and solving the rooted distance-constrained minimum spanning tree problem. Computers & Operations Research, 35, 600\u2013613.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"83_CR6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s11067-007-9038-3","volume":"8","author":"L Gouveia","year":"2008","unstructured":"Gouveia, L., Patr\u00edcio, P., & de Sousa, A. (2008). Hop-constrained node survivable network design: An application to MPLS over WDM. Networks and Spatial Economics, 8(1), 3\u201321.","journal-title":"Networks and Spatial Economics"},{"key":"83_CR7","doi-asserted-by":"crossref","unstructured":"Gouveia, L., Patr\u00edcio, P., & de Sousa, A. (2011). Lexicographical minimization of routing hops in telecommunication networks. In Network optimization, INOC 2011 proceedings. Lecture notes in computer science (vol. 6701, pp. 216\u2013229).","DOI":"10.1007\/978-3-642-21527-8_27"},{"key":"83_CR8","doi-asserted-by":"crossref","unstructured":"Gouveia, L., Patr\u00edcio, P., & de Sousa, A. (2008). Optimal survivable routing with a small number of hops. In Telecommunications modeling, policy, and technology (pp. 253\u2013274), Operations Research\/computer science interfaces book series (vol. 44).","DOI":"10.1007\/978-0-387-77780-1_12"},{"issue":"3","key":"83_CR9","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1111\/j.1475-3995.2010.00766.x","volume":"18","author":"L Gouveia","year":"2011","unstructured":"Gouveia, L., Patr\u00edcio, P., & de Sousa, A. (2011). Models for optimal survivable routing with a minimum number of hops: Comparing disaggregated with aggregated models. International Transactions in Operational Research, 18(3), 335\u2013358.","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"83_CR10","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/ijoc.10.2.180","volume":"10","author":"L Gouveia","year":"1998","unstructured":"Gouveia, L. (1998). Using Variable redefinition for computing lower bounds for minimum spanning and steiner trees with hop constraints. INFORMS Journal on Computing, 10(2), 180\u2013188.","journal-title":"INFORMS Journal on Computing"},{"key":"83_CR11","doi-asserted-by":"crossref","unstructured":"Gouveia, L., Patr\u00edcio, P., & de Sousa, A. (2006). Compact models for hop-constrained node survivable network design. In Telecommunications network planning: Innovations in pricing, network design and management (pp. 167\u2013180), Operations Research\/Computer Science Interfaces Book Series (vol. 33).","DOI":"10.1007\/0-387-29234-9_9"},{"issue":"3","key":"83_CR12","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1109\/35.989779","volume":"40","author":"C Huang","year":"2002","unstructured":"Huang, C., Sharma, V., Owens, K., & Makam, S. (2002). Building reliable MPLS networks using a path protection mechanism. IEEE Communications Magazine, 40(3), 156\u2013162.","journal-title":"IEEE Communications Magazine"},{"issue":"1","key":"83_CR13","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1002\/net.20146","volume":"49","author":"D Huygens","year":"2007","unstructured":"Huygens, D., Labb\u00e9, M., Mahjoub, A. R., & Pesneau, P. (2007). The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut. Networks, 49(1), 116\u2013133.","journal-title":"Networks"},{"issue":"1","key":"83_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.20072","volume":"46","author":"H Kerivin","year":"2005","unstructured":"Kerivin, H., & Mahjoub, A. R. (2005). Design of survivable networks: A survey. Networks, 46(1), 1\u201321.","journal-title":"Networks"},{"key":"83_CR15","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/978-0-387-30165-5_17","volume":"17","author":"J Klincewicz","year":"2006","unstructured":"Klincewicz, J. (2006). Optimization issues in quality of service. Handbook of Optimization in Telecommunications, Chapter, 17, 435\u2013458.","journal-title":"Handbook of Optimization in Telecommunications, Chapter"},{"key":"83_CR16","doi-asserted-by":"crossref","unstructured":"Nace, D., & Pi\u00f3ro, M. (2008). Max\u2013Min fairness and its applications to routing and load-balancing in communication networks: A tutorial. IEEE Surveys and Tutorials, 10(4), 5\u201317.","DOI":"10.1109\/SURV.2008.080403"},{"key":"83_CR17","doi-asserted-by":"crossref","unstructured":"Orlowski, S., & Wessaely, R. (2006). The Effect of hop limits on optimal cost in survivable network design. In Telecommunications network planning: Innovations in pricing, network design and management (pp. 151\u2013166), Operations Research\/Computer Science Interfaces Book Series (vol. 33).","DOI":"10.1007\/0-387-29234-9_8"},{"issue":"5","key":"83_CR18","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1109\/TNET.2007.896231","volume":"15","author":"B Radunovic","year":"2007","unstructured":"Radunovic, B., & Le Boudec, J.-Y. (2007). A unified framework for max\u2013min and min\u2013max fairness with applications. IEEE\/ACM Transactions on Networking, 15(5), 1073\u20131083.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"10","key":"83_CR19","doi-asserted-by":"crossref","first-page":"1578","DOI":"10.1016\/j.comcom.2006.04.004","volume":"29","author":"L Roychoudhuri","year":"2006","unstructured":"Roychoudhuri, L., Al-Shaer, E., & Brewster, G. (2006). On the impact of loss and delay variation on Internet packet audio transmission. Computer Communications, 29(10), 1578\u20131589.","journal-title":"Computer Communications"},{"key":"83_CR20","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/978-3-642-20807-2_30","volume":"6655","author":"M Ruthmair","year":"2011","unstructured":"Ruthmair, M., & Raidl, G. (2011). A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems. Lecture Notes in Computer Science, 6655, 376\u2013388.","journal-title":"Lecture Notes in Computer Science"},{"issue":"12","key":"83_CR21","doi-asserted-by":"crossref","first-page":"3147","DOI":"10.1016\/j.cor.2013.05.006","volume":"40","author":"D Santos","year":"2013","unstructured":"Santos, D., de Sousa, A., & Alvelos, F. (2013). A hybrid column generation with GRASP and path relinking for the network load balancing problem. Computers and Operations Research, 40(12), 3147\u20133158.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"83_CR22","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1007\/s11235-011-9604-3","volume":"52","author":"D Santos","year":"2013","unstructured":"Santos, D., de Sousa, A., Alvelos, F., & Pi\u00f3ro, M. (2013). Optimizing network load balancing: An hybridization approach of metaheuristics with column generation. Telecommunication Systems, 52(2), 959\u2013968.","journal-title":"Telecommunication Systems"},{"key":"83_CR23","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/978-3-540-24693-0_7","volume":"3042","author":"M Scharf","year":"2004","unstructured":"Scharf, M., Necker, M., & Gloss, B. (2004). The sensitivity of TCP to sudden delay variations in mobile networks. Lecture Notes in Computer Sciences, 3042, 76\u201387.","journal-title":"Lecture Notes in Computer Sciences"},{"issue":"3","key":"83_CR24","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/nem.757","volume":"21","author":"W Sheikh","year":"2011","unstructured":"Sheikh, W., & Ghafoor, A. (2011). Jitter-minimized reliability-maximized management of networks. International Journal of Network Management, 21(3), 185\u2013222.","journal-title":"International Journal of Network Management"},{"key":"83_CR25","doi-asserted-by":"crossref","unstructured":"Sommers, J, Barford, P., & Eriksson, B. (2011). On the prevalence and characteristics of MPLS deployments in the open internet. In Proceedings of ACM SIGCOMM conference on internet measurements (pp. 445\u2013462).","DOI":"10.1145\/2068816.2068858"},{"key":"83_CR26","doi-asserted-by":"crossref","unstructured":"Sprecher, N., & Farrel A. (2011). MPLS transport profile (MPLS-TP) survivability framework. IETF RFC Standard No. 6372, Internet engineering task force.","DOI":"10.17487\/rfc6372"},{"issue":"1","key":"83_CR27","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/COMST.2008.4483669","volume":"10","author":"N Wang","year":"2008","unstructured":"Wang, N., Ho, K., Pavlou, G., & Howarth, M. (2008). An overview of routing optimization for internet traffic engineering. IEEE Communications Surveys & Tutorials, 10(1), 36\u201356.","journal-title":"IEEE Communications Surveys & Tutorials"},{"key":"83_CR28","doi-asserted-by":"crossref","unstructured":"Weingarten, Y., Bryant, S., Osborne, E., Sprecher, N., & Fulignoli, A. (2011). MPLS transport profile (MPLS-TP) linear protection. IETF RFC Standard No. 6378, Internet engineering task force.","DOI":"10.17487\/rfc6378"},{"issue":"2","key":"83_CR29","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/65.826369","volume":"14","author":"X Xiao","year":"2000","unstructured":"Xiao, X., Hannan, A., & Bailey, B. (2000). Traffic engineering with MPLS in the internet. IEEE Network, 14(2), 28\u201333.","journal-title":"IEEE Network"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-015-0083-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-015-0083-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-015-0083-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T06:24:24Z","timestamp":1567146264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-015-0083-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,10]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["83"],"URL":"https:\/\/doi.org\/10.1007\/s11235-015-0083-9","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[2015,9,10]]}}}