| |
| |
| Preface | |
| |
| |
| Acknowledgments | |
| |
| |
| |
| Optical networking technology | |
| |
| |
| |
| Wavelength-division multiplexing | |
| |
| |
| |
| Broadcast-and-select networks | |
| |
| |
| |
| Wavelength-routed WDM networks | |
| |
| |
| |
| Wavelength conversion in WDM networks | |
| |
| |
| |
| Optical packet switching | |
| |
| |
| |
| Optical burst switching | |
| |
| |
| |
| The rest of the book | |
| |
| |
| |
| Design issues | |
| |
| |
| |
| Network design | |
| |
| |
| |
| Network model | |
| |
| |
| |
| Routing and wavelength assignment | |
| |
| |
| |
| Multi-fiber networks | |
| |
| |
| |
| Survivability | |
| |
| |
| |
| Restoration methods | |
| |
| |
| |
| Traffic grooming in WDM networks | |
| |
| |
| |
| Optical packet switching | |
| |
| |
| |
| Optical burst switching | |
| |
| |
| |
| Restoration approaches | |
| |
| |
| |
| Restoration model | |
| |
| |
| |
| Upgradeable network design | |
| |
| |
| |
| Notation | |
| |
| |
| |
| Cost model | |
| |
| |
| |
| Design problem | |
| |
| |
| |
| Heuristic approach for network design | |
| |
| |
| |
| Network upgrade | |
| |
| |
| |
| Methodology validation | |
| |
| |
| |
| p-cycle protection | |
| |
| |
| |
| Design of p-cycle restorable networks | |
| |
| |
| |
| Cycle selection algorithms | |
| |
| |
| |
| Joint optimization of p-cycle design | |
| |
| |
| |
| A p-cycle-based design for dynamic traffic | |
| |
| |
| |
| Algorithm for finding all cycles | |
| |
| |
| |
| Network operation | |
| |
| |
| |
| Capacity minimization | |
| |
| |
| |
| Revenue maximization | |
| |
| |
| |
| Capacity minimization: problem formulation | |
| |
| |
| |
| Revenue maximization: problem formulation | |
| |
| |
| |
| Solution methodology | |
| |
| |
| |
| Performance evaluation | |
| |
| |
| |
| Managing large networks | |
| |
| |
| |
| Online algorithm | |
| |
| |
| |
| Example | |
| |
| |
| |
| LP formulation | |
| |
| |
| |
| Solving for excess demands | |
| |
| |
| |
| Quality of the LP heuristic algorithm | |
| |
| |
| |
| ILP and LP solution run times | |
| |
| |
| |
| Run times for the LP heuristic algorithm | |
| |
| |
| |
| Subgraph-based protection strategy | |
| |
| |
| |
| Subgraph-based routing and fault tolerance model | |
| |
| |
| |
| Performance of subgraph-based routing | |
| |
| |
| |
| Performance results | |
| |
| |
| |
| Multi-link and other failures | |
| |
| |
| |
| Constrained subgraph routing | |
| |
| |
| |
| Example | |
| |
| |
| |
| Observations | |
| |
| |
| |
| Managing multiple link failures | |
| |
| |
| |
| Link-based protection for two link failures | |
| |
| |
| |
| Path-based protection | |
| |
| |
| |
| Formulating two link failures | |
| |
| |
| |
| Examples and comparison | |
| |
| |
| |
| Dual-link failure coverage of single-failure protection schemes | |
| |
| |
| |
| Dual-link failure coverage using shared-mesh protection | |
| |
| |
| |
| Dual-link failure coverage: subgraph routing | |
| |
| |
| |
| Coverage computation | |
| |
| |
| |
| Observations | |
| |
| |
| |
| Traffic grooming in WDM networks | |
| |
| |
| |
| Traffic grooming in WDM rings | |
| |
| |
| |
| Static traffic grooming in rings | |
| |
| |
| |
| Dynamic traffic grooming in WDM networks | |
| |
| |
| |
| Gains of traffic grooming | |
| |
| |
| |
| Network parameters | |
| |
| |
| |
| Modeling constrained grooming networks | |
| |
| |
| |
| Sparse grooming network | |
| |
| |
| |
| Validation of the model | |
| |
| |
| |
| Capacity fairness in grooming | |
| |
| |
| |
| Managing longer paths | |
| |
| |
| |
| Capacity fairness | |
| |
| |
| |
| Fairness performance of RWA algorithms | |
| |
| |
| |
| Connection admission control for fairness | |
| |
| |
| |
| Survivable traffic grooming | |
| |
| |
| |
| Traffic stream multiplexing on a single wavelength link | |
| |
| |
| |
| Grooming traffic streams on the network | |
| |
| |
| |
| Routing and wavelength assignment | |
| |
| |
| |
| Effect of traffic grooming | |
| |
| |
| |
| Static survivable grooming network design | |
| |
| |
| |
| Design problem | |
| |
| |
| |
| Example | |
| |
| |
| |
| Trunk-switched networks | |
| |
| |
| |
| Channels and trunks | |
| |
| |
| |
| Modeling a WDM grooming network as a TSN | |
| |
| |
| |
| Node architecture | |
| |
| |
| |
| Free and busy trunks | |
| |
| |
| |
| Connection establishment | |
| |
| |
| |
| Grooming network model | |
| |
| |
| |
| MICRON framework | |
| |
| |
| |
| A two-pass approach | |
| |
| |
| |
| Modeling a channel-space switch in MICRON | |
| |
| |
| |
| Blocking in TSN | |
| |
| |
| |
| Blocking model | |
| |
| |
| |
| Estimation of call arrival rates on a link | |
| |
| |
| |
| Path blocking performance | |
| |
| |
| |
| Free trunk distribution | |
| |
| |
| |
| Modeling switches | |
| |
| |
| |
| Heterogeneous switch architectures | |
| |
| |
| |
| Improving the accuracy of the analytical model | |
| |
| |
| |
| Validation of the TSN model | |
| |
| |
| |
| Simulation setup | |
| |
| |
| |
| Homogeneous networks performance | |
| |
| |
| |
| Heterogeneous networks performance | |
| |
| |
| |
| Observations | |
| |
| |
| |
| Performance of dynamic routing in WDM grooming networks | |
| |
| |
| |
| Information collection | |
| |
| |
| |
| Path-selection algorithms | |
| |
| |
| |
| An example | |
| |
| |
| |
| Performance of routing algorithms | |
| |
| |
| |
| Experimental setup | |
| |
| |
| |
| IP over WDM traffic grooming | |
| |
| |
| |
| IP traffic grooming in WDM networks | |
| |
| |
| |
| IP traffic grooming problem formulation | |
| |
| |
| |
| Solution for an optimal strategy | |
| |
| |
| |
| Approximate approach | |
| |
| |
| |
| Traffic aggregation algorithm | |
| |
| |
| |
| Example of traffic aggregation | |
| |
| |
| |
| Performance study | |
| |
| |
| |
| Examples | |
| |
| |
| |
| Light trail architecture for grooming | |
| |
| |
| |
| Light trail | |
| |
| |
| |
| Node structure | |
| |
| |
| |
| Light trail characteristics | |
| |
| |
| |
| Light trail design | |
| |
| |
| |
| Solution considerations | |
| |
| |
| |
| Light trail hop-length limit: Tl[subscript max] = 4 | |
| |
| |
| |
| Light trail hop-length limit: Tl[subscript max] = 5 | |
| |
| |
| |
| Restoration in the light trail architecture | |
| |
| |
| |
| Survivable light trail design | |
| |
| |
| |
| ILP formulation: connection-based protection | |
| |
| |
| |
| Optical network components | |
| |
| |
| |
| Network design | |
| |
| |
| |
| Graph model for network | |
| |
| |
| |
| Graph algorithms | |
| |
| |
| |
| Routing algorithm | |
| |
| |
| |
| Network topology design | |
| |
| |
| References | |
| |
| |
| Index | |