Index
K-shortest path algorithm, 183
N-stage island, 49
(1 + 1) protection, 31
(1 : 1) protection, 32
(M : N) protection, 32
(Type, Length, Value) triplets, 174
p-Cycles, 34, 38
2-fiber BLSR (2F-BLSR), 33
3-SAT Boolean expression, 120
3-SAT problem, 120
4-fiber BLSR (4F-BLSR), 33
Abstraction of network topology, 107
Active reprovisioning, 149, 158
Additive constraints, 127
Agreggation function, 15
Analytical estimates, 217
Association graph, 96
AuroraTM optical cross-connect, 196
Automatic Protection Switching (APS), 28, 31
Availability, 26, 221, 222, 223
Available link bandwidth, 108
Average backup path length, 203
Average path length, 202
Backup path, 29
Backup path latency, 82
Backup reoptimization algorithm, 182
Backup segments, 66
Bellman-Ford algorithm, 108
Best-effort path diversity, 132
Bidirectional Line Switched Ring (BLSR), 32
Bit Error Rate (BER), 1
Bit-rate, 82
BLSR architectures, 33
Branch-and-cut algorithm, 191
Bridgeless graphs, 34
Bypass link, 149
Capping, 153
Carrier requirements, 6
Centralized online route-provisioning algorithm, 73
Centralized provisioning, 73
Centralized route computation, 165
Centralized routing implementation, 125
Centralized routing problem, 73
Channel protection, 28, 226
Channel reoptimization, 173
Channel selection, 81
Circuit-pack diversity, 72, 94
Circuit-pack diversity constraint, 98
Circuit-pack diversity routing algorithms, 94
Classification of recovery schemes, 29
Clique, 96
Clique enumeration, 96
Compatible shared backup paths, 171
Complete reoptimization, 184
Complete reoptimization algorithm, 182
Components in parallel, 224
Components in series, 224
Conditions for sharing, 141
Conflict graph, 96
Conflicting paths, 89
Conflicting shared backup paths, 171
Constrained routing heuristic framework, 135
Constrained shortest-path routing, 126, 139
Constraint-based Routing Label Distribution Protocol (CR-LDP), 14
Constructs on optimality of online routing and reoptimization, 186, 189
Controlling channel sharing, 154
Cost function for backup path computation, 133
Cost of an SBPP service, 116, 133
Cost of the underlying fiber links, 151
Cost setting for an express link, 151
Cost, 82
Crankbacks, 76
Critical node-disjoint, 89
Cycle Double Cover (CDC), 34, 36
Cycle Double Cover conjecture, 36
Data Communication Network (DCN), 58
DBPP, 43, 67
DBPP architecture, 44
Dedicated Backup Path Protection (DBPP), 29, 84
Degradable lightpaths, 94
Degraded protection guarantee, 94
Degree of survivability, 26
Delay constraint, 127
Dense Wavelength Division Multiplexed (DWDM), 2
Deterministic algorithm, 171
Deterministic approach, 166, 167, 170
Digital Cross-Connect Systems (DCSs), 16, 27
Dijkstra’s algorithm, 108
Disjoint paths, 44
Distributed control plane, 125
Distributed online route-provisioning algorithm, 76
Distributed path computation, 173
Distributed provisioning, 75
Distributed routing, 75
Distributed routing implementation, 125
Distributed techniques, 52
Diverse pair of routes, 113
Diverse routing algorithms, 113
Diverse routing problem, 112
Diverse-path routing, 112
Double failures, 156
Double link failures, 156
Dual-homing, 90
Dynegy network, 196
Edge connectivity, 113
Edge-disjoint path, 85
Edge-diverse routes, 113
Effect of α, 146
Effect of ε, 144
Equipment failures, 25
Escalation strategies, 56
Estimated probability, 169, 175
Eulerian, 37
Express link, 149
Express traffic, 150
Extent of the shareability, 45
Failure dependent strategy, 164, 166
Failure detection and notification time, 218
Failure In Time (FIT), 223
Failure In Time (FIT) rate, 160
Failure Independent Path Protecting (FIPP) p-cycles, 41
Failure independent strategy, 164, 167
Failure rate, 223
Failure recovery, 25
Failure recovery time, 64
Failure-dependent strategy, 86
Failure-independent channel assignment, 87
Failure-independent strategy, 86
Failures, 25
Fault management, 25
Fault recovery techniques, 27
Feasible SRG-diverse route, 114
Fiber cuts, 25, 223
First-fit policy, 170
First-fit backup channel assignment, 178
FIT, see Failure In Time, 223
Five nines, 224
Flow p-cycles, 41
Fundamental cycles, 34
Generalized loopback, 34, 43
Generalized MPLS (GMPLS), 13
Girth, 37
Glass-through links, 149
Grooming function, 15
Growing network infrastructure, 192
Hairpinning, 19
Hamiltonian circuit, 191
Heuristic for routing preemptible services, 134
Heuristic for routing SBPP services, 133
Heuristics for SRG-diverse routing, 131
Hierarchical architecture, 21
ILP formulations for path routing, 117
In-band signaling, 58
Inclusion/Exclusion constraints, 127
Incompatible lightpaths, 87
Island Protection Protocol, 50
Island-based protection, 48, 67
K link diverse paths, 113
K-shortest path algorithm, 135
K-shortest path problem, 128
K-shortest paths, 110
Layered architecture, 12
Length of a path, 182
Level of disjointness, 45
Limiting sharing, 149
Link attributes, 107
Link bundle, 174
Link cost function, 128
Link diverse routing problem, 112
Link Management Protocol (LMP), 13
Link TLV, 174
Link p-cycles, 39
Link-based protection, 46, 63
Link-based protection techniques, 46
Link-by-link network evolution, 6
Link-diverse path routing, 85
Link-SRG-disjoint, 84, 87
Link-state dissemination protocols, 166
Load balancing, 154
Local backup channel optimization, 178
Logical failure, 54
Logical layer, 12
Long-haul networks, 21
Markov models, 225
Max fit policy, 170
Maximum sharing, 143
Mean Time Between Failures (MTBF), 223
Mean Time To Failure (MTTF), 223
Mean Time To Repair (MTTR), 161, 223
Micro-Electro-Mechanical Systems (MEMS), 8
Min/max constraints, 127, 129
Minimal Island, 49
Minimum cost backup path, 165
Mixed two-tier architecture, 18
Monte-Carlo method, 175
Moore bound, 201
MPLS recovery, 56
MTBF, see Mean Time Between Failures, 223
MTTF, see Mean Time To Failure, 223
MTTR, see Mean Time To Repair, 223
Multi-layer recovery, 53
Multi-port card, 94
Multi-Service Provisioning Platforms (MSPPs), 14
Multi-tier network architecture, 18
Multi-vendor interoperability, 6
Multiple failure scenarios, 173
Multiple failures, 221
Multiple recovery domain, 228
Multiplexed Section Shared Protected Ring (MS-SPRING), 32
Mutually compatible lightpaths, 87
Neighbor Discovery Protocol (NDP), 13
NetGEM, 214
Network fault, 26
Network Global Expectation Model, 214
Network maintainance activity, 149
Network Management System, 125
Network quantities, 211
Network reoptimization, 92
Node diversity, 88, 112
Node failure, 85, 88
Node failure resilient networks, 70
Node model, 211
Node-and-SRG diverse, 112
Node-disjoint path, 85
Node-disjoint routes, 114
Node-diverse paths, 70, 113
Node-encircling p-cycles, 39, 41
Node-inclusion constraint, 127
Non-planar topologies, 36
Non-recoverable connections, 27
Nondegradable lightpaths, 94
Number of backup path hops, 155
OEO switches, 81
Offline reoptimization, 76
Offline reoptimization algorithms, 119
Offline routing, 108
One-edge connected, 27
One-tier network architecture, 16
Online routing, 95, 108
Online routing algorithm, 186
Online routing heuristics, 119
Online routing problem, 165
Opaque LSA, 174
Opaque network architecture, 3, 8, 81
Open Shortest Path First (OSPF), 13
Optical cross-connects (OXCs), 2
Optical layer, 13
Optimized channel reassignment, 172
Optimum routing, 191
Out-of-band signaling, 58
Overhead visibility, 6
Overlay approach, 53
Parameter α, 142
Parameter ε, 140, 183
Path diversity, 83
Path enumeration, 128
Path protection, 226
Path segment-protecting p-cycles, 41
Path-based protection, 63
Path-based protection/restoration, 29
Peer-to-peer approach, 53
Physical impairments, 6
Planar graphs, 36
Point-to-point architectures, 28
Preassigned channels, 61
Precomputed protection, 64
Precomputed routes, 61
Preemptible lightpaths, 90
Preemptible service, 134
Primary path latency, 82
Primary paths, 29
Probabilistic approach, 165, 170
Probabilistic routing algorithm, 171, 172
Protected Working Capacity Envelope (PWCE), 45
Protection, 27, 28, 81
Protection attributes, 108
Protection facilities, 28
Protection guarantee, 92
Protection switching time, 99
Quality-of-Service classes, 108
Ratio of protection to working capacity, 200, 204
Re-timing, 6
Real-time restoration, 64
Reconfigurable Add Drop Multiplexers (ROADMs), 10
Reconfiguration, 181
Recovery, 217, 221
Recovery architecture, 218
Recovery signaling time, 218
Recovery taxonomy, 61
Recovery time, 99
Recovery time, 83
Regeneration, 6
Relaxed protection guarantees, 94
Reliability, 222, 223
Reoptimization, 181
Reoptimization algorithm, 184
Reoptimization of backup paths, 184
Repair rate, 223
Reprovisioning, 226
Resiliency, 82
Resource Reservation Protocol (RSVP), 14
Resource sharing information, 174
Restoration, 28, 65
Restoration techniques, 52
Revertive mode, 45
Ring cover, 34
Ring cover length, 34
Ring-based protection, 28, 34
Route computation, 125
Route computation module, 125
Route computation problem, 82
Route selection, 81
Router Address TLV, 174
Routing and channel assignment, 96
Routing graph, 126
Routing graph transformation, 114
Routing metric, 140
Routing with express links, 149
Rules of sharing, 89, 117
SBPP, 44, 67
SBPP routing problem, 121
SBPP service, 116, 133
Secondary path, 29
Segment Shared Protection (SPP), 47
Segment-based protection, 65
Segment-based protection/restoration, 29
Self-Healing Network (SHN), 52
Self-Healing Ring, 32
Self-Healing Ring (SHR) architectures, 28
Service availability, 221
Service availability, 82
Service layer, 13
Service Level Agreement (SLA), 9, 26
Service resilience, 82
Set cover problem, 96
Shareability of protection channels, 163
Shareable reserved channels, 165
Shared Backup Path Protection (SBPP), 27, 29, 86
Shared equipment risk group, 94
Shared Protected Ring (SPRING), 32
Shared Risk Group (SRG), 44, 68
Sharing analysis, 205
Sharing distribution, 157
Sharing limit, 154
Short Leap Shared Protection (SLSP), 47
Shortest path island, 49
Shortest-path routing, 108, 127
Shortest-path routing with constraints, 111
Signaling mechanisms, 56
Single recovery domain, 228
Snark, 37
Span-based protection, 46, 47
Span-based protection/restoration, 28
Spanning tree, 35
SRG autodiscovery, 68
SRG failure resilient networks, 70
SRG-and-node disjoint routes, 70
SRG-diverse paths, 70
SRG-diverse routes, 84, 114
SRG-diverse routing, 120, 127
SRG-diversity, 112
Static network infrastructure, 192
Strong snark, 37
Stub release, 86
Subnetwork Connection Protection (SNCP), 32
Survivable, 26
Synchronous Optical NETwork (SONET), 8, 30
Tellium, 218
Topology manager, 125
Topology modeling, 126
Traffic conservation equations, 211
Traffic Engineering (TE) link, 174
Traffic Engineering LSA, 174
Translucent network architecture, 11
Transoceanic network, 231
Transparent network, 4
Transparent node architecture, 4
Transparent switch architecture, 9
Trap topologies, 131
Triggers, 57
Types of SRGs, 68, 112
Ultra-long-haul networks, 21
Unavailability, 224
Unidirectional Path Protected Ring (UPPR), 32
Unidirectional Path Switched Ring (UPSR), 32
Unprotected lightpaths, 90
UPSR architectures, 33
User Network Interface (UNI), 14
Vertex coloring problem, 172
Vertex connectivity, 113
Vertex splitting transformation, 113
Wavelength conversion, 5
Wavelength Division Multiplexed (WDM), 1
Wavelength services, 3
Wavelength-selective cross-connects (WSXCs), 11
Working facilities, 28
Working paths, 29
Working segments, 66
Yen’s algorithm, 129