NetworkAlgorithmics
SecondEdition
GeorgeVarghese
UCLADepartmentofComputerScience
LosAngeles,CA,UnitedStates
JunXu
SchoolofComputerScience
GeorgiaInstituteofTechnology
Atlanta,GA,UnitedStates
MorganKaufmannisanimprintofElsevier 50HampshireStreet,5thFloor,Cambridge,MA02139,UnitedStates
Copyright©2022ElsevierInc.Allrightsreserved.
Nopartofthispublicationmaybereproducedortransmittedinanyformorbyanymeans,electronicormechanical, includingphotocopying,recording,oranyinformationstorageandretrievalsystem,withoutpermissioninwritingfromthe publisher.Detailsonhowtoseekpermission,furtherinformationaboutthePublisher’spermissionspoliciesandour arrangementswithorganizationssuchastheCopyrightClearanceCenterandtheCopyrightLicensingAgency,canbefound atourwebsite: www.elsevier.com/permissions
ThisbookandtheindividualcontributionscontainedinitareprotectedundercopyrightbythePublisher(otherthanasmay benotedherein).
Notices
Knowledgeandbestpracticeinthisfieldareconstantlychanging.Asnewresearchandexperiencebroadenour understanding,changesinresearchmethods,professionalpractices,ormedicaltreatmentmaybecomenecessary.
Practitionersandresearchersmustalwaysrelyontheirownexperienceandknowledgeinevaluatingandusingany information,methods,compounds,orexperimentsdescribedherein.Inusingsuchinformationormethodstheyshouldbe mindfuloftheirownsafetyandthesafetyofothers,includingpartiesforwhomtheyhaveaprofessionalresponsibility.
Tothefullestextentofthelaw,neitherthePublishernortheauthors,contributors,oreditors,assumeanyliabilityforany injuryand/ordamagetopersonsorpropertyasamatterofproductsliability,negligenceorotherwise,orfromanyuseor operationofanymethods,products,instructions,orideascontainedinthematerialherein.
ISBN:978-0-12-809927-8
ForinformationonallMorganKaufmannandElsevierpublications visitourwebsiteat https://www.elsevier.com/books-and-journals
Publisher: MaraConner
EditorialProjectManager: LindsayC.Lawrence
ProductionProjectManager: ManchuMohan
CoverDesigner: MatthewLimbert
TypesetbyVTeX
ForAjuandTimandAndrew,whomadeallthispossible...
PART1THERULESOFTHEGAME
2.2.5Memorysubsystemdesigntechniques
2.2.6Component-leveldesign
2.2.7Finalhardwarelessons...................................32 2.3
2.3.1Endnodearchitecture..
2.6
2.4.2Infinitememoryviavirtualmemory.........................42
3.3.2Principlesformodularitywithefficiency..
3.3.3Principlesforspeedinguproutines
4.2 Schedulerforasynchronoustransfermodeflowcontrol
PART2PLAYINGWITHENDNODES
CHAPTER5Copyingdata
5.1 Whydatacopies
5.2 Reducingcopyingvialocalrestructuring
5.2.1Exploitingadaptormemory...
5.2.2Usingcopy-on-write.....................................117
5.2.3Fbufs:optimizingpageremapping
5.2.4Transparentlyemulatingcopysemantics......................123
5.2.5Arezerocopiesusedtoday?..
5.3 AvoidingcopyingusingremoteDMA..............................126
5.3.1Avoidingcopyinginacluster..............................127
5.3.2Modern-dayincarnationsofRDMA
5.4 Broadeningtofilesystems .......................................131
5.4.1Sharedmemory .........................................131
5.4.2IO-lite:aunifiedviewofbuffering. ..........................132
5.4.3AvoidingfilesystemcopiesviaI/Osplicing...
5.5 Broadeningbeyondcopies .......................................134
5.6 Broadeningbeyonddatamanipulations...
5.6.1Usingcacheseffectively ..................................137
5.6.2DirectmemoryaccessversusprogrammedI/O
5.7 Conclusions ..................................................142
5.8 Exercises....................................................143
............................................
6.1 Whycontroloverhead? .........................................147
6.2 Avoidingschedulingoverheadinnetworkingcode
6.2.1Makinguser-levelprotocolimplementationsreal
6.3 Avoidingcontext-switchingoverheadinapplications..
6.3.1Processperclient .......................................154
6.3.2Threadperclient........................................155
6.3.3Event-drivenscheduler ...................................155
6.3.4Event-drivenserverwithhelperprocesses.....................157
6.3.5Task-basedstructuring....................................158
6.4 ScalableI/ONotification ........................................159
6.4.1Aservermystery........................................159
6.4.2Problemswithimplementationsof select() .....................160
6.4.3Analysisof select() ......................................162
6.4.4Speedingup select() withoutchangingtheAPI
6.4.5Speedingup select() bychangingtheAPI .....................164
6.5 AvoidingsystemcallsorKernelBypass... ..........................166
6.5.1Thevirtualinterfacearchitectureproposal .....................169
6.5.2DataPlaneDevelopmentKit(DPDK)........................169
6.5.3SingleRootI/OVirtualization(SR-IOV)......................170
6.6 RadicalRestructuringofOperatingSystems..........................171
6.7 Reducinginterrupts ............................................172
6.7.1Avoidingreceiverlivelock .................................173
6.8 Conclusions ..................................................174
6.9 Exercises....................................................175
CHAPTER7Maintainingtimers
7.1 Whytimers?.................................................180
7.2 Modelandperformancemeasures .................................181
7.3 Simplesttimerschemes .........................................182
7.4 Timingwheels ................................................183
7.5 Hashedwheels ................................................185
7.6 Hierarchicalwheels ............................................187
7.7 BSDimplementation...........................................189
8.1 Opportunitiesandchallengesofearlydemultiplexing
8.2
8.3 CMU/Stanfordpacketfilter:pioneeringpacketfilters
8.4 Berkeleypacketfilter:enablinghigh-performancemonitoring.
8.5 Pathfinder:factoringoutcommonchecks
8.6 Dynamicpacketfilter:compilerstotherescue
8.7 Conclusions...
8.8
PART3PLAYINGWITHROUTERS
11.1.3Lookupmodel
11.2.3Statusoftagswitching,flowswitching,andmultiprotocollabel
11.3 Non-algorithmictechniquesforprefixmatching
12.4.6Content-addressablememories
12.5 Two-dimensionalschemes. ......................................304
12.5.1Fastsearchingusingset-pruningtries........................305
12.5.2Reducingmemoryusingbacktracking
12.5.3Thebestofbothworlds:gridoftries.........................308
12.6 Approachestogeneralrulesets ...................................311
12.6.1Geometricviewofclassification............................311
12.6.2Beyondtwodimensions:thebadnews
12.6.3Beyondtwodimensions:thegoodnews...
12.7 Extendingtwo-dimensionalschemes..
13.13.1Derive R(t) fromthearrivalgraph...........................353 13.13.2Merge R(t) with S(t 1)
13.17 Combinedinputandoutputqueueing..
13.18 Scalingtolargerandfasterswitches
13.18.2Adivide-and-conquerapproachtobuildinglargeswitches.
13.18.3Closnetworksformedium-sizedrouters......................366
13.18.4Benesnetworksforlargerrouters.
13.18.5Load-balancedswitching
13.19 Scalingtofasterlinkspeeds...
14.9.2RecursivedefinitionofGPSvirtualstartandfinishtimes..
14.9.3Anotherpacketarrivalscenario...
Weightedfairqueueing
14.12 ThedatastructureandalgorithmforefficientGPSclocktracking..
14.12.2Augmenteddatastructures................................411
14.12.3The“shape”datastructure .................................413
14.13 ImplementingWFQandWF2 Q...................................418 14.14 Quickfairqueueing(QFQ)...
14.14.1Fairroundrobin(FRR)algorithm.
14.14.2HowQFQimprovesuponFRR...
14.15 Towardsprogrammablepacketscheduling.
14.15.1Push-InFirst-Out(PIFO)framework.........................422
14.15.2Universalpacketscheduler ................................423
14.16 Scalablefairqueuing ...........................................424
14.16.1Randomaggregation.. ...................................425
PART4ENDGAME
Another random document with no related content on Scribd:
If the second copy is also defective, you may demand a refund in writing without further opportunities to fix the problem.
1.F.4. Except for the limited right of replacement or refund set forth in paragraph 1.F.3, this work is provided to you ‘AS-IS’, WITH NO OTHER WARRANTIES OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY PURPOSE.
1.F.5. Some states do not allow disclaimers of certain implied warranties or the exclusion or limitation of certain types of damages. If any disclaimer or limitation set forth in this agreement violates the law of the state applicable to this agreement, the agreement shall be interpreted to make the maximum disclaimer or limitation permitted by the applicable state law. The invalidity or unenforceability of any provision of this agreement shall not void the remaining provisions.
1.F.6. INDEMNITY - You agree to indemnify and hold the Foundation, the trademark owner, any agent or employee of the Foundation, anyone providing copies of Project Gutenberg™ electronic works in accordance with this agreement, and any volunteers associated with the production, promotion and distribution of Project Gutenberg™ electronic works, harmless from all liability, costs and expenses, including legal fees, that arise directly or indirectly from any of the following which you do or cause to occur: (a) distribution of this or any Project Gutenberg™ work, (b) alteration, modification, or additions or deletions to any Project Gutenberg™ work, and (c) any Defect you cause.
Section 2. Information about the Mission of
Project Gutenberg™ is synonymous with the free distribution of electronic works in formats readable by the widest variety of computers including obsolete, old, middle-aged and new computers. It exists because of the efforts of hundreds of volunteers and donations from people in all walks of life.
Volunteers and financial support to provide volunteers with the assistance they need are critical to reaching Project Gutenberg™’s goals and ensuring that the Project Gutenberg™ collection will remain freely available for generations to come. In 2001, the Project Gutenberg Literary Archive Foundation was created to provide a secure and permanent future for Project Gutenberg™ and future generations. To learn more about the Project Gutenberg Literary Archive Foundation and how your efforts and donations can help, see Sections 3 and 4 and the Foundation information page at www.gutenberg.org.
Section 3. Information about the Project
