{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T10:50:26Z","timestamp":1776941426330,"version":"3.51.4"},"reference-count":116,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Surv. Tutorials"],"published-print":{"date-parts":[[2007]]},"DOI":"10.1109\/comst.2007.4317617","type":"journal-article","created":{"date-parts":[[2007,9,24]],"date-time":"2007-09-24T19:01:55Z","timestamp":1190660515000},"page":"2-17","source":"Crossref","is-referenced-by-count":39,"title":["Recovery techniques in next generation networks"],"prefix":"10.1109","volume":"9","author":[{"given":"Aun","family":"Haider","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Harris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1998.682929"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/65.885666"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/DISCEX.2000.824977"},{"key":"ref32","first-page":"277","article-title":"A Restoration Methodology Based on Pre-Planned Source Routing in ATM Networks","volume":"1","author":"phone","year":"1997","journal-title":"Proc IEEE ICC"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/ICCCN.2000.885491","article-title":"Dynamic Establishment of Protection Paths in WDM Networks Part I","author":"anand","year":"2000","journal-title":"Proc 9th Int'l Conf Computer Commun and Networks ICCCN"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/90.650138"},{"key":"ref37","first-page":"719","article-title":"Partial Path Protection for WDM Networks: End-to-End Recovery Using Local Failure Information","author":"wang","year":"2002","journal-title":"Proc 7th Int'l Symp Computers and Communications ISCC"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2005.1494643"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1999.765615"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.751461"},{"key":"ref28","author":"mahajan","year":"2002","journal-title":"Rocketfuel An ISP topology mapping engine"},{"key":"ref27","first-page":"346","article-title":"BRITE: An Approach to Universal Topology Generation","author":"medina","year":"2001","journal-title":"Proc 9th Int'l Symp Modeling Analysis and Simulation of Computer and Telecommunication Systems"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633040"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.1990.116556"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2003.1204997"},{"key":"ref21","author":"garey","year":"1979","journal-title":"Computers and Intractability"},{"key":"ref24","author":"weisstein","year":"0","journal-title":"Menger's n-Arc Theorem"},{"key":"ref23","first-page":"96","author":"menger","year":"1927","journal-title":"Zur allgemeinen kurventheorie"},{"key":"ref101","first-page":"2691","article-title":"Delay Reduction in Redundant Trees for Pre-Planned Protection against Single Link\/Node Failure in 2-Connected Graphs","volume":"3","author":"xue","year":"2002","journal-title":"Proc IEEE GLOBECOM '02"},{"key":"ref26","first-page":"238","article-title":"Resilient Routing Layers for Recovery in Packet Networks","author":"kvalbein","year":"2005","journal-title":"Proc Int'l Conf Dependable Systems and Networks DSN'05"},{"key":"ref100","doi-asserted-by":"crossref","first-page":"2766","DOI":"10.1109\/ICC.2002.997346","article-title":"QoS Issues in Redundant Trees for Protection in Vertex-Redundant or Edge Redundant Graphs","volume":"5","author":"xue","year":"2002","journal-title":"Proc IEEE Int'l Conf Commun"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0088963","author":"stoer","year":"1992","journal-title":"Lecture Notes in Mathematics"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/26.179933"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040204"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.836111"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/49.265708"},{"key":"ref57","first-page":"43","article-title":"Restoration by Path Concatenation: Fast Recovery of MPLS Paths","author":"bremler-barr","year":"2000","journal-title":"Proc ACM Symp Principles of Distributed Computing"},{"key":"ref56","year":"2005","journal-title":"Fast Reroute Extensions to RSVP-TE for LSP Tunnels"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380240904"},{"key":"ref54","first-page":"705","article-title":"On Finding Disjoint Paths in Single and Dual Link Cost Networks","volume":"1","author":"xu","year":"2004","journal-title":"Proc IEEE INFOCOM'04"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/115994.115998"},{"key":"ref52","first-page":"173","article-title":"A Distributed Algorithm for Finding Shortest Pairs of Disjoint Paths","volume":"1","author":"ogier","year":"1989","journal-title":"Proc IEEE INFOCOM'89"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/SSST.2003.1194519"},{"key":"ref4","year":"0"},{"key":"ref3","year":"2000"},{"key":"ref6","first-page":"2756","article-title":"Finding Protection Cycles in DWDM Networks","volume":"5","author":"zhang","year":"2002","journal-title":"Proc IEEE IC'02"},{"key":"ref5","author":"ramaswami","year":"1998","journal-title":"Optical Networks A Practical Perspective"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.829644"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/SCAC.1995.523657"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/047176910X"},{"key":"ref9","author":"grover","year":"2004","journal-title":"Mesh-Based Survivable Networks Options and Strategies for Optical MPLS SONET and ATM Networking"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140209"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040204"},{"key":"ref48","author":"bhandari","year":"1999","journal-title":"Survivable Networks Algorithms for Diverse Routing"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.1997.616037"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/35.783127"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2003.1232235"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1109\/CONTEL.2003.176997","article-title":"Unified ILP Formulation of Protection in Mesh Networks","volume":"2","author":"mauz","year":"2003","journal-title":"Proc 7th Int'l Conf Telecommun ConTEL 2003"},{"key":"ref73","year":"2006","journal-title":"A modeling language for mathematical programming"},{"key":"ref72","first-page":"99","article-title":"Increasing the Efficiency of Span-restorable Mesh Networks on Low-connectivity Graphs","author":"grover","year":"2001","journal-title":"Proc 3rd Int'l Wksp Design of Reliable Communication Networks (DRCN 2001)"},{"key":"ref71","first-page":"121","article-title":"Comparison of Mesh Protection and Restoration Schemes and the Dependency on Graph Connectivity","author":"doucette","year":"2001","journal-title":"Proc 3rd Int'l Wksp Design of Reliable Commun Networks (DRCN 2001)"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/35.978047"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/49.887913"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2001.923599"},{"key":"ref74","year":"2006","journal-title":"CPLEX"},{"key":"ref75","author":"grover","year":"1994","journal-title":"Distributed Restoration of the Transport Network"},{"key":"ref78","author":"stamatelakis","year":"1997","journal-title":"Theory and algorithms for preconfiguration of spare capacity in mesh restorable networks"},{"key":"ref79","author":"grover","year":"0"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715910"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90016-8"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90016-8"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/90.803380"},{"key":"ref64","author":"siller","year":"1996","journal-title":"SONET\/SDH A Sourcebook of Synchronous Networking"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/9780470544990"},{"key":"ref66","author":"grover","year":"2000","journal-title":"Bridging the Ring-Mesh Dichotomy with p-cycles"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.751462"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/50.156884"},{"key":"ref2","author":"goralski","year":"2001","journal-title":"Optical Networking and WDM"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/CCECE.1999.807199"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.815909"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.1992.276439"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1109\/DRCN.2003.1275358"},{"key":"ref108","author":"bryant","year":"2006","journal-title":"IP fast reroute using not-via addresses"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1109\/ICTEL.2003.1191579"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1145\/1095921.1095962"},{"key":"ref93","article-title":"Capacity-efficient Planning of Resilient Networks with p-Cycles","author":"gruber","year":"2002","journal-title":"Proc 10-th Int'l Telecommun Network Strategy and Planning Symp"},{"key":"ref106","first-page":"1631","article-title":"Fast, Effective and Stable IP Recovery using Resilient Routing Layers","author":"hansen","year":"2005","journal-title":"Proc 19th Int'l Teletraffic Congress (ITC19)"},{"key":"ref92","author":"wittner","year":"2003","journal-title":"Emergent Behavior Based Implements for Distributed Network Management"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2005.1503238"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1109\/DRCN.2005.1563904"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2006.140"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2004.1276611"},{"key":"ref103","article-title":"FROOTS-Fault Handling in Up\/Down Routed Networks with Multiple Roots","author":"theiss","year":"2003","journal-title":"Proc Int'l Conf High Performance Computing"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2001.936285"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1109\/NGI.2005.1431689"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1109\/90.336320"},{"key":"ref110","first-page":"1","article-title":"Quantitative Comparison of End-to-End Availability of Service Paths in Ring and Meshrestorable Networks","author":"clouqueur","year":"2003","journal-title":"Proc National Fiber Optic Engineers Conference (NFOEC '03)"},{"key":"ref98","first-page":"2024","article-title":"Optimal Configuration of p-Cycles in WDM Optical Networks with Sparse Wavelength Conversion","volume":"3","author":"li","year":"2004","journal-title":"Proc IEEE GLOBECOM '04"},{"key":"ref99","first-page":"272","article-title":"A Novel Approach to Automatic Protection Switching Using Trees","volume":"1","author":"finn","year":"1997","journal-title":"Proc IEEE ICC"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025675204127"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2002.997345"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2002.806338"},{"key":"ref11","author":"davie","year":"2000","journal-title":"MPLS Technology and Applications"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2006.1580913"},{"key":"ref13","author":"larkin","year":"2004","journal-title":"ASON and GMPLS-The Battle of the Optical Control Plane An Overview of the Ongoing Work of IETF and ITU to Standardize Optical Control Plane Protocols"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2002.802003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2003.819545"},{"key":"ref16","author":"farrel","year":"2004","journal-title":"The Internet and Its Protocols A Comparative Approach"},{"key":"ref82","first-page":"321","article-title":"Finding Good Candidate Cycles for Efficient p-Cycles Network Design","author":"liu","year":"2004","journal-title":"Proc Int'l Conf Computer Commun and Networks"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.osn.2005.07.001"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/DRCN.2003.1275359"},{"key":"ref18","first-page":"139","article-title":"Recovery from Control Plane Failures in the CR-LDP Signaling Protocol","author":"wu","year":"2003","journal-title":"Proc Design of Reliable Communication Networks"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/DRCN.2003.1275377"},{"key":"ref19","author":"diestel","year":"2005","journal-title":"Graph Theory"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2003.1204626"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2005.1577354"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1002\/047122460X"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31957-3_22"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/26.864163"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2005.1503236"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2005.1413634"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1007\/s11107-005-7357-1"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1109\/49.887914"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/49.887914"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2005.70"}],"container-title":["IEEE Communications Surveys &amp; Tutorials"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9739\/4317615\/04317617.pdf?arnumber=4317617","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:17:49Z","timestamp":1638217069000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/4317617"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"references-count":116,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/comst.2007.4317617","relation":{},"ISSN":["1553-877X"],"issn-type":[{"value":"1553-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}