Resource allocation in computer networks: Fundamental principles

155 Pages·2003·0.51 MB·English

by  Zhou, Yunkai

ResourceAllocationinComputerNetworks: FundamentalPrinciplesandPractical
Strategies
AThesis
SubmittedtotheFaculty
of
DrexelUniversity
by
YunkaiZhou
inpartialfulfillmentofthe
requirementsforthedegree
of
DoctorofPhilosophy
May2003

ii
Dedications
This thesis is dedicated to my family, especially to my wife, Dr. Shan Cheng, and my
parents, Mr. Guanghua Zhou and Mrs. Honggen Shi, for their sincere support, encourage-
mentandlove.
iii
Acknowledgments
In retrospect as I approach the completion of my doctorate, I realize that I am deeply
indebted to many people’s assistance and support. I would like to express my genuine
gratitudetoeachofthem,althoughitwouldbeimpossibleformetonameall.
Firstofall,Iwouldliketosincerelythankmyadvisor,Dr. HarishSethu,forhistremen-
dous time and effort spent in leading, supporting and encouraging me during the last five
years. His passion for challenges has given me inspiration; his knowledge of engineering
has givenme guidance; his perseverancein research has givenme confidence. Without his
help and effort, it would be impossible for me to even get close to this point. I am also
grateful to him for being not only a mentor in my professional life but also a friend in my
personallife.
Iwanttoexpressmygratitudetoallcommitteemembersinmycandidacyexamination
and/or my dissertation defense, Dr. Maja Bystrom, Dr. Athina Petropulu, Dr. William
Regli,Dr. WarrenRosenandDr. OlehTretiak,fortheirtimeandvaluablesuggestions.
Many thanks are due to my friends in the Department of Electrical and Computer En-
gineering, who make my life here memorable. I thank Haiguang Cheng and Xueshi Yang
for discussions on traffic modeling. I thank Salil Kanhere, Alpa Parekh, Hongyuan Shi,
Madhusudan Hosaagrahara, Harpreet Arora, Adam O’Donnell and Kunal Shah from our
labfortheircollaboration,discussionsandhelpduringtheseyears. Ialsowanttothankall
theprofessors,staffandstudentsinECEformakingtheDepartmentsuchajoyfulworking
andstudyingenvironment.
I am greatly grateful to my parents, Mr. Guanghua Zhou and Mrs. Honggen Shi,
for their continuous encouragement and support. Finally, my special gratitude is due to
my wife, Dr. Shan Cheng, who has always provided me unconditional love and endless
support. SheisthepersonwhoisthehappiestformewhenImakeprogress,littleorgreat;
iv
she is the person who believes in me and encourages me when I am frustrated; she is the
personwhokeepsmefocusedwhenIamindoubt;sheisthepersonwhomakesmerealize
thatlifeissobeautiful.
v
TableofContents
ListofTables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix
ListofFigures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x
Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xii
Chapter1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.1 Motivation: ResourceAllocationandFairness . . . . . . . . . . . . . . . . 1
1.2 FairnessCriteriaandNotionsofFairness . . . . . . . . . . . . . . . . . . . 4
1.2.1 Max-MinFairness . . . . . . . . . . . . . . . . . . . . . . . . . . 5
1.2.2 UtilityMax-MinFairness . . . . . . . . . . . . . . . . . . . . . . 7
1.2.3 ProportionalFairness . . . . . . . . . . . . . . . . . . . . . . . . . 8
1.2.4 GeneralNotionofFairness . . . . . . . . . . . . . . . . . . . . . . 9
1.3 FairnessinScheduling . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
1.3.1 GeneralizedProcessorSharing . . . . . . . . . . . . . . . . . . . . 12
1.3.2 MeasuresofFairness . . . . . . . . . . . . . . . . . . . . . . . . . 12
1.3.3 WeightedFairQueueing . . . . . . . . . . . . . . . . . . . . . . . 14
1.3.4 Self-ClockedFairQueueing . . . . . . . . . . . . . . . . . . . . . 15
1.3.5 Worst-caseFairWeightedFairQueueing . . . . . . . . . . . . . . 15
1.3.6 DeficitRoundRobin . . . . . . . . . . . . . . . . . . . . . . . . . 16
1.4 AllocationofMultipleResources . . . . . . . . . . . . . . . . . . . . . . . 17
1.4.1 PrioritizedandEssentialResources . . . . . . . . . . . . . . . . . 18
1.5 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
1.6 Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
vi
Chapter2. TheJointAllocationofBufferandBandwidthResources . . . . . . . . . 23
2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
2.1.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
2.1.2 BufferAllocationAlgorithms . . . . . . . . . . . . . . . . . . . . 24
2.1.3 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
2.1.4 Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
2.2 SystemModel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
2.3 ThePrincipleofFairPrioritizedResourceAllocation . . . . . . . . . . . . 33
2.3.1 ResourceDividendsandDemands . . . . . . . . . . . . . . . . . . 33
2.3.2 TheFPRAPrinciple . . . . . . . . . . . . . . . . . . . . . . . . . 35
2.4 ApplicationtoBuffer-LinkSystemModel . . . . . . . . . . . . . . . . . . 39
2.4.1 WhatisFair? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39
2.4.2 AnIdeallyFairAllocationStrategy . . . . . . . . . . . . . . . . . 40
2.5 Packet-by-packetFairBuffering . . . . . . . . . . . . . . . . . . . . . . . 42
2.5.1 ThePFBAlgorithm . . . . . . . . . . . . . . . . . . . . . . . . . 42
2.5.2 FairnessAnalysis . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
2.5.3 ComputationalEfficiency . . . . . . . . . . . . . . . . . . . . . . 48
2.6 MeasureofFairnessandSimulationResults . . . . . . . . . . . . . . . . . 48
2.6.1 MeasureofFairness . . . . . . . . . . . . . . . . . . . . . . . . . 49
2.6.2 SimulationSetup . . . . . . . . . . . . . . . . . . . . . . . . . . . 50
2.6.3 GatewayTrafficTraces . . . . . . . . . . . . . . . . . . . . . . . . 52
2.6.4 VideoTrafficTraces . . . . . . . . . . . . . . . . . . . . . . . . . 55
Chapter3. TheJointAllocationofProcessingandBandwidthResources . . . . . . 58
3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58
vii
3.1.1 BackgroundandMotivation . . . . . . . . . . . . . . . . . . . . . 58
3.1.2 EssentialResources . . . . . . . . . . . . . . . . . . . . . . . . . . 59
3.1.3 DifferencefromPrioritizedResourceAllocation . . . . . . . . . . 61
3.1.4 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62
3.1.5 Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63
3.2 SystemModel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63
3.3 ThePrincipleofFairEssentialResourceAllocation . . . . . . . . . . . . . 64
3.3.1 NotionofFairness . . . . . . . . . . . . . . . . . . . . . . . . . . 64
3.3.2 TheConceptofthePrimeResource . . . . . . . . . . . . . . . . . 65
3.3.3 TheFERAPrinciple . . . . . . . . . . . . . . . . . . . . . . . . . 66
3.3.4 FairWork-ConservingAllocationPolicy . . . . . . . . . . . . . . 72
3.4 FairJointAllocationofProcessingandBandwidthResources . . . . . . . . 75
3.4.1 SystemModel . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76
3.4.2 Fluid-flowProcessorandLinkSharing . . . . . . . . . . . . . . . 76
3.4.3 Packet-by-packetProcessorandLinkSharing . . . . . . . . . . . . 77
3.4.4 FairnessAnalysisofPPLS . . . . . . . . . . . . . . . . . . . . . . 82
3.5 SimulationResultsandAnalysis . . . . . . . . . . . . . . . . . . . . . . . 87
3.5.1 SyntheticTraffic . . . . . . . . . . . . . . . . . . . . . . . . . . . 88
3.5.2 GatewayTrafficTraces . . . . . . . . . . . . . . . . . . . . . . . . 91
3.5.3 EffectofMaximumDeficitCounter . . . . . . . . . . . . . . . . . 92
3.6 DiscussionsonImplementationofPPLS . . . . . . . . . . . . . . . . . . . 93
Chapter4. ADiscussiononExtensionstoMultipleOutputLinkSystems . . . . . . 95
4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95
4.1.1 MotivationandChallenges . . . . . . . . . . . . . . . . . . . . . . 95
viii
4.1.2 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97
4.1.3 Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98
4.2 MultipleOutputLinkSystemModel . . . . . . . . . . . . . . . . . . . . . 99
4.2.1 SystemModel . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99
4.2.2 SystemDecomposition . . . . . . . . . . . . . . . . . . . . . . . . 102
4.3 FairnessinMultipleOutputLinkSystems . . . . . . . . . . . . . . . . . . 104
4.3.1 FairnessinSharedLinkSubsystems . . . . . . . . . . . . . . . . . 105
4.3.2 FairnessinanUnsharedLinkSubsystem . . . . . . . . . . . . . . 106
4.3.3 FairnessinBufferAllocation . . . . . . . . . . . . . . . . . . . . . 112
4.4 AMeasureofFairness . . . . . . . . . . . . . . . . . . . . . . . . . . . . 112
4.4.1 Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 112
4.4.2 RelationshiptoFairnesswithinComponentSubsystems . . . . . . 115
4.5 AllocationofProcessingResource . . . . . . . . . . . . . . . . . . . . . . 119
Chapter5. Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122
5.1 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122
5.2 ConcludingRemarksandFutureWork . . . . . . . . . . . . . . . . . . . . 124
Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 128
AppendixA.RelationshipbetweenAFBandRFB . . . . . . . . . . . . . . . . . . 133
Vita . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
ix
ListofTables
2.1 Entrypoliciesevaluated. . . . . . . . . . . . . . . . . . . . . . . . . . . . 51
2.2 Exitpoliciesevaluated. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52
3.1 Examples illustrating what is a fair allocation in a system with a shared
processorP andasharedlinkL. Inalloftheseexamples,thetotalamounts
ofthesharedresourcesare,respectively,100MHzforP and100Mbpsfor
L. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67
3.2 The ratio of the processing resource to the link resource required by each
flow. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89