Network Algorithmics,: An Interdisciplinary Approach to Designing Fast Networked Devices (The Morgan Kaufmann Series in Networking)

491 Pages·2004·2.98 MB·English

by  George Varghese

Network Algorithmics
TheMorganKaufmannSeriesinNetworking
SeriesEditor,DavidClark,M.I.T.
NetworkAlgorithmics:AnInterdisciplinaryApproachto OpticalNetworks:APracticalPerspective,2e
DesigningFastNetworkedDevices
RajivRamaswamiandKumarN.Sivarajan
GeorgeVarghese
InternetQoS:ArchitecturesandMechanisms
NetworkRecovery:ProtectionandRestorationofOptical,
ZhengWang
SONET-SDH,IP,andMPLS
JeanPhilippeVasseur,MarioPickavet,andPietDemeester TCP/IPSocketsinJava:PracticalGuideforProgrammers
MichaelJ.DonahooandKennethL.Calvert
Routing,Flow,andCapacityDesigninCommunication
andComputerNetworks
TCP/IPSocketsinC:PracticalGuideforProgrammers
MichalPióroandDeepankarMedhi
KennethL.CalvertandMichaelJ.Donahoo
WirelessSensorNetworks:AnInformationProcessing
MulticastCommunication:Protocols,Programming,
Approach
andApplications
FengZhaoandLeonidasGuibas
RalphWittmannandMartinaZitterbart
CommunicationNetworking:AnAnalyticalApproach
MPLS:TechnologyandApplications
AnuragKumar,D.Manjunath,andJoyKuri
BruceDavieandYakovRekhter
TheInternetandItsProtocols:AComparativeApproach
High-PerformanceCommunicationNetworks,2e
AdrianFarrel
JeanWalrandandPravinVaraiya
ModernCableTelevisionTechnology:Video,Voice,and
InternetworkingMultimedia
DataCommunications,2e
JonCrowcroft,MarkHandley,andIanWakeman
WalterCiciora,JamesFarmer,DavidLarge,andMichaelAdams
UnderstandingNetworkedApplications:AFirstCourse
BluetoothApplicationProgrammingwiththeJavaAPIs
DavidG.Messerschmitt
C.BalaKumar,PaulJ.Kline,andTimothyJ.Thompson
IntegratedManagementofNetworkedSystems:Concepts,
Policy-BasedNetworkManagement:Solutionsfor
Architectures,andTheirOperationalApplications
theNextGeneration
Heinz-GerdHegering,SebastianAbeck,andBernhardNeumair
JohnStrassner
VirtualPrivateNetworks:MakingtheRightConnection
ComputerNetworks:ASystemsApproach,3e
DennisFowler
LarryL.PetersonandBruceS.Davie
NetworkedApplications:AGuidetotheNewComputing
NetworkArchitecture,Analysis,andDesign,2e
Infrastructure
JamesD.McCabe
DavidG.Messerschmitt
MPLSNetworkManagement:MIBs,Tools,andTechniques
WideAreaNetworkDesign:ConceptsandToolsfor
ThomasD.Nadeau Optimization
DevelopingIP-BasedServices:SolutionsforService RobertS.Cahn
ProvidersandVendors
MoniqueMorrowandKateelVijayananda
TelecommunicationsLawintheInternetAge Forfurtherinformationonthesebooksandforalistofforth-
SharonK.Black comingtitles,pleasevisitourwebsiteathttp://www.mkp.com.
Network Algorithmics
An Interdisciplinary Approach to Designing
Fast Networked Devices
George Varghese
UniversityofCalifornia,SanDiego
AMSTERDAM•BOSTON(cid:127)HEIDELBERG(cid:127)LONDON
NEWYORK(cid:127)OXFORD(cid:127)PARIS(cid:127)SANDIEGO
SANFRANCISCO(cid:127)SINGAPORE(cid:127)SYDNEY(cid:127)TOKYO
MORGANKAUFMANNPUBLISHERSISANIMPRINTOFELSEVIER
Elsevier/MorganKaufmann CoverImage:GettyImages
PublishingDirector:DianeD.Cerra TextDesign:MichaelRemener
SeniorAcquisitionsEditor:RickAdams Composition:CEPHA
AssociateEditor:KarynJohnson TechnicalIllustration:DartmouthPublishing,Inc.
EditorialCoordinator:MonaBuehler Copyeditor:ElliotSimon
PublishingServicesManager:SimonCrump Proofreader:PhyllisCoyneetal.
SeniorProjectManager:AngelaDooley Indexer:NorthwindEditorial
CoverDesignManager:CateRickardBarr InteriorPrinter:TheMaple-VailBookManufacturingGroup
CoverDesign:YvoRiezebosDesign CoverPrinter:PhoenixColor
MorganKaufmannisanimprintofElsevier.
500SansomeStreet,Suite400,SanFrancisco,CA94111
Thisbookisprintedonacid-freepaper.
©2005byElsevierInc.
Designationsusedbycompaniestodistinguishtheirproductsareoftenclaimedastrademarksorregistered
trademarks.InallinstancesinwhichElsevierisawareofaclaim,theproductnamesappearininitialcapitalorall
capitalletters.Readers,however,shouldcontacttheappropriatecompaniesformorecompleteinformationregarding
trademarksandregistration.
Nopartofthispublicationmaybereproduced,storedinaretrievalsystem,ortransmittedinanyformorbyanymeans
electronic,mechanical,photocopying,scanning,orotherwisewithoutpriorwrittenpermissionofthepublisher.
PermissionsmaybesoughtdirectlyfromElsevier’sScience&TechnologyRightsDepartmentinOxford,UK:phone:
([phone],fax:[phone],e-mail:[email protected]
requeston-lineviatheElsevierhomepage(http://elsevier.com)byselecting“CustomerSupport”andthen“Obtaining
Permissions.”
LibraryofCongressCataloging-in-PublicationData
Applicationsubmitted
ISBN:0-12-088477-1
ForinformationonallMorganKaufmannpublications,
visitourwebsiteatwww.mkp.com.
PrintedintheUnitedStatesofAmerica
08 07 06 05 04 5 4 3 2 1
ForAjuandTimandAndrew,whomadeallthispossible...

C O N T E N T S
PREFACE xix
PART I The Rules of the Game 1
CHAPTER 1 Introducing Network Algorithmics 3
1.1 TheProblem:NetworkBottlenecks 3
1.1.1 EndnodeBottlenecks 4
1.1.2 RouterBottlenecks 5
1.2 TheTechniques:NetworkAlgorithmics 7
1.2.1 Warm-upExample:ScentinganEvilPacket 8
1.2.2 StrawmanSolution 9
1.2.3 ThinkingAlgorithmically 9
1.2.4 RefiningtheAlgorithm:ExploitingHardware 10
1.2.5 CleaningUp 11
1.2.6 CharacteristicsofNetworkAlgorithmics 13
1.3 Exercise 15
CHAPTER 2 Network Implementation Models 16
2.1 Protocols 17
2.1.1 TransportandRoutingProtocols 17
2.1.2 AbstractProtocolModel 17
2.1.3 PerformanceEnvironmentandMeasures 19
2.2 Hardware 21
2.2.1 CombinatorialLogic 21
2.2.2 TimingandPower 22
vii
viii Contents
2.2.3 RaisingtheAbstractionLevelofHardwareDesign 23
2.2.4 Memories 25
2.2.5 MemorySubsystemDesignTechniques 29
2.2.6 Component-LevelDesign 30
2.2.7 FinalHardwareLessons 31
2.3 NetworkDeviceArchitectures 32
2.3.1 EndnodeArchitecture 32
2.3.2 RouterArchitecture 34
2.4 OperatingSystems 39
2.4.1 UninterruptedComputationviaProcesses 39
2.4.2 InfiniteMemoryviaVirtualMemory 41
2.4.3 SimpleI/OviaSystemCalls 43
2.5 Summary 44
2.6 Exercises 44
CHAPTER 3 Fifteen Implementation Principles 50
3.1 Motivating the Use of Principles — Updating Ternary Content-Addressable
Memories 50
3.2 AlgorithmsversusAlgorithmics 54
3.3 Fifteen Implementation Principles — Categorization and Description 56
3.3.1 SystemsPrinciples 56
3.3.2 PrinciplesforModularitywithEfficiency 61
3.3.3 PrinciplesforSpeedingUpRoutines 63
3.4 DesignversusImplementationPrinciples 65
3.5 Caveats 66
3.5.1 EightCautionaryQuestions 68
3.6 Summary 70
3.7 Exercises 70
CHAPTER 4 Principles in Action 73
4.1 BufferValidationofApplicationDeviceChannels 74
4.2 SchedulerforAsynchronousTransferModeFlowControl 76
4.3 RouteComputationUsingDijkstra’sAlgorithm 77
4.4 EthernetMonitorUsingBridgeHardware 80
Contents ix
4.5 DemultiplexingintheX-Kernel 81
4.6 TrieswithNodeCompression 83
4.7 PacketFilteringinRouters 85
4.8 AvoidingFragmentationofLinkStatePackets 87
4.9 PolicingTrafficPatterns 90
4.10 IdentifyingaResourceHog 92
4.11 GettingRidoftheTCPOpenConnectionList 93
4.12 AcknowledgmentWithholding 96
4.13 IncrementallyReadingaLargeDatabase 98
4.14 BinarySearchofLongIdentifiers 100
4.15 VideoConferencingviaAsynchronousTransferMode 102
PART II Playing with Endnodes 105
CHAPTER 5 Copying Data 107
5.1 WhyDataCopies 109
5.2 ReducingCopyingviaLocalRestructuring 111
5.2.1 ExploitingAdaptorMemory 111
5.2.2 UsingCopy-on-Write 113
5.2.3 Fbufs:OptimizingPageRemapping 115
5.2.4 TransparentlyEmulatingCopySemantics 119
5.3 AvoidingCopyingUsingRemoteDMA 121
5.3.1 AvoidingCopyinginaCluster 122
5.3.2 Modern-DayIncarnationsofRDMA 123
5.4 BroadeningtoFileSystems 125
5.4.1 SharedMemory 125
5.4.2 IO-Lite:AUnifiedViewofBuffering 126
5.4.3 AvoidingFileSystemCopiesviaI/OSplicing 128
5.5 BroadeningbeyondCopies 129
5.6 BroadeningbeyondDataManipulations 131
5.6.1 UsingCachesEffectively 131
5.6.2 DirectMemoryAccessversusProgrammedI/O 135