Survivability And Traffic Grooming In Wdm Optical Networks

by Arun Somani

• ISBN13: 9780521853880
• ISBN10: 0521853885
• Format: Hardcover
• Copyright: 2006-02-13
• Publisher: Cambridge University Press

Summary

The advent of fiber optic transmission systems and wavelength division multiplexing (WDM) have led to a dramatic increase in the usable bandwidth of single fiber systems. This book provides detailed coverage of survivability (dealing with the risk of losing large volumes of traffic data due to a failure of a node or a single fiber span) and traffic grooming (managing the increased complexity of smaller user requests over high capacity data pipes), both of which are key issues in modern optical networks. A framework is developed to deal with these problems in wide-area networks, where the topology used to service various high-bandwidth (but still small in relation to the capacity of the fiber) systems evolves toward making use of a general mesh. Effective solutions, exploiting complex optimization techniques, and heuristic methods are presented to keep network problems tractable. Newer networking technologies and efficient design methodologies are also described.

Author Biography

Arun K. Somani is Jerry R. Junkins Endowed Chair Professor of Electrical and Computer Engineering at Iowa State University.

Table of Contents

Preface	xiii
Acknowledgments	xix
Optical networking technology	1	(13)
Wavelength-division multiplexing	2	(2)
Broadcast-and-select networks	4	(3)
Wavelength-routed WDM networks	7	(3)
Wavelength conversion in WDM networks	10	(2)
Optical packet switching	12	(1)
Optical burst switching	12	(1)
The rest of the book	13	(1)
Design issues	14	(20)
Network design	14	(1)
Network model	15	(2)
Routing and wavelength assignment	17	(6)
Multi-fiber networks	23	(2)
Survivability	25	(1)
Restoration methods	26	(2)
Traffic grooming in WDM networks	28	(2)
Optical packet switching	30	(1)
Optical burst switching	31	(3)
Restoration approaches	34	(28)
Restoration model	38	(1)
Upgradeable network design	38	(2)
Notation	40	(1)
Cost model	41	(3)
Design problem	44	(7)
Heuristic approach for network design	51	(4)
Network upgrade	55	(1)
Methodology validation	56	(6)
p-cycle protection	62	(24)
Design of p-cycle restorable networks	62	(1)
Cycle selection algorithms	63	(3)
Joint optimization of p-cycle design	66	(1)
A p-cycle-based design for dynamic traffic	66	(16)
Algorithm for finding all cycles	82	(4)
Network operation	86	(16)
Capacity minimization	86	(1)
Revenue maximization	87	(1)
Capacity minimization: problem formulation	88	(2)
Revenue maximization: problem formulation	90	(3)
Solution methodology	93	(2)
Performance evaluation	95	(7)
Managing large networks	102	(14)
Online algorithm	102	(3)
Example	105	(1)
LP formulation	106	(4)
Solving for excess demands	110	(1)
Quality of the LP heuristic algorithm	110	(3)
ILP and LP solution run times	113	(2)
Run times for the LP heuristic algorithm	115	(1)
Subgraph-based protection strategy	116	(27)
Subgraph-based routing and fault tolerance model	117	(2)
Performance of subgraph-based routing	119	(4)
Performance results	123	(4)
Multi-link and other failures	127	(3)
Constrained subgraph routing	130	(1)
Example	131	(9)
Observations	140	(3)
Managing multiple link failures	143	(26)
Link-based protection for two link failures	144	(3)
Path-based protection	147	(1)
Formulating two link failures	148	(7)
Examples and comparison	155	(2)
Dual-link failure coverage of single-failure protection schemes	157	(2)
Dual-link failure coverage using shared-mesh protection	159	(2)
Dual link failure coverage: subgraph routing	161	(2)
Coverage computation	163	(4)
Observations	167	(2)
Traffic grooming in WDM networks	169	(15)
Traffic grooming in WDM rings	173	(1)
Static traffic grooming in rings	173	(5)
Dynamic traffic grooming in WDM networks	178	(6)
Gains of traffic grooming	184	(17)
Network parameters	185	(1)
Modeling constrained grooming networks	186	(8)
Sparse grooming network	194	(1)
Validation of the model	195	(6)
Capacity fairness in grooming	201	(9)
Managing longer paths	202	(1)
Capacity fairness	203	(2)
Fairness performance of RWA algorithms	205	(1)
Connection admission control for fairness	206	(4)
Survivable traffic grooming	210	(14)
Traffic stream multiplexing on a single wavelength link	211	(2)
Grooming traffic streams on the network	213	(3)
Routing and wavelength assignment	216	(2)
Effect of traffic grooming	218	(6)
Static survivable grooming network design	224	(12)
Design problem	224	(7)
Example	231	(5)
Trunk-switched networks	236	(25)
Channels and trunks	236	(1)
Modeling a WDM grooming network as a TSN	237	(1)
Node architecture	238	(3)
Free and busy trunks	241	(2)
Connection establishment	243	(3)
Grooming network model	246	(1)
MICRON framework	247	(5)
A two-pass approach	252	(5)
Modeling a channel-space switch in MICRON	257	(4)
Blocking in TSN	261	(19)
Blocking model	261	(1)
Estimation of call arrival rates on a link	262	(2)
Path blocking performance	264	(5)
Free trunk distribution	269	(4)
Modeling switches	273	(1)
Heterogeneous switch architectures	274	(4)
Improving the accuracy of the analytical model	278	(2)
Validation of the TSN model	280	(13)
Simulation setup	281	(1)
Homogeneous networks performance	282	(5)
Heterogeneous networks performance	287	(5)
Observations	292	(1)
Performance of dynamic routing in WDM grooming networks	293	(16)
Information collection	293	(3)
Path-selection algorithms	296	(2)
An example	298	(1)
Performance of routing algorithms	298	(1)
Experimental setup	299	(10)
IP over WDM traffic grooming	309	(21)
IP traffic grooming in WDM networks	311	(2)
IP traffic grooming problem formulation	313	(2)
Solution for an optimal strategy	315	(3)
Approximate approach	318	(1)
Traffic aggregation algorithm	318	(3)
Example of traffic aggregation	321	(3)
Performance study	324	(1)
Examples	325	(5)
Light trail architecture for grooming	330	(27)
Light trail	330	(1)
Node structure	331	(2)
Light trail characteristics	333	(1)
Light trail design	334	(3)
Solution considerations	337	(6)
Light trail hop-length limit: Tlmax = 4	343	(3)
Light trail hop-length limit: Tlmax = 5	346	(1)
Restoration in the light trail architecture	347	(3)
Survivable light trail design	350	(1)
ILP formulation: connection-based protection	350	(7)
Appendix 1 Optical network components	357	(20)
Appendix 2 Network design	377	(13)
Appendix 3 Graph model for network	390	(3)
Appendix 4 Graph algorithms	393	(13)
Appendix 5 Routing algorithm	406	(2)
Appendix 6 Network topology design	408	(8)
References	416	(18)
Index	434