| Preface | p. xi |
| Introduction | p. 1 |
| The Optical Internet has come of age | p. 1 |
| Evolution of the IP Networks | p. 2 |
| Design Objectives of Optical Networks | p. 4 |
| Survivability | p. 4 |
| Scalability | p. 5 |
| Class of Service | p. 6 |
| Capacity-Efficiency | p. 8 |
| Summary | p. 9 |
| Control and management architecture | p. 11 |
| Multi-Protocol Label Switching (MPLS) | p. 11 |
| Establishment of Label Switched Paths (LSPs) | p. 12 |
| Packet Forwarding and Label Swapping | p. 13 |
| Summary of the MPLS-based Control Plane | p. 15 |
| Migration from the Electronic Domain to the Optical Domain | p. 16 |
| Analogies between Control Planes for LSRs and OXCs | p. 18 |
| Heterogeneity between the Control Planes upon LSRs and OXCs | p. 18 |
| Optical Extensions to the Routing and Signaling Protocols | p. 19 |
| Extension to the OSPF-TE | p. 20 |
| Extension to the RSVP-TE | p. 21 |
| Generalized MPLS Architecture | p. 22 |
| Traffic Hierarchy Defined in Generalized MPLS | p. 22 |
| Functional Architecture of MG-OXCs | p. 23 |
| Switch Descriptions | p. 24 |
| Routing and Signaling Models | p. 27 |
| Service Models | p. 27 |
| Domain Services Model | p. 27 |
| Unified Services Model | p. 29 |
| Routing Models | p. 30 |
| Summary | p. 31 |
| References | p. 31 |
| Questions | p. 32 |
| Routing and Wavelength Assignment (RWA): Overview | p. 35 |
| Introduction | p. 36 |
| Static RWA Process | p. 36 |
| Dynamic RWA Process | p. 37 |
| Constraints on Routing and Wavelength Assignment | p. 38 |
| Physical Constraints | p. 38 |
| Diversity Constraints | p. 39 |
| Wavelength Continuity Constraint | p. 40 |
| Network Modeling | p. 41 |
| Wavelength Graph with Extra Nodes | p. 42 |
| Simple WG with Modified Dijkstra's Algorithm | p. 46 |
| Shortest Path Algorithm with Wavelength Graph (SPAWG) | p. 49 |
| Dynamic Path Selection | p. 49 |
| Adaptive Routing | p. 50 |
| Dynamic Wavelength Assignment | p. 53 |
| Link-State Coherence | p. 55 |
| Static Routing and Wavelength Assignment | p. 57 |
| RWA by Integer Linear Programming | p. 58 |
| RWA with Heuristic Algorithms | p. 60 |
| Summary | p. 62 |
| References | p. 62 |
| Questions | p. 63 |
| Algorithms for Dynamic Routing and Wavelength Assignment | p. 65 |
| Network Planning Algorithms | p. 65 |
| Weighted Network Link-State | p. 67 |
| Planning for Fixed Alternate Routing | p. 75 |
| Assumptions in Network Environment Modeling | p. 77 |
| Optimization for Alternate Paths | p. 78 |
| Design of the Number of Alternate Paths | p. 79 |
| A Heuristic Algorithm | p. 86 |
| Verification of the Algorithm | p. 87 |
| Routing and Wavelength Assignment with Criticality Avoidance | p. 88 |
| MIRA | p. 89 |
| Asynchronous Criticality Avoidance (ACA) Protocol | p. 92 |
| Inter-Arrival Planning | p. 93 |
| RWA with Criticality Information | p. 95 |
| Simulation | p. 97 |
| Summary | p. 103 |
| References | p. 105 |
| Questions | p. 106 |
| Routing and Wavelength Assignment with Multigranularity Oxcs | p. 109 |
| Introduction | p. 109 |
| Dynamic Tunnel Allocation with Path Selection | p. 112 |
| Capacity-Balanced Static Tunnel Allocation | p. 114 |
| Simulation | p. 121 |
| Summary | p. 127 |
| References | p. 127 |
| Questions | p. 127 |
| Protection and restoration | p. 129 |
| Network Survivability | p. 129 |
| Survivability of Ring-based Non-WDM Networks | p. 133 |
| Automatic Protection Switching | p. 133 |
| SONET Self Healing Ring | p. 134 |
| Survivability in WDM Mesh Networks | p. 137 |
| A Spectrum of Protection Service | p. 138 |
| Shared Risk Link Group (SRLG) Constraint | p. 138 |
| Path-Based Shared Protection | p. 139 |
| Link-Based Shared Protection | p. 139 |
| SLSP Framework | p. 140 |
| Summary | p. 143 |
| References | p. 144 |
| Questions | p. 144 |
| Spare Capacity Allocation | p. 149 |
| Principles and Objectives of Spare Capacity Allocation | p. 150 |
| Span-Oriented Spare Capacity Allocation Schemes | p. 152 |
| Node Cover | p. 153 |
| Span Protection | p. 154 |
| Ring Cover | p. 156 |
| Pre-configured Cycle | p. 160 |
| Path-oriented Spare Capacity Allocation Schemes | p. 162 |
| Correlation of Working Paths | p. 163 |
| Basis of Path-oriented Spare Capacity Allocation | p. 168 |
| Relaxation of Integer Constraint | p. 170 |
| Local Search | p. 170 |
| Simulated Annealing | p. 171 |
| Successive Survivable Routing | p. 173 |
| Inter-Arrival Planning | p. 174 |
| Link-State Coherence | p. 175 |
| Correlation of Shared Risk Link Group | p. 176 |
| Rerouting of Protection Paths | p. 179 |
| Spare Capacity Re-allocation | p. 180 |
| SLSP with Spare Capacity Re-allocation | p. 182 |
| Introduction | p. 182 |
| Interleaving of the Working Paths | p. 185 |
| Optimization and Approximating Optimization | p. 189 |
| Integer Programming (InP) Formulation | p. 190 |
| Local Search | p. 190 |
| Successive Survivable Routing | p. 192 |
| Numerical Results | p. 193 |
| Design for the Size of Each Subset (Mw) | p. 194 |
| Performance Evaluation | p. 196 |
| Allocation of Protection Domains | p. 197 |
| Simulation Results | p. 199 |
| Summary | p. 203 |
| References | p. 205 |
| Questions | p. 206 |
| Survivable Routing with Dynamic Traffic | p. 211 |
| Survivable Routing | p. 212 |
| Solving the Asymmetrically Weighted Node-Disjoint Path-Pair Problem | p. 213 |
| Iterative Two-Step-Approach | p. 215 |
| Suurballe's Algorithm | p. 216 |
| Integer Linear Programming Formulation (ILP) | p. 217 |
| Linear Relaxation | p. 218 |
| Single Flow Relaxation | p. 219 |
| Linear Programming Relaxation (LPR) | p. 222 |
| Reparable Split | p. 222 |
| Unreparable Split | p. 223 |
| Diverse Routing for Shared Protection | p. 226 |
| Cost Functions | p. 226 |
| Derivation of Protection Paths | p. 228 |
| Dynamic Allocation of Protection Domains | p. 231 |
| Simulations | p. 236 |
| Assumptions | p. 236 |
| Simulation Results | p. 237 |
| Summary | p. 240 |
| References | p. 241 |
| Questions | p. 241 |
| Optical Burst Switching | p. 247 |
| Introduction to Switching Techniques | p. 248 |
| Reservation Schemes | p. 252 |
| Resource Reservation in Circuit-Switching and Packet-Switching Networks | p. 253 |
| Resource Reservation in Optical Burst Switching (OBS) | p. 256 |
| Just-In-Time (JIT) | p. 257 |
| Channel Scheduling in JIT OBS | p. 259 |
| Just-Enough-Time (JET) | p. 261 |
| QoS Support with JET OBS | p. 263 |
| Node Architecture | p. 267 |
| Summary | p. 271 |
| References | p. 274 |
| Questions | p. 275 |
| Loop-Less K-shortest Paths Algorithm in Directed Graphs | p. 279 |
| Introduction | p. 279 |
| Yen's Algorithm | p. 280 |
| References | p. 281 |
| Maximum-Flow Algorithm | p. 283 |
| Acronyms | p. 285 |
| Symbols | p. 289 |
| Glossary | p. 291 |
| Index | p. 297 |
| Table of Contents provided by Syndetics. All Rights Reserved. |
