## Protection Cycles in Mesh WDM Networks (2000)

Venue: | IEEE Journal on Selected Areas in Communications |

Citations: | 39 - 0 self |

### BibTeX

@ARTICLE{Ellinas00protectioncycles,

author = {Georgios Ellinas and Aklilu Gebreyesus Hailemariam and Thomas E. Stern and Life Fellow},

title = {Protection Cycles in Mesh WDM Networks},

journal = {IEEE Journal on Selected Areas in Communications},

year = {2000},

volume = {18},

pages = {1924--1937}

}

### Years of Citing Articles

### OpenURL

### Abstract

A fault recovery system that is fast and reliable is essential to today's networks, as it can be used to minimize the impact of the fault on the operation of the network and the services it provides. This paper proposes a methodology for performing automatic protection switching (APS) in optical networks with arbitrary mesh topologies in order to protect the network from fiber link failures. All fiber links interconnecting the optical switches are assumed to be bidirectional. In the scenario considered, the layout of the protection fibers and the setup of the protection switches is implemented in nonreal time, during the setup of the network. When a fiber link fails, the connections that use that link are automatically restored and their signals are routed to their original destination using the protection fibers and protection switches. The protection process proposed is fast, distributed, and autonomous. It restores the network in real time, without relying on a central manager or a centralized database. It is also independent of the topology and the connection state of the network at the time of the failure.

### Citations

337 | Graph algorithms - Even - 1979 |

253 |
Algorithmic Graph Theory
- Gibbons
- 1985
(Show Context)
Citation Context ... cycles with the characteristics defined in Proposition 1. Fig. 4 shows the flowchart of the PTFT algorithm [15]. The PTFT algorithm developed is a variation of the path addition algorithm by Gibbons =-=[13]-=-, which is itself a variation of the Demoucron, Malgrange, and Pertuiset path addition algorithm [11]. It is a constructive algorithm that starts from a cycle and adds a single edge (SE) or one edge g... |

136 |
Computers and Intractability — A guide to NPcompleteness
- Garey, Johnson
- 1979
(Show Context)
Citation Context ... more general optimization problem known as the Chinese postman problem (CPP) [34] (to find the shortest closed walk such that each edge is traversed at least once), which was shown to be NP-complete =-=[35]-=-. In Section II-C, a single and cycle decomposition are found for a given Eulerian graph , and no attempt is made to find all the possible ’s and corresponding cycle decompositions. However, an upper ... |

104 |
Cederbaum I. An algorithm for planarity testing of graphs
- Lempel, Even
- 1967
(Show Context)
Citation Context ...ts embedding in the plane [Fig. 3(b)] is not obvious. The algorithm should provide sufficient information for this embedding to be constructed. Given a graph , planarity testing algorithms exist [11]–=-=[14]-=- that test whether graph is planar. A new algorithm has been developed for this work that tests if a graph is planar and, if it is, the algorithm embeds the planar graph in the plane and traces the fa... |

79 |
Edge-Colouring of Graphs
- Fiorini, Wilson
- 1977
(Show Context)
Citation Context ...this work, obtains an Eulerian circuit of graph and traverses that , peeling off one cycle after another by deleting certain segments of such that the remainder of forms an Eulerian circuit for graph =-=[25]-=-. Fig. 11 shows an example of the algorithm for the -cage graph. The algorithm recognizes that the graph is Eulerian, it finds one of the possible Eulerian circuits, and using that , it performs a cyc... |

72 | Graphs and Digraphs - CHARTRAND, LESNIAK - 1986 |

32 |
Automatic Protection Switching for Link Failures
- Ellinas, Stern
- 1996
(Show Context)
Citation Context ...lure of a bridge. 3 The protection methodology proposed is based on interconnecting the protection fibers to create a family of directed cycles, called protection cycles, in the following manner [4], =-=[7]-=-. Proposition 1: Recovery from a single link failure in any optical network with arbitrary mesh topology and bidirectional working and protection fiber links can be achieved using APS, if a family of ... |

12 |
Double cycle covers and the Petersen graph
- Catlin
- 1989
(Show Context)
Citation Context ...e was shown to be true for -edge connected graphs by a theorem of Jaeger [18], for graphs with Hamiltonian Paths [19], for 2-connected 3-regular graphs containing no subdivision of the Petersen graph =-=[20]-=- and for cubic graphs edge colorable with 3 colors [20]. While the cycle double cover conjecture has never been proven for arbitrary graphs, it was shown in [17] that a minimum counterexample 4 must b... |

8 |
SELFHEALING NETWORKS: A Distributed Algorithm for k-shortest link-disjoint paths in a multi-graph with applications in real time network restoration
- Grover
- 1989
(Show Context)
Citation Context ...ion failures is the accidental disruption of buried telecommunication cables. Fiber cuts may result, among other reasons, from construction work (“backhoe fade”), rodent damage, fires, or human error =-=[1]-=-. Clearly, the need for fast and reliable protection of services is essential in high capacity optical systems. This paper proposes a general methodology for performing link failure1 protection in opt... |

6 |
Cycles in wavelength routed optical networks
- Bala, Brackett
- 1996
(Show Context)
Citation Context ... due in large part to spontaneous emission (ASE noise). 10 This ASE noise can circulate in the closed loop, reaching significant levels, and ultimately leading to amplifier oscillation and saturation =-=[29]-=-. After protection switching is engaged because of a failure, there will be a transition period (time for the ASE noise to exit the network as well as time for the amplifier gains at the signal wavele... |

5 |
den Broeck, Pan-European Optical Networking using Wavelength Division Multiplexing
- Berger, Chbat, et al.
- 1997
(Show Context)
Citation Context ...der of milliseconds. 2 Within this time frame, the network can recover from a cable failure without interrupting the services transported over the network, e.g., telephone calls, data transfers, etc. =-=[6]-=-. The networks considered in this paper are composed of optical links and optical switches. Under normal operation, the network supports a number of active source–destination connections, whose paths ... |

5 |
Techniques for finding ring covers in survivable networks
- Gardner, Heydari, et al.
- 1994
(Show Context)
Citation Context ...c link protection requiring exactly one protection fiber for each edge of the network (independent of the network topology). This is a different approach from the cycle cover methodology presented in =-=[8]-=-, where a set of cycles that covers all edges was obtained, and that set of cycles was used as protection cycles. That approach usually requires more protection fibers than network edges. The only cas... |

5 |
Semi-duality and the cycle double cover conjecture
- Tarsi
- 1986
(Show Context)
Citation Context ...here the validity of the CDC conjecture has been proven. For example, the CDC conjecture was shown to be true for -edge connected graphs by a theorem of Jaeger [18], for graphs with Hamiltonian Paths =-=[19]-=-, for 2-connected 3-regular graphs containing no subdivision of the Petersen graph [20] and for cubic graphs edge colorable with 3 colors [20]. While the cycle double cover conjecture has never been p... |

4 |
Eulerian Graphs and Related Topics, part
- Fleischner
- 1990
(Show Context)
Citation Context ...s. Fig. 2. Directed cycles in the u graph. a vertex) [9]. The resultant embedded graph is called a plane graph. Any connected planar graph, embedded in a plane, with vertices ( ) and edges, has faces =-=[10]-=- (regions defined by the plane graph) where is denoted as Euler’s number. The number of faces includes inner faces and one outer face (the unbounded region). The protection cycles are then a set of fa... |

3 |
Fault Restoration in Optical Networks: General Methodology and Implementation
- Ellinas
- 1998
(Show Context)
Citation Context ...constitute a different problem with its own set of solutions. A summary of the approach taken when a switch fails can be found in [2] and [3]. For a more extensive analysis, the reader should turn to =-=[4]-=-. In networks using APS as their protection mechanism, failures are circumvented by re-routing signals from working channels to protection channels, using protection switches at the ends of each netwo... |

3 | Elimination of all-optical cycles in wavelength routed optical networks
- Iness, Ramamurthy, et al.
- 1996
(Show Context)
Citation Context ...e amplification loops. These include frogging algorithms based on Euler network design, dilation of the cross-connect switches, twosided network design, and the installation of circuit breakers [29], =-=[30]-=-. 1) Examples of the Protection Process: Fig. 15 shows a seven-node planar network with a bidirectional connection from to . The protection ports at different protection switches are interconnected in... |

2 |
Fault-tolerance of dynamic-full-access interconnection networks
- Shen, Hayes
- 1984
(Show Context)
Citation Context ...erent Eulerian circuits. The problem of finding all the Eulerian circuits of an arbitrary Eulerian graph is related to the more general optimization problem known as the Chinese postman problem (CPP) =-=[34]-=- (to find the shortest closed walk such that each edge is traversed at least once), which was shown to be NP-complete [35]. In Section II-C, a single and cycle decomposition are found for a given Eule... |

1 |
Protection of a priority connection from an optical switch failure in mesh networks with planar topologies
- Ellinas, Hailemariam, et al.
- 1999
(Show Context)
Citation Context ...uld note that switch failures are not discussed in this paper as they constitute a different problem with its own set of solutions. A summary of the approach taken when a switch fails can be found in =-=[2]-=- and [3]. For a more extensive analysis, the reader should turn to [4]. In networks using APS as their protection mechanism, failures are circumvented by re-routing signals from working channels to pr... |

1 |
switch failure protection in mesh networks with arbitrary nonplanar architectures
- “Optical
- 1999
(Show Context)
Citation Context ... that switch failures are not discussed in this paper as they constitute a different problem with its own set of solutions. A summary of the approach taken when a switch fails can be found in [2] and =-=[3]-=-. For a more extensive analysis, the reader should turn to [4]. In networks using APS as their protection mechanism, failures are circumvented by re-routing signals from working channels to protection... |

1 |
Transport systems: Generic requirements
- Res, NJ
- 1993
(Show Context)
Citation Context ...6(00)09014-4. 1 A fiber link failure denotes a failure of all working and protection fibers (both directions) on that link. 0733–8716/00$10.00 © 2000 IEEE to switch to the protection fiber are chosen =-=[5]-=-. Generally, the time it takes to detect the failure and switch to the protection fiber is on the order of milliseconds. 2 Within this time frame, the network can recover from a cable failure without ... |

1 |
Graph theory—A development from the 4-color problem
- Aigner
- 1986
(Show Context)
Citation Context ...in such a way that no two edges intersect (have a common point other than 3 In the rest of the paper, link failure recovery excludes bridge failures. Fig. 2. Directed cycles in the u graph. a vertex) =-=[9]-=-. The resultant embedded graph is called a plane graph. Any connected planar graph, embedded in a plane, with vertices ( ) and edges, has faces [10] (regions defined by the plane graph) where is denot... |

1 |
Graphes planaires,” Revue Francaise de
- Demoucron, Malgrange, et al.
- 1964
(Show Context)
Citation Context ...but its embedding in the plane [Fig. 3(b)] is not obvious. The algorithm should provide sufficient information for this embedding to be constructed. Given a graph , planarity testing algorithms exist =-=[11]-=-–[14] that test whether graph is planar. A new algorithm has been developed for this work that tests if a graph is planar and, if it is, the algorithm embeds the planar graph in the plane and traces t... |

1 |
Planarity testing of a graph—Creation and traversal of faces
- Ellinas, Hailemariam, et al.
- 1997
(Show Context)
Citation Context ... graph in the plane and traces the faces in the appropriate directions to create a family of cycles with the characteristics defined in Proposition 1. Fig. 4 shows the flowchart of the PTFT algorithm =-=[15]-=-. The PTFT algorithm developed is a variation of the path addition algorithm by Gibbons [13], which is itself a variation of the Demoucron, Malgrange, and Pertuiset path addition algorithm [11]. It is... |

1 |
Cycles in Graphs
- Jaeger
- 1985
(Show Context)
Citation Context ... with a nonplanar topology, a cycle double cover of the graph has to be found. A cycle double cover of a graph is defined as a cycle decomposition of such that each edge appears in exactly two cycles =-=[17]-=-. Thus, the set of protection cycles being sought comprise cycle double covers with some additional properties concerning their directions. A crucial conjecture concerning this problem is the followin... |

1 |
and generalized coloring theorems in graphs
- “Flows
- 1979
(Show Context)
Citation Context ...nplanar graph. There are limited cases where the validity of the CDC conjecture has been proven. For example, the CDC conjecture was shown to be true for -edge connected graphs by a theorem of Jaeger =-=[18]-=-, for graphs with Hamiltonian Paths [19], for 2-connected 3-regular graphs containing no subdivision of the Petersen graph [20] and for cubic graphs edge colorable with 3 colors [20]. While the cycle ... |

1 |
On conjectures relating to snarks
- Celmins
- 1987
(Show Context)
Citation Context ...with 3 colors [20]. While the cycle double cover conjecture has never been proven for arbitrary graphs, it was shown in [17] that a minimum counterexample 4 must be a snark. 5 Furthermore, Celmins in =-=[21]-=- showed that the minimum counterexample to the CDC conjecture must be a strong snark. 6 Finally, it was further proven that a minimum counterexample to the cycle double cover conjecture has girth at l... |

1 |
Combinatorics 79
- Jaeger, Swart
- 1980
(Show Context)
Citation Context ... seven [17]. Thus, the minimum counterexample to the CDC conjecture has to be a strong snark of girth at least seven. But, no snark of girth at least seven is known to exist and it was conjectured in =-=[22]-=- that such snarks do not exist (conjectured that every snark has girth at most 6). Two classes of snarks are shown in Fig. 7. Both examples have girth 5. Obviously, snarks are graphs with unique topol... |

1 |
Creation of a family of cycles corresponding to the orientable cycle double cover
- Ellinas, Hailemariam, et al.
- 1997
(Show Context)
Citation Context ...rk can also be adopted to ensure that this never happens. 1) An OCDC Heuristic: A new heuristic algorithm has been developed in this work to obtain an orientable cycle double cover of any given graph =-=[23]-=-. The heuristic algorithm will also work for graphs with bridges. Obviously, in these graphs the bridges will be traced twice in a single cycle. Fig. 8 shows the flowchart of the orientable cycle doub... |

1 |
Protection cycles in mesh networks with Eulerian graphs
- Ellinas, Rong, et al.
- 1998
(Show Context)
Citation Context ... graph , tests to determine whether graph is Eulerian, and if it is indeed Eulerian, the algorithm determines an Eulerian circuit ( ) and a cycle decomposition (set of cycles ) for the Eulerian graph =-=[24]-=-. The algorithm used in this work, obtains an Eulerian circuit of graph and traverses that , peeling off one cycle after another by deleting certain segments of such that the remainder of forms an Eul... |

1 |
Automatic protection switching for SONET
- Res, NJ
- 1990
(Show Context)
Citation Context ...ASW): This command automatically switches from protection to working fiber. 9 These commands are similar to the APS switching commands used in point-to-point and self-healing ring (SHR) SONET systems =-=[26]-=-, [27]. Fig. 12. Protection switch settings before and after a link failure. Manual Switch to Protection (MSP): This command manually switches from working to protection fiber. Manual Switch to Workin... |

1 |
Synchronous optical network (SONET) transport sytems: Common generic criteria
- Res, NJ
- 1991
(Show Context)
Citation Context ...This command automatically switches from protection to working fiber. 9 These commands are similar to the APS switching commands used in point-to-point and self-healing ring (SHR) SONET systems [26], =-=[27]-=-. Fig. 12. Protection switch settings before and after a link failure. Manual Switch to Protection (MSP): This command manually switches from working to protection fiber. Manual Switch to Working (MSW... |

1 |
Quo Vadis, Graph Theory
- Zhang
- 1993
(Show Context)
Citation Context ...wing conjectures provide a bound on the number of cycles , and thus a bound on the number of possible link failures that can be simultaneously restored. The short cycle double cover (SCDC) conjecture =-=[31]-=- states that every 2-edge connected simple graph of order has a CDC with fewer than cycles (holds for all maximal and Hamiltonian planar graphs). Thus, the maximum number of link failures that can be ... |

1 |
Cycles and Rays
- Bondy
- 1990
(Show Context)
Citation Context ...rotect all the unidirectional connections passing through at most 6 simultaneous link failures. For specific graphs, i.e., cubic graphs, the upper bound shown in (3) becomes even more tight. Bondy in =-=[32]-=- conjectured that if is a 2-connected simple cubic graph of vertices ( ), then admits a CDC consisting of at most cycles. This conjecture is sharp. The Petersen graph, for example, cannot be covered w... |

1 |
Graph Theory and Combinatorics
- Vergnas
- 1979
(Show Context)
Citation Context ... of cycles partitioning the edge set of an Eulerian graph embedded in the plane is equal to the maximum number of cycles of an Eulerian partition without crossings and is equal to the number of faces =-=[33]-=-. Thus, planar Eulerian graphs are not considered here as they will give results identical to Section IV-A. Only bounds for nonplanar Eulerian graphs are considered. Eulerian topologies can be decompo... |