Table of Contents

Optical Network Design and Planning, 2nd Edition

By Jane M. Simmons
Chapter 1
Introduction to Optical Networks
1.1
Brief Evolution of Optical Networks
1.2
Geographic Hierarchy of Optical Networks
1.3
Layered Architectural Model
1.4
Interfaces to the Optical Layer
1.4.1 SONET/SDH
1.4.2 Optical Transport Network (OTN)
1.5
Optical Control Plane
1.6
Terminology
1.7
Network Design and Network Planning
1.8
Research Trends in Optical Networking
1.9
Focus on Practical Optical Networks
1.10
Reference Networks
1.10.1 Traffic Models
1.11
References
Chapter 2
Optical Network Elements
2.1
Introduction
2.2
Basic Optical Components
2.3
Optical Terminal
2.3.1 Colorless Optical Terminal (Slot Flexibility)
2.4
Optical-Electrical-Optical (O-E-O) Architecture
2.4.1 O-E-O Architecture at Nodes of Degree-Two
2.4.2 O-E-O Architecture at Nodes of Degree-Three or Higher
2.4.3 Advantages of the O-E-O Architecture
2.4.4 Disadvantages of the O-E-O Architecture
2.5
Optical Bypass
2.5.1 Advantages of Optical Bypass
2.5.2 Disadvantages of Optical Bypass
2.6
OADMs/ROADMs
2.6.1 OADM Reconfigurability
2.7
Multi-Degree ROADMs
2.7.1 Optical Terminal to ROADM to ROADM-MD Upgrade Path
2.8
ROADM Architectures
2.8.1 Broadcast-and-Select Architecture
2.8.2 Route-and-Select Architecture
2.8.3 Wavelength-Selective Architecture
2.9
ROADM Properties
2.9.1 Cascadability
2.9.2 Automatic Power Equalization
2.9.3 Colorless
2.9.4 Directionless
2.9.5 Contentionless
2.9.6 Gridless
2.9.7 Wavelength vs. Waveband Granularity
2.9.8 Multicast
2.9.9 East/West Separability (Failure/Repair Modes)
2.9.10 Wavelength Reuse

Table of Contents

Optical Network Design and Planning, 2nd Edition, by Jane M. Simmons

2.10
Optical Switch Types
2.10.1 O-E-O Optical Switch
2.10.2 Photonic Switch
2.10.3 All-Optical Switch (ROADM)
2.10.4 Fiber Cross-Connect
2.10.5 Grooming Switch
2.11
Hierarchical or Multi-Granular Switches
2.12
Optical Reach
2.13
Integrating WDM Transceivers in the Client Layer
2.14
Packet-Optical Transport
2.15
Photonic Integrated Circuits
2.16
Multi-Fiber-Pair Systems
2.17
Exercises
2.18
References
Chapter 3
Routing Algorithms
3.1
Introduction
3.2
Shortest Path Algorithms
3.3
Routing Metrics
3.3.1 Minimum-Hop Path vs. Shortest-Distance Path
3.3.2 Shortest-Distance Path vs. Minimum-Regeneration Path
3.4
Generating a Set of Candidate Paths
3.4.1 K-Shortest Paths Strategy
3.4.2 Bottleneck-Avoidance Strategy
3.5
Routing Strategies
3.5.1 Fixed-Path Routing
3.5.2 Alternative-Path Routing
3.5.3 Dynamic-Path Routing
3.6
Capturing the Available Equipment in the Network Model
3.6.1 O-E-O Network
3.6.2 Optical-Bypass-Enabled Network
3.7
Diverse Routing for Protection
3.7.1 Shortest Pair of Disjoint Paths
3.7.2 Minimum-Regeneration Pair of Disjoint Paths
3.7.3 Shortest Pair of Disjoint Paths: Dual-Sources/Dual-Destinations
3.7.4 Shared Risk Link Groups (SRLGs)
3.7.5 Routing Strategies with Protected Demands
3.8
Routing Order
3.9
Flow-Based Routing Techniques
3.10
Multicast Routing
3.10.1 Minimum Spanning Tree with Enhancement
3.10.2 Minimum Paths
3.10.3 Regeneration in a Multicast Tree
3.10.4 Multicast Protection
3.10.5 Manycast
3.11
Multipath Routing
3.11.1 Non-Disjoint Multipath Routing
3.11.2 Disjoint Multipath Routing
3.12
Exercises
3.13
References
Chapter 4
Regeneration
4.1
Introduction

Table of Contents

Optical Network Design and Planning, 2nd Edition, by Jane M. Simmons

4.2
Factors That Affect Regeneration
4.2.1 Optical Impairments
4.2.2 Network Element Effects
4.2.3 Transmission System Design
4.2.4 Fiber Plant Specifications
4.2.5 Mitigation of Optical Impairments
4.2.6 Mixed Line-Rate Systems
4.2.7 System Regeneration Rules
4.3
Routing with Noise Figure as the Link Metric
4.3.1 Network Element Noise Figure
4.3.2 Impact of the ROADM without Wavelength Reuse
4.3.3 Cohesive System Design
4.4
Impairment-Based Routing Metrics Other Than Noise Figure
4.5
Link Engineering
4.6
Regeneration Strategies
4.6.1 Islands of Transparency
4.6.2 Designated Regeneration Sites
4.6.3 Selective Regeneration
4.7
Regeneration Architectures
4.7.1 Back-to-Back WDM Transponders
4.7.2 Regenerator Cards
4.7.3 All-Optical Regeneration
4.8
Exercises
4.9
References
Chapter 5
Wavelength Assignment
5.1
Introduction
5.2
Role of Regeneration in Wavelength Assignment
5.3
Multi-Step RWA
5.3.1 Alleviating Wavelength Contention
5.4
One-Step RWA
5.4.1 Topology Pruning
5.4.2 Reachability Graph Transformation
5.4.3 Flow-Based Methods
5.4.4 ILP-Based Ring RWA
5.5
Wavelength Assignment Strategies
5.5.1 First-Fit
5.5.2 Most-Used
5.5.3 Relative Capacity Loss
5.5.4 Qualitative Comparison
5.6
Subconnection Ordering
5.6.1 Graph Coloring
5.7
Bi-directional Wavelength Assignment
5.8
Wavelengths of Different Optical Reach
5.9
Nonlinear Impairments Due to Adjacent Wavelengths
5.9.1 Mixed Line-Rate Systems
5.10
Alien Wavelengths
5.10.1 Analog Services
5.11
Wavelength Contention and Network Efficiency
5.11.1 Backbone Network Study
5.11.2 Metro Network Study
5.11.3 Study Conclusions
5.12
Exercises
5.13
References
Table of Contents

Optical Network Design and Planning, 2nd Edition, by Jane M. Simmons

Chapter 6
Grooming
6.1
Introduction
6.2
End-to-End Multiplexing
6.3
Grooming
6.4
Grooming-Node Architecture
6.4.1 Grooming Switch at the Nodal Core
6.4.2 Grooming Switch at the Nodal Edge
6.4.3 Intermediate Grooming Layer
6.5
Selection of Grooming Sites
6.5.1 Hierarchical Grooming
6.6
Backhaul Strategies
6.7
Grooming Tradeoffs
6.7.1 Cost vs. Path Distance
6.7.2 Cost vs. Capacity
6.7.3 Cost vs. Protection Capacity
6.7.4 Grooming Design Guidelines
6.8
Grooming Strategies
6.8.1 Initial Bundling and Routing
6.8.2 Grooming Operations
6.9
Grooming Network Study
6.9.1 Grooming Switch at All Nodes
6.9.2 Grooming Switch at a Subset of the Nodes
6.10
Evolving Techniques for Addressing Power Consumption in the Grooming Layer
6.10.1 Routing and Grooming with Energy Considerations
6.10.2 Selective Randomized Load Balancing
6.10.3 Optical Flow Switching (OFS)
6.10.4 Optical Burst Switching (OBS)
6.10.5 TWIN
6.10.6 Lighttrail
6.10.7 Optical Packet Switching (OPS)
6.11
Exercises
6.12
References
Chapter 7
Optical Protection
7.1
Introduction
7.2
Dedicated vs. Shared Protection
7.2.1 Dedicated Protection
7.2.2 Shared Protection
7.2.3 Comparison of Dedicated and Shared Protection
7.3
Client-Side vs. Network-Side Protection
7.3.1 Transponder Protection
7.3.2 Wavelength Assignment with Network-Side Protection
7.4
Ring Protection vs. Mesh Protection
7.4.1 Ring Protection
7.4.2 Mesh Protection
7.5
Fault-Dependent vs. Fault-Independent Protection
7.5.1 Link Protection
7.5.2 Path Protection
7.5.3 Segment Protection
7.6
Multiple Concurrent Failures
7.6.1 Multiple Concurrent Failures Without Catastrophes
7.6.2 Multiple Concurrent Failures With Catastrophes
7.6.3 Protection Schemes for Multiple Concurrent Failures
7.6.4 Protection through Dynamic Networking
Table of Contents

Optical Network Design and Planning, 2nd Edition, by Jane M. Simmons

7.7
Effect of Optical Amplifier Transients on Protection
7.8
Shared Protection Based on Pre-deployed Subconnections
7.8.1 Cost vs. Spare Capacity Tradeoff
7.9
Shared Protection Based on Pre-cross-connected Bandwidth
7.9.1 p-Cycles
7.9.2 Pre-cross-connected Trails
7.10
Network Coding
7.11
Protection Planning Algorithms
7.11.1 Algorithms for Dedicated Protection
7.11.2 Algorithms for Shared Protection
7.12
Protection of Subrate Demands
7.12.1 Wavelength-Level (Optical-Layer) Protection
7.12.2 Subrate-Level (Grooming-Layer) Protection
7.12.3 Wavelength-Level vs. Subrate-Level Protection
7.12.4 Multilayer Protection
7.13
Fault Localization and Performance Monitoring
7.13.1 Monitoring Structures
7.13.2 Optical Performance Monitoring
7.14
Exercises
7.15
References
Chapter 8
Dynamic Optical Networking
8.1
Introduction
8.2
Motivation for Dynamic Optical Networking
8.2.1 Capacity Benefits of Dynamic Optical Networking
8.2.2 Applications Enabled by a Dynamic Optical Network
8.2.3 IP over a Dynamic Optical Layer
8.3
Centralized Path Computation and Resource Allocation
8.3.1 PCE-Based Operation
8.3.2 Advantages of Centralized Operation
8.3.3 Disadvantages of Centralized Operation
8.3.4 Multiple PCEs
8.4
Distributed Path Computation and Resource Allocation
8.4.1 GMPLS-Based Operation
8.4.2 Advantages of Decentralized Operation
8.4.3 Disadvantages of Decentralized Operation
8.4.4 Schemes to Minimize Contention
8.4.5 Subconnection as the Label
8.5
Combining Centralized and Distributed Path Computation and Resource Allocation
8.6
Dynamic Protected Connections
8.7
Physical-Layer Impairments and Regeneration in a Dynamic Environment
8.7.1 Regeneration in a PCE-Based Implementation
8.7.2 Regeneration in a GMPLS-Based Implementation
8.8
Multi-Domain Dynamic Networking
8.8.1 Backward-Recursive PCE-Based Computation (BRPC)
8.8.2 Hierarchical PCEs
8.8.3 Establishing Multi-Domain Connections
8.8.4 Protected Multi-Domain Connections
8.9
Pre-deployment of Equipment
8.10
Scheduled or Advance Reservation Traffic
8.11
Software-Defined Networking (SDN)
8.11.1 OpenFlow
8.12
Exercises
8.13
References
Table of Contents

Optical Network Design and Planning, 2nd Edition, by Jane M. Simmons

Chapter 9
Flexible Optical Networks
9.1
Introduction
9.2
Fiber Capacity Limits
9.2.1 Spectral Efficiency
9.2.2 Expanded Transmission Band
9.2.3 Multicore Fiber
9.2.4 Multimode Fiber
9.2.5 Architectural Approaches for Improved Capacity Utilization
9.3
Flexible-Grid Architectures
9.4
Gridless Architectures and Elastic Networks
9.4.1 Superchannels
9.4.2 Multipath Routing
9.4.3 Bandwidth Squeezing Restoration
9.5
Routing and Spectrum Assignment (RSA)
9.5.1 Routing
9.5.2 Spectrum Assignment
9.5.3 Spectral Elasticity
9.6
Spectral Defragmentation
9.7
Technologies for Flexible-Grid and Gridless Networks
9.7.1 Gridless ROADMs
9.7.2 Flexible Transmission for Gridless Networks
9.7.3 Virtual Transponders
9.8
Flexible-Grid vs. Gridless Architectures
9.9
Programmable (or Adaptable) Transponders
9.9.1 Data-Rate vs. Optical Reach
9.9.2 Bandwidth vs. Optical Reach
9.9.3 Utility of Programmable Transponders
9.10
Exercises
9.11
References
Chapter 10 Economic Studies
10.1
Introduction
10.2
Assumptions
10.2.1 Reference Network Topology
10.2.2 Reference Traffic Set
10.2.3 Cost Assumptions
10.3
Prove-In Point for Optical-Bypass Technology
10.3.1 Comments on Comparing Costs
10.3.2 O-E-O Technology with Extended Optical Reach
10.4
Optimal Optical Reach
10.4.1 Add/Drop Percentage as a Function of Optical Reach
10.5
Optimal Topology from a Cost Perspective
10.6
Gridless vs. Conventional Architecture
10.6.1 Conventional Grooming-Based Architecture
10.6.2 Gridless Architecture
10.6.3 Hybrid Gridless/Grooming Architecture
10.6.4 Discussion
10.7
Optical Grooming in Edge Networks
10.8
General Conclusions
10.9
References
Chapter 11 C-Code for Routing Routines
11.1
Introduction
11.2
Definitions
Table of Contents

Optical Network Design and Planning, 2nd Edition, by Jane M. Simmons

11.3
Breadth First Search Shortest Paths
11.4
K-Shortest Paths
11.5
N-Shortest Diverse Paths
11.6
Minimum Steiner Tree
11.6.1 Minimum Spanning Tree with Enhancement
11.6.2 Minimum Paths
11.7
References
Appendix: Suggestions for RFI/RFP Network Design Exercises

Table of Contents

Optical Network Design and Planning, 2nd Edition, by Jane M. Simmons