Principles of Broadband Switching and Networking

466 Pages·2010·7.866 MB·English

by  Professor Tony T. Lee, Professor Soung C. Liew(auth.), John G. Proakis(eds.)

Principles of
Broadband
Switching and
Networking
telecommun.qxd 12/17/2009 1:47 PM Page 1
WILEY SERIES IN TELECOMMUNICATIONS
AND SIGNAL PROCESSING
John G. Proakis, Editor
Northeastern University
A complete list of the titles in this series appears at the end of this volume.
Principles of
Broadband
Switching and
Networking
Tony T. Lee and Soung C. Liew
Copyright©2010byJohnWiley&Sons,Inc.Allrightsreserved.
PublishedbyJohnWiley&Sons,Inc.,Hoboken,NewJersey
PublishedsimultaneouslyinCanada
Nopartofthispublicationmaybereproduced,storedinaretrievalsystem,ortransmittedinanyformor
byanymeans,electronic,mechanical,photocopying,recording,scanning,orotherwise,exceptas
permittedunderSection107or108ofthe1976UnitedStatesCopyrightAct,withouteithertheprior
writtenpermissionofthePublisher,orauthorizationthroughpaymentoftheappropriateper-copyfeeto
theCopyrightClearanceCenter,Inc.,222RosewoodDrive,Danvers,MA01923,[phone],fax
(978)-750-4470,oronthewebatwww.copyright.com.RequeststothePublisherforpermissionshould
beaddressedtothePermissionsDepartment,JohnWiley&Sons,Inc.,111RiverStreet,Hoboken,NJ
07030,[phone],fax[phone],oronlineathttp://www.wiley.com/go/permissions.
LimitofLiability/DisclaimerofWarranty:Whilethepublisherandauthorhaveusedtheirbesteffortsin
preparingthisbook,theymakenorepresentationsorwarrantieswithrespecttotheaccuracyor
completenessofthecontentsofthisbookandspecificallydisclaimanyimpliedwarrantiesof
merchantabilityorfitnessforaparticularpurpose.Nowarrantymaybecreatedorextendedbysales
representativesorwrittensalesmaterials.Theadviceandstrategiescontainedhereinmaynotbesuitable
foryoursituation.Youshouldconsultwithaprofessionalwhereappropriate.Neitherthepublishernor
authorshallbeliableforanylossofprofitoranyothercommercialdamages,includingbutnotlimitedto
special,incidental,consequential,orotherdamages.
Forgeneralinformationonourotherproductsandservicesortechnicalsupport,pleasecontactour
CustomerCareDepartmentwithintheUnitedStatesat(800)762-2974,outsidetheUnitedStatesat(317)
572-3993orfax(317)572-4002.
Wileyalsopublishesitsbooksinavarietyofelectronicformats.Somecontentthatappearsinprintmay
notbeavailableinelectronicbooks.FormoreinformationaboutWileyproducts,visitourwebsiteat
www.wiley.com
ISBN:978-0-471-13901-0
LibraryofCongressCataloging-in-PublicationDataisavailable.
PrintedintheUnitedStatesofAmerica
10 9 8 7 6 5 4 3 2 1
DedicatedtoProfessorCharlesK.Kaoforhisguidance,
andtoourwives,AliceandSoKuen,fortheirunwaveringsupport.
CONTENTS
Preface xiii
AbouttheAuthors xvii
1 IntroductionandOverview 1
1.1 SwitchingandTransmission 2
1.1.1 RolesofSwitchingandTransmission 2
1.1.2 TelephoneNetworkSwitchingandTransmissionHierarchy 4
1.2 MultiplexingandConcentration 5
1.3 TimescalesofInformationTransfer 8
1.3.1 SessionsandCircuits 9
1.3.2 Messages 9
1.3.3 PacketsandCells 9
1.4 BroadbandIntegratedServicesNetwork 10
Problems 12
2 CircuitSwitchDesignPrinciples 15
2.1 Space-DomainCircuitSwitching 16
2.1.1 NonblockingProperties 16
2.1.2 ComplexityofNonblockingSwitches 18
2.1.3 ClosSwitchingNetwork 20
2.1.4 BenesSwitchingNetwork 28
2.1.5 BaselineandReverseBaselineNetworks 31
2.1.6 CantorSwitchingNetwork 32
2.2 Time-DomainandTime–Space–TimeCircuitSwitching 35
2.2.1 Time-DomainSwitching 35
2.2.2 Time–Space–TimeSwitching 37
Problems 39
vii
viii CONTENTS
3 FundamentalPrinciplesofPacketSwitchDesign 43
3.1 PacketContentioninSwitches 45
3.2 FundamentalPropertiesofInterconnectionNetworks 48
3.2.1 DefinitionofBanyanNetworks 49
3.2.2 SimpleSwitchesBasedonBanyanNetworks 51
3.2.3 CombinatoricPropertiesofBanyanNetworks 54
3.2.4 NonblockingConditionsfortheBanyanNetwork 54
3.3 SortingNetworks 59
3.3.1 BasicConceptsofComparisonNetworks 61
3.3.2 SortingNetworksBasedonBitonicSort 64
3.3.3 TheOdd–EvenSortingNetwork 70
3.3.4 SwitchingandContentionResolutioninSort-BanyanNetwork 71
3.4 NonblockingandSelf-RoutingPropertiesofClosNetworks 75
3.4.1 NonblockingRouteAssignment 76
3.4.2 RecursivenessProperty 79
3.4.3 BasicPropertiesofHalf-ClosNetworks 81
3.4.4 Sort-ClosPrinciple 89
Problems 90
4 SwitchPerformanceAnalysisandDesignImprovements 95
4.1 PerformanceofSimpleSwitchDesigns 95
4.1.1 ThroughputofanInternallyNonblockingLossSystem 96
4.1.2 ThroughputofanInput-BufferedSwitch 96
4.1.3 DelayofanInput-BufferedSwitch 103
4.1.4 DelayofanOutput-BufferedSwitch 112
4.2 DesignImprovementsforInputQueueingSwitches 113
4.2.1 Look-AheadContentionResolution 113
4.2.2 ParallelIterativeMatching 115
4.3 DesignImprovementsBasedonOutputCapacityExpansion 119
4.3.1 SpeedupPrinciple 119
4.3.2 Channel-GroupingPrinciple 121
4.3.3 KnockoutPrinciple 131
4.3.4 ReplicationPrinciple 137
4.3.5 DilationPrinciple 138
Problems 144
5 AdvancedSwitchDesignPrinciples 151
5.1 SwitchDesignPrinciplesBasedonDeflectionRouting 151
5.1.1 Tandem-BanyanNetwork 151
5.1.2 Shuffle-ExchangeNetwork 154
CONTENTS ix
5.1.3 FeedbackShuffle-ExchangeNetwork 158
5.1.4 FeedbackBidirectionalShuffle-ExchangeNetwork 166
5.1.5 DualShuffle-ExchangeNetwork 175
5.2 SwitchingbyMemoryI/O 184
5.3 DesignPrinciplesforScalableSwitches 187
5.3.1 GeneralizedKnockoutPrinciple 187
5.3.2 ModularArchitecture 191
Problems 198
6 SwitchingPrinciplesforMulticast,Multirate,
andMultimediaServices 205
6.1 MulticastSwitching 205
6.1.1 MulticastingBasedonNonblockingCopyNetworks 208
6.1.2 PerformanceImprovementofCopyNetworks 213
6.1.3 MulticastingAlgorithmforArbitraryNetwork
Topologies 220
6.1.4 NonblockingCopyNetworksBasedonBroadcastClos
Networks 228
6.2 PathSwitching 235
6.2.1 BasicConceptofPathSwitching 237
6.2.2 CapacityandRouteAssignmentsforMultirateTraffic 242
6.2.3 Trade-OffBetweenPerformanceandComplexity 249
6.2.4 MulticastinginPathSwitching 254
6.A Appendix 268
6.A.1 AFormulationofEffectiveBandwidth 268
6.A.2 Approximations of Effective Bandwidth Based on On–Off
SourceModel 269
Problems 270
7 BasicConceptsofBroadbandCommunicationNetworks 275
7.1 SynchronousTransferMode 275
7.2 DelaysinATMNetwork 280
7.3 CellSizeConsideration 283
7.4 CellNetworking,VirtualChannels,andVirtualPaths 285
7.4.1 NoDataLinkLayer 285
7.4.2 CellSequencePreservation 286
7.4.3 Virtual-CircuitHop-by-HopRouting 286
7.4.4 VirtualChannelsandVirtualPaths 287
7.4.5 RoutingUsingVCIandVPI 289
7.4.6 MotivationsforVP/VCTwo-TierHierarchy 293
x CONTENTS
7.5 ATMLayer,AdaptationLayer,andServiceClass 295
7.6 TransmissionInterface 300
7.7 ApproachesTowardIPoverATM 300
7.7.1 ClassicalIPoverATM 301
7.7.2 NextHopResolutionProtocol 302
7.7.3 IPSwitchandCellSwitchRouter 303
7.7.4 ARISandTagSwitching 306
7.7.5 MultiprotocolLabelSwitching 308
Appendix7.A ATMCellFormat 311
7.A.1 ATMLayer 311
7.A.2 AdaptationLayer 314
Problems 319
8 NetworkTrafficControlandBandwidthAllocation 323
8.1 Fluid-FlowModel:DeterministicDiscussion 326
8.2 Fluid-FlowOn–OffSourceModel:StochasticTreatment 332
8.3 TrafficShapingandPolicing 348
8.4 Open-LoopFlowControlandScheduling 354
8.4.1 First-Come-First-ServeScheduling 355
8.4.2 Fixed-CapacityAssignment 357
8.4.3 Round-RobinScheduling 358
8.4.4 WeightedFairQueueing 364
8.4.5 DelayBoundinWeightedFairQueueingwithLeaky-Bucket
AccessControl 373
8.5 Closed-LoopFlowControl 380
Problems 381
9 PacketSwitchingandInformationTransmission 385
9.1 DualityofSwitchingandTransmission 386
9.2 ParallelCharacteristicsofContentionandNoise 390
9.2.1 PseudoSignal-to-NoiseRatioofPacketSwitch 390
9.2.2 ClosNetworkwithRandomRoutingasaNoisyChannel 393
9.3 ClosNetworkwithDeflectionRouting 396
9.3.1 CascadedClosNetwork 397
9.3.2 AnalysisofDeflectionClosNetwork 397
9.4 RouteAssignmentsandError-CorrectingCodes 402
9.4.1 CompleteMatchinginBipartiteGraphs 402
9.4.2 GraphicalCodes 405
9.4.3 RouteAssignmentsofBenesNetwork 407
CONTENTS xi
9.5 ClosNetworkasNoiselessChannel-PathSwitching 410
9.5.1 CapacityAllocation 411
9.5.2 CapacityMatrixDecomposition 414
9.6 SchedulingandSourceCoding 416
9.6.1 SmoothnessofScheduling 417
9.6.2 ComparisonofSchedulingAlgorithms 420
9.6.3 Two-DimensionalScheduling 424
9.7 Conclusion 430
Bibliography 433