Survivability and traffic grooming in WDM optical networks

459 Pages·2005·9.008 MB·English

by  Arun K Somani

SURVIVABILITY AND TRAFFIC GROOMING
IN WDM OPTICAL NETWORKS
Theadventoffiberoptictransmissionsystemsandwavelength-divisionmultiplex-
ing(WDM)haveledtoadramaticincreaseintheusablebandwidthofsingle-fiber
systems. This book provides detailed coverage of survivability (dealing with the
riskoflosinglargevolumesoftrafficdataduetoafailureofanodeorasinglefiber
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
opticalnetworks.
A framework is developed to deal with these problems in wide area networks,
wherethetopologyusedtoservicevarioushigh-bandwidth(butstillsmallinrela-
tion to the capacity of the fiber) systems evolves toward making use of a general
mesh.Effectivesolutions,exploitingcomplexoptimizationtechniquesandheuris-
tic methods are presented to keep network problems tractable. Newer networking
technologiesandefficientdesignmethodologiesarealsodescribed.
This book is suitable for researchers in optical fiber networking and designers
of survivable networks. It would also be ideal for a graduate course on optical
networking.
Arun K. Somani istheJerryR.JunkinsEndowedChairProfessorofElectrical
andComputerEngineeringatIowaStateUniversity.Hisresearchinterestsareinthe
areaoffault-tolerantcomputing,computerinterconnectionnetworks,WDM-based
opticalnetworking,andparallelcomputersystemarchitecture.Hehasservedasan
IEEEdistinguishedvisitorandanIEEEdistinguishedtutorialspeaker.Hehasbeen
electedaFellowoftheIEEEforhiscontributionstothetheoryandapplicationsof
computernetworks.

SURVIVABILITY AND TRAFFIC
GROOMING IN WDM
OPTICAL NETWORKS
ARUN K. SOMANI
cambridge university press
Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore, São Paulo
Cambridge University Press
TheEdinburghBuilding,Cambridgecb22ru,UK
Published in the United States of America by Cambridge University Press, New York
www.cambridge.org
Information on this title: www.cambridge.org/9780521853880
© Cambridge University Press 2005
Thispublicationisincopyright.Subjecttostatutoryexceptionandtotheprovisionof
relevantcollectivelicensingagreements,noreproductionofanypartmaytakeplace
withoutthewrittenpermissionofCambridgeUniversityPress.
Firstpublishedinprintformat 2005
isbn-13 978-0-511-13754-9 eBook (NetLibrary)
isbn-10 0-511-13754-0
eBook (NetLibrary)
isbn-13 978-0-521-85388-0 hardback
isbn-10 0-521-85388-5 hardback
CambridgeUniversityPresshasnoresponsibilityforthepersistenceoraccuracyofurls
forexternalorthird-partyinternetwebsitesreferredtointhispublication,anddoesnot
guaranteethatanycontentonsuchwebsitesis,orwillremain,accurateorappropriate.
Thisbookisdedicatedtomyparents,whohavebeenaninspirationtowardsmy
achievementsinlife,andtoallmystudentswhohelpedturnmydreamintoa
realityandmyfamilywhosupportedmeunconditionally.

Contents
Preface pagexiii
Acknowledgments xix
1 Opticalnetworkingtechnology 1
1.1 Wavelength-divisionmultiplexing 2
1.2 Broadcast-and-selectnetworks 4
1.3 Wavelength-routedWDMnetworks 7
1.4 WavelengthconversioninWDMnetworks 10
1.5 Opticalpacketswitching 12
1.6 Opticalburstswitching 12
1.7 Therestofthebook 13
2 Designissues 14
2.1 Networkdesign 14
2.2 Networkmodel 15
2.3 Routingandwavelengthassignment 17
2.4 Multi-fibernetworks 23
2.5 Survivability 25
2.6 Restorationmethods 26
2.7 TrafficgroominginWDMnetworks 28
2.8 Opticalpacketswitching 30
2.9 Opticalburstswitching 31
3 Restorationapproaches 34
3.1 Restorationmodel 38
3.2 Upgradeablenetworkdesign 38
3.3 Notation 40
3.4 Costmodel 41
3.5 Designproblem 44
3.6 Heuristicapproachfornetworkdesign 51
vii
viii Contents
3.7 Networkupgrade 55
3.8 Methodologyvalidation 56
4 p-cycleprotection 62
4.1 Designofp-cyclerestorablenetworks 62
4.2 Cycleselectionalgorithms 63
4.3 Jointoptimizationofp-cycledesign 66
4.4 Ap-cycle-baseddesignfordynamictraffic 66
4.5 Algorithmforfindingallcycles 82
5 Networkoperation 86
5.1 Capacityminimization 86
5.2 Revenuemaximization 87
5.3 Capacityminimization:problemformulation 88
5.4 Revenuemaximization:problemformulation 90
5.5 Solutionmethodology 93
5.6 Performanceevaluation 95
6 Managinglargenetworks 102
6.1 Onlinealgorithm 102
6.2 Example 105
6.3 LPformulation 106
6.4 Solvingforexcessdemands 110
6.5 QualityoftheLPheuristicalgorithm 110
6.6 ILPandLPsolutionruntimes 113
6.7 RuntimesfortheLPheuristicalgorithm 115
7 Subgraph-basedprotectionstrategy 116
7.1 Subgraph-basedroutingandfaulttolerancemodel 117
7.2 Performanceofsubgraph-basedrouting 119
7.3 Performanceresults 123
7.4 Multi-linkandotherfailures 127
7.5 Constrainedsubgraphrouting 130
7.6 Example 131
7.7 Observations 140
8 Managingmultiplelinkfailures 143
8.1 Link-basedprotectionfortwolinkfailures 144
8.2 Path-basedprotection 147
8.3 Formulatingtwolinkfailures 148
8.4 Examplesandcomparison 155
8.5 Dual-linkfailurecoverageofsingle-failureprotectionschemes 157
8.6 Dual-linkfailurecoverageusingshared-meshprotection 159
8.7 Dual-linkfailurecoverage:subgraphrouting 161
Contents ix
8.8 Coveragecomputation 163
8.9 Observations 167
9 TrafficgroominginWDMnetworks 169
9.1 TrafficgroominginWDMrings 173
9.2 Statictrafficgroominginrings 173
9.3 DynamictrafficgroominginWDMnetworks 178
10 Gainsoftrafficgrooming 184
10.1 Networkparameters 185
10.2 Modelingconstrainedgroomingnetworks 186
10.3 Sparsegroomingnetwork 194
10.4 Validationofthemodel 195
11 Capacityfairnessingrooming 201
11.1 Managinglongerpaths 202
11.2 Capacityfairness 203
11.3 FairnessperformanceofRWAalgorithms 205
11.4 Connectionadmissioncontrolforfairness 206
12 Survivabletrafficgrooming 210
12.1 Trafficstreammultiplexingonasinglewavelength
link 211
12.2 Groomingtrafficstreamsonthenetwork 213
12.3 Routingandwavelengthassignment 216
12.4 Effectoftrafficgrooming 218
13 Staticsurvivablegroomingnetworkdesign 224
13.1 Designproblem 224
13.2 Example 231
14 Trunk-switchednetworks 236
14.1 Channelsandtrunks 236
14.2 ModelingaWDMgroomingnetworkasaTSN 237
14.3 Nodearchitecture 238
14.4 Freeandbusytrunks 241
14.5 Connectionestablishment 243
14.6 Groomingnetworkmodel 246
14.7 MICRONframework 247
14.8 Atwo-passapproach 252
14.9 Modelingachannel-spaceswitchinMICRON 257
15 BlockinginTSN 261
15.1 Blockingmodel 261
15.2 Estimationofcallarrivalratesonalink 262
15.3 Pathblockingperformance 264