Dynamic Routing in Broadband Networks

228 Pages·2003·32.677 MB·English

by  Marco Conte (auth.)

DYNAMIC ROUTING IN
BROADBAND NETWORKS
DYNAMIC ROUTING IN
BROADBAND NETWORKS
Mal'co Conte
SPRINGER SCIENCE+BUSINESS MEDIA, LLC
Library of Congress Cataloging-in-Publication Data
Dynamic Routing in Broadband Networks
Marco Conte
ISBN 978-1-4613-4987-7 ISBN 978-1-4615-0251-7 (eBook)
DOI 10.1007/978-1-4615-0251-7
Copyright © 2003 by Springer Science+Business Media New York
Originally published by Kluwer Academic Publishers in 2003
Softcover reprint ofthe hardcover Ist edition 2003
AlI rights reserved. No part ofthis work may be reproduced, stored in a retrieval
system, or transmitted in any form or by any means, electronic, mechanical,
photocopying, microfilming, recording, or otherwise, without written permission
from the Publisher, with the exception of any material supplied specifically for the
purpose ofbeing entered and executed on a computer system, for exclusive use by
the purchaser ofthe work.
Permission for books published in Europe: [email protected]
Permissions for books published in the United States of America: [email protected]
Printed on acid-free paper.
BROADBAND NETWORKS AND SERVICES SERIES
Series Editor
Harmen R. van As
Otherbooks intheseries:
OPTICALPACKETACCESSPROTOCOLSFORWDMNETWORKS,
KemalBengi,ISBN 1-4020-7042-X
ROUTING AND QUALITY-OF-SERVICE IN BROADBAND LEO SATELLITE
NETWORKS,HoangNamNguyen, ISBN 1-4020-7313-5
DYNAMICROUTINGINBROADBANDNETWORKS,MarcoConte,
ISBN 1-4020-7316-X
Table of Contents
FOREWORD XXI
PREFACE XIll
ACKNOWLEDGEMENT XV
1 INTRODUCTION 1
1.1 OverviewofthisWork 1
1.2 ChapterOverview 2
1.3 EvolutionofBroadbandNetworks 4
104 BroadbandNetworkArchitectures 5
1.5 NetworkProtocols 7
1.6 QualityofService 8
1.7 QoSRouting 9
1.8 DynamicRouting 10
2 ROUTING INTELEPHONEANDDATANETWORKS 13
2.1 DynamicRouting inTelephoneNetworks 13
2.1.1 DNHR 14
2.1.2 RTNR 14
2.1.3 DAR 15
2.104 DCR 15
2.1.5 DRS 15
2.1.6 IN/DR 16
2.1.7 OtherDynamicRoutingStrategies 16
2.2 Routing inIP-BasedDataNetworks 17
2.2.1 TheTCP/IPReferenceModel 17
2.2.2 RoutingProtocols 18
2.2.3 LabelSwitching 21
VIn TableofContents
2.3 ClassificationofRoutingSchemes 21
2.3.1 Hop-by-HopRoutingandSourceRouting 21
2.3.2 HierarchicalRouting 22
2.3.3. TypesofRouteComputationAlgorithms 22
2.3.4 TypesofRoutingArchitectures 23
2.4 RoutingSchemesandthe DegreeofMeshing 24
2.5 Some SelectedAlgorithmsforRoutingComputations 26
2.5.1 Dijkstra'sAlgorithm(ForwardSearching) 26
2.5.2 TheFord-FulkersonAlgorithm(BackwardSearching) 27
2.5.3 TheBellman-FordAlgorithm 27
2.5.4 MultidimensionalLinkMetrics 28
2.5.5 Minimum-HopRouting 29
2.5.6 Minimum-costRouting 29
:3 ATMROUTING 31
3.1 AsynchronousTransferMode 31
3.1.1 TheATMCell 32
3.1.2 TheVP/VCConcept. 33
3.1.3 VPC Configuration 33
3.1.4 Trafficand QoSParameters 33
3.1.5 ATMServiceCategories 34
3.1.6 ConnectionAdmissionControl 36
3.1.7 UPCINPC 36
3.1.8 DynaruicATMRouting 38
3.2 PNNI 38
3.2.1 ThePNNIProtocol 38
3.2.2 ThePNNIHierarchy 38
3.2.3 PNNISignaling 39
3.2.4 PNNIRouting 40
3.2.5 ThePNNITopology StatePackets .40
3.2.6 TheGenericCall AdmissionControl.. .41
3.3 TheTime ScaleModel 46
3.4 ResearchEffortsin ATMRouting .47
3.4.1 VPCRoutingAlgorithms .47
3.4.2 VCCRoutingAlgorithms 47
3.4.3 MulticastRoutil1g 47
4 MULTIPROTOCOLLABELSWITCHING 55
4.1 TheMPLS ShimHeader 55
TableofContents IX
4.2 Label SwitchedPaths 56
4.3 MPLS Signaling 56
4.4 MPLSRouting 57
4.5 TrafficEngineering 57
4.5.1 TrafficTrunks 57
4.5.2 TE AttributesofTrafficTrunks 58
4.5.3 PathSelectionProcedures 58
4.5.4 Constraint-BasedRouting 59
4.5.5 DynamicRouting 59
5 PERFORMANCEOPTIMIZATION OFATMROUTING 63
5.1 BroadbandTrafficModels 64
5.1.1 CallClasses 64
5.1.2 LinkCapacity 64
5.1.3 ThePoissonAssumptions 64
5.1.4 Queuing-TheoreticalLinkModel 64
5.1.5 TheMarkovProperty 65
5.1.6 MultidimensionalLinkStateProcess 65
5.1.7 TransitionRates 66
5.1.8 MarkovPropertyoftheLinkStateProcess 66
5.1.9 SteadystateProbabilitiesoftheMultidimensionalLinkStateProcess.67
5.1.10 LinkStateAggregationandScalarState 67
5.1.11 ComputationoftheLinkLossRate 68
5.2 BriefOverviewoftheMDPTheory 68
5.2.1 General 68
5.2.2 SystemEquations 68
5.2.3 ThePolicyIteration 69
5.3 TheoryofMDPRouting 70
5.3.1 NetworkStateProcess 70
5.3.2 SeparabilityAssumption 70
5.3.3 Single-StepPolicyIteration 71
5.4 ExistingMDPRoutingSchemes 71
5.5 NewApproachforMultirateMDPCostComputation 72
5.5.1 Two StateProcessAggregation 72
5.5.2 DirectDerivationoftheMDPLinkCostatStateu 73
5.5.3 TheRelationtotheExactSeparable]\,IIDPCosts 76
5.5.4 TheRelationtoKrishnan'sMultirateMDPRoutingScheme 78
5.6 ComputationofInitialOfferedLoads 80
x
TableofContents
5.6.1 OptimalityConditions 80
5.6.2 ComputationAlgorithm 82
5.7 LinkLoadEstilnation 82
5.7.1 AgedLink-State Information 82
5.7.2 TheChapman-KolmogorovForwardEquation 83
5.7.3 OccupancyEstimationAlgorithm 83
5.8 TheCostofUnidirectional andBi-directionalCalls 85
5.9 FairnessforServiceRequests 86
5.10 Self-AdaptiveCostTables 87
6 DRJATM-ADYNAMICROUTINGSCHEME 89
6.1 PrinciplesofDRlATM 89
6.2 RequirementsonATMRoutingScenarios 90
6.3 PathSelectioninDRiATM 92
6.3.1 PathAssignmentsbytheATMSwitches 92
6.3.2 PathAssignmentsInvolvingRCPs 92
6.3.3 RCP-to-RCPDataDistribution 94
6.4 TheDRlATMRoutingArchitecture 95
6.5 VPCConfiguration 96
6.6 DR/ATMforWeaklyMeshedNetworks 97
6.6.1 SourceRouting 97
6.6.2 PathSelection 97
6.6.3 RandomizedMinimum-HopRouting 98
6.7 InterworkingwithPNNINetworks 98
6.7.1 HybridNetworkScenarios 98
6.7.2 InterworkingStrategies 99
6.7.3 FlatDRlATM-PNNlInterworking 99
6.7.4 HierarchicalDRlATM-PNNIInterworking 100
6.8 SelectionofaMulticastalgorithmforDRIATM 101
6.9 Automatic AdaptationoftheCostFunctionTables 101
6.9.1 Automatic AdaptationSchemebasedonDRIATMOverflow
Evaluation 102
6.9.2 Automatic Adaptation SchemeBasedonExplicitTopology State
Reporting 105
6.10 AnalysisofRequirementsonNetworkEntities 108
Table ofContents XI
6.10.1 CoreNetworkModel 108
6.10.2 Real-TimeRequirements 109
6.10.3 Non-Real TimeRequirements 109
6.10.4 RequirementsontheRCP-RCPTransmissionChannels 110
7 IMPLEMENTATIONOFTHESIMULATIONMODELS 111
7.1 Cell-andConnection-Level 111
7.2 The SimulationTool.. 111
7.3 TheRouting Simulator 112
7.3.1 SimulatorDesign 112
7.3.2 TheFull andStrongMeshSimulator 112
7.3.3 TheWeakMeshNetworkSimulator. 1l4
7.3.4 Routingschemes 115
7.3.5 CrankbackandRerouting 116
7.3.6 SystemParalueters 116
7.3.7 FairnessforServiceRequests 117
7.3.8 TrunkReservation 117
7.3.9 MaximumNumberofAlternativeRoutes 118
7.3.10 CallTypesand TrafficMixes 118
7.3.11 ATMNetworkModels 119
7.3.12 NetworkTrafficProfile 124
7.3.13 Testsofthe SimulatorSoftware 127
7.4 DeterminingCACParameters attheCell-level 127
704.1 TheCell-levelSimulator 127
704.2 TheDesignofthe Cell-level Simulator 127
704.3 Cell-levelTrafficSources 128
70404 TrafficMixes 129
7.4.5 OutputoftheCell-level Simulator 130
7.4.6 Results 132
8 SIMULATIONRESULTSANDPERFORMANCE
COMPARISON 135
8.1 RoutingSchemesSimulated 135
8.1.1 DRiATM 135
8.1.2 LLP 136
8.1.3 RandomRouting 136
8.1.4 StickyRandom Routing 136
8.1.5 PNNIMinimum-Hop 136
8.1.6 PNNIMinimum-CostRouting 136
XII TableofContents
8.2 NetworkScenarios 137
8.3 Results fortheFive-NodeFullyMeshedNetwork. 137
8.4 Resultsforthe Twenty-NodeFullyMeshedNetwork 140
8.5 Results forthe Twenty-Node StronglyMeshedNetwork 144
8.6 ResultsfortheTwenty-Node SquaredMeshedNetwork 147
8.6.1 Minimum-HopRouting 147
8.6.2 ATM-FLRMinimum-CostRouting 149
8.6.3 DR/ATM 152
8.7 Twenty-NodeSquaredMeshedNetwork:FurtherResults 155
8.7.1 General 155
8.7.2 DR/ATM 155
8.7.3 ATM-FLRMinimum-CostRoutingwithPNN1Flooding 162
8.7.4 Minimum-HopRoutingwithPNNlFlooding 165
8.8 Twenty-Node SquaredMeshedNetwork:InterworkingofRouting
Schemes 168
8.8.1 RoutingInterworkingScenarios 168
8.8.2 SimulationResultsforConfigurationAandD:Minimum-HopRouting
andATM-FLRMinimum-CostRouting 170
8.8.3 HybridConfigurationB:Minimum-HopRoutingandDR/ATM 173
8.8.4 HybridConfigurationC: ATM-FLRRoutingandDR/ATM 176
8.9 MulticastRoutingSimulations 179
8.9.1 MulticastRoutingScenarios 179
8.9.2 MulticastRoutingSimulationResults 179
8.10 RoutingAdaptability 187
8.10.1 SimulationScenarios 188
8.10.2 SimulationResults 189
9 CONCLUSION 197
LISTOFACRONyMS 199
LISTOFMATHEMATICALSYMBOLS 205
REFERENCES 207
INDEX 213