Introduction to IP and ATM Design and Performance: With Applications Analysis Software, Second Edition

305 Pages·2000·2.16 MB·English

by  J M Pitts

Introduction to IP and ATM Design Performance: With Applications Analysis Software,
Second Edition. J M Pitts, J A Schormans
Copyright © 2000 John Wiley & Sons Ltd
ISBNs: 0-471-49187-X (Hardback); 0-470-84166-4 (Electronic)
Introduction to IP and ATM
Design and Performance
Introduction to IP and ATM
Design and Performance
With Applications Analysis Software
Second Edition
J M Pitts
J A Schormans
QueenMary
University ofLondon
UK
JOHNWILEY &SONS,LTD
Chichester ž NewYork ž Weinheim ž Brisbane ž Toronto ž Singapore
FirstEditionpublishedin1996asIntroductiontoATMDesignandPerformancebyJohnWiley&Sons,Ltd.
Copyright2000byJohnWiley&Sons,Ltd
BaffinsLane,Chichester,
WestSussex,PO191UD,England
National 01243779777
International(C44)1243779777
e-mail(forordersandcustomerserviceenquiries):[email protected]
VisitourHomePageonhttp://www.wiley.co.ukorhttp://www.wiley.com
ReprintedMarch2001
AllRightsReserved.Nopartofthispublicationmaybereproduced,storedinaretrievalsystem,ortransmitted,
inanyformorbyanymeans,electronic,mechanical,photocopying,recording,scanningorotherwise,except
under the terms of the Copyright Designs and Patents Act 1988 or under the terms of a licence issued by
theCopyrightLicensingAgency,90TottenhamCourtRoad,London,W1P9HE,UK,withoutthepermission
inwritingofthePublisher,withtheexceptionofanymaterialsuppliedspecificallyforthepurposeofbeing
enteredandexecutedonacomputersystem,forexclusiveusebythepurchaserofthepublication.
Neither the authors nor John Wiley & Sons Ltd accept any responsibility or liability for loss or damage
occasionedto any personorpropertythrough usingthe material, instructions, methodsorideascontained
herein,oractingorrefrainingfromactingasaresultofsuchuse.Theauthor(s)andPublisherexpresslydisclaim
allimpliedwarranties,includingmerchantabilityorfitnessforanyparticularpurpose.Therewillbenoduty
ontheauthorsorPublishertocorrectanyerrorsordefectsinthesoftware.
Designationsusedbycompaniestodistinguishtheirproductsareoftenclaimedastrademarks.Inallinstances
where John Wiley& Sons is aware of a claim, the product names appear in initial capital or all capital
letters.Readers,however,shouldcontacttheappropriatecompaniesformorecompleteinformationregarding
trademarksandregistration.
OtherWileyEditorialOffices
JohnWiley&Sons,Inc.,605ThirdAvenue,
NewYork,NY10158-0012,USA
Wiley-VCHVerlagGmbH
Pappelallee3,D-69469Weinheim,Germany
JacarandaWileyLtd,33ParkRoad,Milton,
Queensland4064,Australia
JohnWiley&Sons(Canada)Ltd,22WorcesterRoad
Rexdale,Ontario,M9W1L1,Canada
JohnWiley&Sons(Asia)PteLtd,2ClementiLoop#02-01,
JinXingDistripark,Singapore129809
BritishLibraryCataloguinginPublicationData
AcataloguerecordforthisbookisavailablefromtheBritishLibrary
ISBN047149187X
Typesetin101/121ptPalatinobyLaserWords,Chennai,India
2 2
PrintedandboundinGreatBritainbyBookcraft(Bath)Ltd
Thisbookisprintedonacid-freepaperresponsiblymanufacturedfromsustainableforestry,
inwhichatleasttwotreesareplantedforeachoneusedforpaperproduction.
To
Suzanne, Rebekah, Verity and Barnabas
Jacqueline, Matthew and Daniel
Contents
Preface xi
PARTI INTRODUCTORYTOPICS 1
1 AnIntroductiontotheTechnologiesofIPandATM 3
CircuitSwitching 3
PacketSwitching 5
CellSwitchingandATM 7
Connection-orientatedService 8
ConnectionlessServiceandIP 9
BufferinginATMswitchesandIProuters 11
BufferManagement 11
TrafficControl 13
2 TrafficIssuesandSolutions 15
DelayandLossPerformance 15
Sourcemodels 16
Queueingbehaviour 18
CopingwithMulti-serviceRequirements:DifferentiatedPerformance 30
Buffersharingandpartitioning 30
Cellandpacketdiscardmechanisms 32
Queueschedulingmechanisms 35
Flows,ConnectionsandAggregates 37
Admissioncontrolmechanisms 37
Policingmechanisms 40
Dimensioningandconfiguration 41
3 TeletrafficEngineering 45
SharingResources 45
MeshandStarNetworks 45
TrafficIntensity 47
Performance 49
TCP:Traffic,CapacityandPerformance 49
VariationofTrafficIntensity 50
Erlang’sLostCallFormula 52
TrafficTables 53
viii CONTENTS
4 PerformanceEvaluation 57
MethodsofPerformanceEvaluation 57
Measurement 57
Predictiveevaluation:analysis/simulation 57
QueueingTheory 58
Notation 60
Elementaryrelationships 60
TheM/M/1queue 61
TheM/D/1/Kqueue 64
DelayintheM/M/1andM/D/1queueingsystems 65
5 FundamentalsofSimulation 69
DiscreteTimeSimulation 69
Generatingrandomnumbers 71
M/D/1queuesimulatorinMathcad 73
Reachingsteadystate 74
Batchmeansandconfidenceintervals 75
Validation 77
AcceleratedSimulation 77
Cell-ratesimulation 77
6 TrafficModels 81
LevelsofTrafficBehaviour 81
TimingInformationinSourceModels 82
TimebetweenArrivals 83
CountingArrivals 86
RatesofFlow 89
PARTII ATMQUEUEINGANDTRAFFICCONTROL 95
7 BasicCellSwitching 97
TheQueueingBehaviourofATMCellsinOutputBuffers 97
BalanceEquationsforBuffering 98
CalculatingtheStateProbabilityDistribution 100
ExactAnalysisforFINITEOutputBuffers 104
Delays 108
End-to-enddelay 110
8 Cell-ScaleQueueing 113
Cell-scaleQueueing 113
MultiplexingConstant-bit-rateTraffic 114
AnalysisofanInfiniteQueuewithMultiplexedCBRInput:The 115
NÐD/D/1
Heavy-trafficApproximationfortheM/D/1Queue 117
Heavy-trafficApproximationfortheNÐD/D/1Queue 119
Cell-scaleQueueinginSwitches 121
9 Burst-ScaleQueueing 125
ATMQueueingBehaviour 125
Burst-scaleQueueingBehaviour 127
CONTENTS ix
Fluid-flowAnalysisofaSingleSource–Per-VCQueueing 129
ContinuousFluid-flowApproach 129
Discrete‘Fluid-flow’Approach 131
ComparingtheDiscreteandContinuousFluid-flowApproaches 136
MultipleON/OFFSourcesoftheSameType 139
TheBufferlessApproach 141
TheBurst-scaleDelayModel 145
10 ConnectionAdmissionControl 149
TheTrafficContract 150
AdmissibleLoad:TheCell-scaleConstraint 151
ACACalgorithmbasedonM/D/1analysis 152
ACACalgorithmbasedonNÐD/D/1analysis 153
Thecell-scaleconstraintinstatistical-bit-ratetransfercapability,basedon 155
M/D/1analysis
AdmissibleLoad:TheBurstScale 157
ApracticalCACscheme 159
EquivalentcellrateandlinearCAC 160
Two-levelCAC 160
Accountingfortheburst-scaledelayfactor 161
CACinTheStandards 165
11 UsageParameterControl 167
ProtectingtheNetwork 167
ControllingtheMeanCellRate 168
AlgorithmsforUPC 172
Theleakybucket 172
PeakCellRateControlusingtheLeakyBucket 173
Theproblemoftolerances 176
Resourcesrequiredforaworst-caseON/OFFcellstreamfrompeakcell 178
rateUPC
Trafficshaping 182
DualLeakyBuckets:TheLeakyCupandSaucer 182
Resourcesrequiredforaworst-caseON/OFFcellstreamfromsustainable 184
cellrateUPC
12 Dimensioning 187
CombiningTheBurstandCellScales 187
DimensioningTheBuffer 190
Smallbuffersforcell-scalequeueing 193
Largebuffersforburst-scalequeueing 198
CombiningTheConnection,BurstandCellScales 200
13 PriorityControl 205
Priorities 205
SpacePriorityandTheCellLossPriorityBit 205
PartialBufferSharing 207
Increasingtheadmissibleload 214
Dimensioningbuffersforpartialbuffersharing 215
TimePriorityinATM 218
Meanvalueanalysis 219
x CONTENTS
PARTIII IPPERFORMANCE 227
ANDTRAFFICMANAGEMENT
14 BasicPacketQueueing 229
TheQueueingBehaviourofPacketsinanIPRouterBuffer 229
BalanceEquationsforPacketBuffering:TheGeo/Geo/1 230
Calculatingthestateprobabilitydistribution 231
DecayRateAnalysis 234
Usingthedecayratetoapproximatethebufferoverflowprobability 236
BalanceEquationsforPacketBuffering:Excess-rateQueueing 238
Analysis
Theexcess-rateM/D/1,forapplicationtovoice-over-IP 239
Theexcess-ratesolutionforbest-efforttraffic 245
15 ResourceReservation 253
QualityofServiceandTrafficAggregation 253
CharacterizinganAggregateofPacketFlows 254
PerformanceAnalysisofAggregatePacketFlows 255
Parameterizingthetwo-stateaggregateprocess 257
Analysingthequeueingbehaviour 259
Voice-over-IP,Revisited 261
TrafficConditioningofAggregateFlows 265
16 IPBufferManagement 267
First-inFirst-outBuffering 267
RandomEarlyDetection–ProbabilisticPacketDiscard 267
VirtualBuffersandSchedulingAlgorithms 273
Precedencequeueing 273
Weightedfairqueueing 274
BufferSpacePartitioning 275
SharedBufferAnalysis 279
17 Self-similarTraffic 287
Self-similarityandLong-range-dependentTraffic 287
TheParetoModelofActivity 289
ImpactofLRDTrafficonQueueingBehaviour 292
TheGeo/Pareto/1Queue 293
References 299
Index 301
Preface
In recent years, we have taught design and performance evaluation
techniques to undergraduates and postgraduates in the Department
of Electronic Engineering at Queen Mary, University of London
(http://www.elec.qmw.ac.uk/)and to graduates on various University
of London M.Sc. courses for industry. We have found that many
engineers and students of engineering experience difficulty in making
sense of teletraffic issues. This is partly because of the subject itself:
the technologies and standards are flexible, complicated, and always
evolving.However,someofthedifficultiesarisebecauseoftheadvanced
mathematical models that have been applied to IP and ATM analysis.
The research literature, and many books reporting on it, is full of
differing analytical approaches applied to a bewildering array of traffic
mixes, buffer management mechanisms, switch designs, and traffic and
congestioncontrolalgorithms.
Tocounterthistrend,ourbook,whichisintendedforusebystudents
bothatfinal-yearundergraduate,andatpostgraduatelevel,andbyprac-
tisingengineersinthetelecommunicationsandInternetworld,provides
an introduction to the design and performance issues surrounding IP
andATM.Wecoverperformanceevaluationbyanalysisandsimulation,
presentingkeyformulasdescribingtrafficandqueueingbehaviour,and
practicalexamples,withgraphsandtablesforthedesignofIPandATM
networks.
Inlinewithourgeneralapproach,derivationsareincludedwherethey
demonstrate an intuitively simple technique; alternatively we give the
formula (and a reference) and then show how to apply it. As a bonus,
the formulas are available as Mathcad files (see below for details) so
there is no need to program them for yourself. In fact, many of the
graphs have the Mathcad code right beside them on the page. We have
ensured that the need for prior knowledge (in particular, probability
theory)hasbeenkepttoaminimum.Wefeelstronglythatthisenhances
the work, both as a textbook and as a design guide; it is far easier to
xii PREFACE
make progress when you are not trying to deal with another subject in
thebackground.
For the second edition, we have added a substantial amount of new
material on IP traffic issues. Since the first edition, much work has
been done in the IP community to make the technology QoS-aware. In
essence,thetechniquesandmechanismstodothisaregeneric–however,
they are often disguised by the use of confusing jargon in the different
communities.Ofcourse,therearerealdifferencesinthetechnologies,but
the underlying approaches for providing guaranteed performance to a
widerangeofservicetypesareverysimilar.
Wehaveintroducednewideasfromourownresearch–moreaccurate,
usable results and understandable derivations. These new ideas make
use of the excess-rate technique for queueing analysis, which we have
found applicable to a wide variety of queueing systems. Whilst we still
do not claim that the book is comprehensive, we do believe it presents
the essentials of design and performance analysis for both IP and ATM
technologiesinanintuitiveandunderstandableway.
Applications analysis software
Where’s the disk or CD? Unlike the first edition, we decided to put
all the Mathcad files on a web-site for the book. But in case you can’t
immediately reach out and click on the Internet, most of the figures
in the book have the Mathcad code used to generate them alongside,
so take a look. Note that where Mathcad functions have been defined
for previous figures, they are not repeated, for clarity. So, check out
http://www.elec.qmw.ac.uk/ipatm/ You’ll also find some homework
problemsthere.
Organization
InChapter1,wedescribebothIPandATMtechnologies.Onthesurface
thetechnologiesappeartoberatherdifferent,butbothdependonsimilar
approachestobuffermanagementandtrafficcontrolinordertoprovide
performance guarantees to a wide variety of services. We highlight
the fundamental operations of both IP and ATM as they relate to the
underlying queueing and performance issues, rather than describe the
technologiesandstandardsindetail.Chapter2istheexecutivesummary
forthebook:itgatherstogethertherangeofanalyticalsolutionscovered,
liststheparameters,andgroupsthemaccordingtotheiruseinaddressing
IPandATMtrafficissues.Youmaywishtoskipoveritonafirstreading,
butuseitafterwardsasareadyreference.