{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T09:16:22Z","timestamp":1677834982838},"reference-count":47,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2011,4,1]],"date-time":"2011-04-01T00:00:00Z","timestamp":1301616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1016\/j.comnet.2010.11.005","type":"journal-article","created":{"date-parts":[[2010,11,21]],"date-time":"2010-11-21T09:21:35Z","timestamp":1290331295000},"page":"1132-1149","source":"Crossref","is-referenced-by-count":25,"title":["An efficient algorithm to enable path diversity in link state routing networks"],"prefix":"10.1016","volume":"55","author":[{"given":"P.","family":"M\u00e9rindol","sequence":"first","affiliation":[]},{"given":"P.","family":"Francois","sequence":"additional","affiliation":[]},{"given":"O.","family":"Bonaventure","sequence":"additional","affiliation":[]},{"given":"S.","family":"Cateloin","sequence":"additional","affiliation":[]},{"given":"J.-J.","family":"Pansiot","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.comnet.2010.11.005_b0005","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1109\/TNET.2007.892850","article-title":"Multipath routing algorithms for congestion minimization","volume":"15","author":"Banner","year":"2007","journal-title":"IEEE\/ACM Transactions of Networking"},{"key":"10.1016\/j.comnet.2010.11.005_b0010","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/90.811453","article-title":"Analysis of multi-path routing","volume":"7","author":"Cidon","year":"1999","journal-title":"IEEE\/ACM Transactions of Networking"},{"key":"10.1016\/j.comnet.2010.11.005_b0015","doi-asserted-by":"crossref","unstructured":"H. Wang, H. Xie, L. Qiu, Y.R. Yang, Y. Zhang, A. Greenberg, COPE: traffic engineering in dynamic networks, in: ACM SIGCOMM, 2006.","DOI":"10.1145\/1159913.1159926"},{"key":"10.1016\/j.comnet.2010.11.005_b0020","unstructured":"S.N. Vutukury, Multipath Routing Mechanisms for Traffic Engineering and Quality of Service in the Internet, Ph.D. Thesis, 2001."},{"key":"10.1016\/j.comnet.2010.11.005_b0025","doi-asserted-by":"crossref","unstructured":"D. Applegate, E. Cohen, Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs, in: ACM SIGCOMM, 2003.","DOI":"10.1145\/863989.863991"},{"key":"10.1016\/j.comnet.2010.11.005_b0030","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"key":"10.1016\/j.comnet.2010.11.005_b0035","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/MNET.2004.1276606","article-title":"Feasibility of IP restoration in a Tier-1 backbone","volume":"18","author":"Iannaccone","year":"2004","journal-title":"IEEE Networks Magazine"},{"key":"10.1016\/j.comnet.2010.11.005_b0040","doi-asserted-by":"crossref","unstructured":"A. Elwalid, C. Jin, S.H. Low, I. Widjaja, MATE: MPLS adaptive traffic engineering, in: IEEE INFOCOM, 2001.","DOI":"10.1016\/S1389-1286(02)00308-0"},{"key":"10.1016\/j.comnet.2010.11.005_b0045","doi-asserted-by":"crossref","unstructured":"S. Kandula, D. Katabi, B. Davie, A. Charny, Walking the tightrope: responsive yet stable traffic engineering, in: ACM SIGCOMM, 2005.","DOI":"10.1145\/1080091.1080122"},{"key":"10.1016\/j.comnet.2010.11.005_b0050","unstructured":"C. Villamizar, OSPF Optimized Multipath (OSPF-OMP): draft-ietf-ospf-omp-02.txt, Draft, 1999."},{"key":"10.1016\/j.comnet.2010.11.005_b0055","doi-asserted-by":"crossref","unstructured":"X. Yang, D. Wetherall, Source selectable path diversity via routing deflections, in: ACM SIGCOMM, 2006.","DOI":"10.1145\/1159913.1159933"},{"key":"10.1016\/j.comnet.2010.11.005_b0060","doi-asserted-by":"crossref","first-page":"1094","DOI":"10.1109\/71.963420","article-title":"The power of two choices in randomized load balancing","volume":"12","author":"Mitzenmacher","year":"2001","journal-title":"IEEE Transactions of Parallel Distributed Systems"},{"key":"10.1016\/j.comnet.2010.11.005_b0065","doi-asserted-by":"crossref","unstructured":"A. Akella, B. Maggs, S. Seshan, A. Shaikh, R. Sitaraman, A measurement-based analysis of multihoming, in: ACM SIGCOMM, 2003.","DOI":"10.1145\/863955.863995"},{"key":"10.1016\/j.comnet.2010.11.005_b0070","doi-asserted-by":"crossref","unstructured":"A. Atlas, A. Zinin, Basic Specification for IP Fast Reroute: Loop-Free Alternates, RFC 5286, IETF, 2008.","DOI":"10.17487\/rfc5286"},{"key":"10.1016\/j.comnet.2010.11.005_b0075","doi-asserted-by":"crossref","unstructured":"P. Francois, O. Bonaventure, An evaluation of IP-based fast reroute techniques, in: ACM CONEXT, 2005.","DOI":"10.1145\/1095921.1095962"},{"key":"10.1016\/j.comnet.2010.11.005_b0080","unstructured":"G. Swallow, A. Atlas, P. Pan, Fast Reroute Extensions to RSVP-TE for LSP Tunnels, RFC 4090, IETF, 2005."},{"key":"10.1016\/j.comnet.2010.11.005_b0085","unstructured":"S. Bryant, M. Shand, S. Previdi, IP Fast Reroute Using Not-via Addresses draft-bryant-shand-ipfrr-notvia-addresses-03.txt, Draft, IETF, 2006."},{"key":"10.1016\/j.comnet.2010.11.005_b0090","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/1070873.1070877","article-title":"Achieving sub-second IGP convergence in large IP networks","volume":"35","author":"Francois","year":"2005","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"10.1016\/j.comnet.2010.11.005_b0095","unstructured":"ISO\/IEC 10589, Information technology Telecommunications and information exchange between systems Intermediate System to Intermediate System intra-domain routing information exchange protocol for use in conjunction with the protocol for providing the connectionless-mode network service, ISO 8473."},{"key":"10.1016\/j.comnet.2010.11.005_b0100","doi-asserted-by":"crossref","first-page":"2894","DOI":"10.1016\/j.comnet.2008.06.004","article-title":"Towards low-complexity internet traffic engineering: the adaptive multi-path algorithm","volume":"52","author":"Gojmerac","year":"2008","journal-title":"Elsevier Computer Networks"},{"key":"10.1016\/j.comnet.2010.11.005_b0105","unstructured":"P. Narvaez, K.Y. Siu, Efficient algorithms for multi-path link state routing, in: ISCOM\u201999, Kaohsiung, Taiwan, 1999."},{"key":"10.1016\/j.comnet.2010.11.005_b0110","doi-asserted-by":"crossref","unstructured":"A. Shaikh, A. Greenberg, Experience in black-box ospf measurement, in: IMW, 2001.","DOI":"10.1145\/505202.505218"},{"key":"10.1016\/j.comnet.2010.11.005_b0115","doi-asserted-by":"crossref","unstructured":"P. M\u00e9rindol, J.-J. Pansiot, S. Cateloin, Improving load balancing with multipath routing, in: IEEE ICCCN, 2008.","DOI":"10.1109\/ICCCN.2008.ECP.30"},{"key":"10.1016\/j.comnet.2010.11.005_b0120","unstructured":"S. Bryant, C. Filsfils, S. Previdi, M. Shand, IP Fast Reroute using Tunnels, draft-bryant-ipfrr-tunnels-03, Draft, IETF, 2007."},{"key":"10.1016\/j.comnet.2010.11.005_b0125","unstructured":"C. Filsfils, BGP Convergence in much less than a second. Available from: ."},{"key":"10.1016\/j.comnet.2010.11.005_b0130","series-title":"Introduction to Algorithms","author":"Cormen","year":"2001"},{"key":"10.1016\/j.comnet.2010.11.005_b0135","unstructured":"P. M\u00e9rindol, P. Francois, O. Bonventure, J.-J. Pansiot, S. Cateloin, The Two Best First Hops Algorithm (TBFH), Techreport id:2010-01, 2010. Available from: ."},{"key":"10.1016\/j.comnet.2010.11.005_b0140","doi-asserted-by":"crossref","unstructured":"P. M\u00e9rindol, J.-J. Pansiot, S. Cateloin, Low complexity link state multipath routing, in: Global Internet Symposium (IEEE INFOCOM Workshop), 2009.","DOI":"10.1109\/INFCOMW.2009.5072161"},{"key":"10.1016\/j.comnet.2010.11.005_b0145","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s11276-004-4749-6","article-title":"A transport layer approach for achieving aggregate bandwidths on multi-homed mobile hosts","volume":"11","author":"Hsieh","year":"2005","journal-title":"Wireless Networks"},{"key":"10.1016\/j.comnet.2010.11.005_b0150","unstructured":"A tool for path computation algorithms. Available from: ."},{"key":"10.1016\/j.comnet.2010.11.005_b0155","doi-asserted-by":"crossref","unstructured":"C. Hopps, Analysis of an Equal-Cost Multi-Path Algorithm, RFC 2992, IETF, 2000.","DOI":"10.17487\/rfc2992"},{"key":"10.1016\/j.comnet.2010.11.005_b0160","doi-asserted-by":"crossref","unstructured":"M. Motiwala, M. Elmore, N. Feamster, S. Vempala, Path splicing, in: ACM SIGCOMM Computer Communication Review, 2008.","DOI":"10.1145\/1402958.1402963"},{"key":"10.1016\/j.comnet.2010.11.005_b0165","unstructured":"M. Pascoal, Implementations and empirical comparison for K shortest loopless path algorithms, in: The Ninth DIMACS Implementation Challenge: The Shortest Path Problem, 2006."},{"key":"10.1016\/j.comnet.2010.11.005_b0170","unstructured":"D. Eppstein, Finding the k shortest paths, in: IEEE Symposium on Foundations of Computer Science, 1994."},{"key":"10.1016\/j.comnet.2010.11.005_b0175","unstructured":"D. Eppstein, Bibliography on k shortest paths and other k best solutions problems. Available from: ."},{"key":"10.1016\/j.comnet.2010.11.005_b0180","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230040204","article-title":"Disjoint paths in a network","volume":"4","author":"Suurballe","year":"1974","journal-title":"Networks"},{"key":"10.1016\/j.comnet.2010.11.005_b0185","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1109\/26.2815","article-title":"A k shortest path algorithm for adaptive routing in communications networks","volume":"36","author":"Topkis","year":"1988","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/j.comnet.2010.11.005_b0190","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1109\/TCOM.1980.1094721","article-title":"The new routing algorithm for the ARPANET","volume":"28","author":"McQuillan","year":"1980","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/j.comnet.2010.11.005_b0195","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1109\/90.893870","article-title":"New dynamic algorithms for shortest path tree computation","volume":"8","author":"Narv\u00e1ez","year":"2000","journal-title":"IEEE\/ACM Transactions of Networking"},{"key":"10.1016\/j.comnet.2010.11.005_b0200","unstructured":"OSPF Incremental SPF. Available from: ."},{"key":"10.1016\/j.comnet.2010.11.005_b0205","unstructured":"J. Chen, P. Druschel, D. Subramanian, An efficient multipath forwarding method, in: IEEE INFOCOM, 1998."},{"key":"10.1016\/j.comnet.2010.11.005_b0210","doi-asserted-by":"crossref","unstructured":"H.T. Kaur, S. Kalyanaraman, A. Weiss, S. Kanwar, A. Gandhi, BANANAS: an evolutionary framework for explicit and multipath routing in the internet, in: ACM SIGCOMM, 2003.","DOI":"10.1145\/944759.944766"},{"key":"10.1016\/j.comnet.2010.11.005_b0215","doi-asserted-by":"crossref","unstructured":"Y. Ohara, S. Imahori, R.V. Meter, MARA: maximum alternative routing algorithm, in: IEEE INFOCOM, 2009.","DOI":"10.1109\/INFCOM.2009.5061933"},{"key":"10.1016\/j.comnet.2010.11.005_b0220","doi-asserted-by":"crossref","unstructured":"R. Mahajan, N. Spring, D. Wetherall, T. Anderson, Inferring link weights using end-to-end measurements, in: ACM SIGCOMM Internet Measurement Workshop, 2002.","DOI":"10.1145\/637235.637237"},{"key":"10.1016\/j.comnet.2010.11.005_b0225","unstructured":"B. Quoitin, Topology Generation through Network Design Heuristics. Available from: ."},{"key":"10.1016\/j.comnet.2010.11.005_b0230","unstructured":"B. Quoitin, V.V. den Schrieck, P. Francois, O. Bonaventure, IGEN: generation of router-level internet topologies through network design heuristics, in: Proceedings of the 21st International Teletraffic Conference, 2009."},{"key":"10.1016\/j.comnet.2010.11.005_b0235","doi-asserted-by":"crossref","unstructured":"M. Faloutsos, P. Faloutsos, C. Faloutsos, On power-law relationships of the internet topology, in: Proceedings of the ACM SIGCOMM, 1999.","DOI":"10.1145\/316188.316229"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128610003464?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128610003464?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T12:39:50Z","timestamp":1559824790000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128610003464"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":47,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["S1389128610003464"],"URL":"https:\/\/doi.org\/10.1016\/j.comnet.2010.11.005","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2011,4]]}}}