ebook img

Network Routing: Algorithms, Protocols, and Architectures PDF

957 Pages·2007·28.45 MB·English
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview Network Routing: Algorithms, Protocols, and Architectures

Network Routing The Morgan Kaufmann Series in Networking SeriesEditor,DavidClark,M.I.T. ComputerNetworks:ASystemsApproach,4e NetworkArchitecture,Analysis,andDesign,2e LarryL.PetersonandBruceS.Davie JamesD.McCabe NetworkRouting:Algorithms,Protocols,andArchitectures MPLSNetworkManagement:MIBs,Tools,andTechniques DeepankarMedhiandKarthikeyanRamasamy ThomasD.Nadeau DeployingIPandMPLSQoSforMultiserviceNetworks: DevelopingIP-BasedServices:SolutionsforServiceProviders TheoryandPractice andVendors JohnEvansandClarenceFilsfils MoniqueMorrowandKateelVijayananda TrafficEngineeringandQoSOptimizationofIntegratedVoice TelecommunicationsLawintheInternetAge andDataNetworks SharonK.Black GeraldR.Ash OpticalNetworks:APracticalPerspective,2e IPv6CoreProtocolsImplementation RajivRamaswamiandKumarN.Sivarajan QingLi,TatuyaJinmei,andKeiichiShima InternetQoS:ArchitecturesandMechanisms SmartPhoneandNext-GenerationMobileComputing ZhengWang PeiZhengandLionelNi TCP/IPSocketsinJava:PracticalGuideforProgrammers GMPLS:ArchitectureandApplications MichaelJ.DonahooandKennethL.Calvert AdrianFarrelandIgorBryskin TCP/IPSocketsinC:PracticalGuideforProgrammers NetworkSecurity:APracticalApproach KennethL.CalvertandMichaelJ.Donahoo JanL.Harrington MulticastCommunication:Protocols,Programming,and ContentNetworking:Architecture,Protocols,andPractice Applications MarkusHofmannandLelandR.Beaumont RalphWittmannandMartinaZitterbart NetworkAlgorithmics:AnInterdisciplinaryApproachto MPLS:TechnologyandApplications DesigningFastNetworkedDevices BruceS.DavieandYakovRekhter GeorgeVarghese High-PerformanceCommunicationNetworks,2e NetworkRecovery:ProtectionandRestorationofOptical, JeanWalrandandPravinVaraiya SONET-SDH,IP,andMPLS JeanPhilippeVasseur,MarioPickavet,and InternetworkingMultimedia PietDemeester JonCrowcroft,MarkHandley,andIanWakeman Routing,Flow,andCapacityDesigninCommunicationand UnderstandingNetworkedApplications:AFirstCourse ComputerNetworks DavidG.Messerschmitt MichałPióroandDeepankarMedhi IntegratedManagementofNetworkedSystems:Concepts, WirelessSensorNetworks:AnInformationProcessing Architectures,andtheirOperationalApplication Approach Heinz-GerdHegering,SebastianAbeck,andBernhard FengZhaoandLeonidasGuibas Neumair CommunicationNetworking:AnAnalyticalApproach VirtualPrivateNetworks:MakingtheRightConnection AnuragKumar,D.Manjunath,andJoyKuri DennisFowler TheInternetandItsProtocols:AComparativeApproach NetworkedApplications:AGuidetotheNewComputing AdrianFarrel Infrastructure ModernCableTelevisionTechnology:Video,Voice,andData DavidG.Messerschmitt Communications,2e WalterCiciora,JamesFarmer,DavidLarge,andMichael WideAreaNetworkDesign:ConceptsandToolsfor Adams Optimization RobertS.Cahn BluetoothApplicationProgrammingwiththeJavaAPIs C.BalaKumar,PaulJ.Kline,andTimothyJ.Thompson Policy-BasedNetworkManagement:SolutionsfortheNext Forfurtherinformationonthesebooksandforalistof Generation forthcomingtitles, JohnStrassner pleasevisitourWebsiteathttp://www.mkp.com. Network Routing Algorithms, Protocols, and Architectures Deepankar Medhi Karthikeyan Ramasamy AMSTERDAM•BOSTON•HEIDELBERG•LONDON NEWYORK•OXFORD•PARIS•SANDIEGO SANFRANCISCO•SINGAPORE•SYDNEY•TOKYO MorganKaufmannisanimprintofElsevier SeniorAcquisitionsEditor RickAdams AcquisitionsEditor RachelRoumeliotis PublishingServicesManager GeorgeMorrison SeniorProductionEditor DawnmarieSimpson CoverDesign EricDeCicco/YvoRiezebosDesign CoverImage GettyImages Composition VTEX Copyeditor SPi Proofreader SPi Indexer SPi Interiorprinter TheMaple-VailBookManufacturingGroup Coverprinter PhoenixColor,Inc. MorganKaufmannPublishersisanimprintofElsevier. 500SansomeStreet,Suite400,SanFrancisco,CA94111 Thisbookisprintedonacid-freepaper. (cid:2)c2007byElsevierInc.Allrightsreserved. Designationsusedbycompaniestodistinguishtheirproductsareoftenclaimedastrademarksorregisteredtrademarks. InallinstancesinwhichMorganKaufmannPublishersisawareofaclaim,theproductnamesappearininitialcapitalor allcapitalletters.Readers,however,shouldcontacttheappropriatecompaniesformorecompleteinformationregarding trademarksandregistration. Nopartofthispublicationmaybereproduced,storedinaretrievalsystem,ortransmittedinanyformorbyanymeans— electronic,mechanical,photocopying,scanning,orotherwise—withoutpriorwrittenpermissionofthepublisher. PermissionsmaybesoughtdirectlyfromElsevier’sScience&TechnologyRightsDepartmentinOxford,UK:phone:(+44) 1865843830,fax:(+44)1865853333,E-mail:permissions@elsevier.com.Youmayalsocompleteyourrequestonlineviathe Elsevierhomepage(http://elsevier.com),byselecting “Support&Contact”then“CopyrightandPermission”andthen“ObtainingPermissions.” LibraryofCongressCataloging-in-PublicationData Medhi,Deepankar. Networkrouting:algorithms,protocols,andarchitectures/DeepankarMedhi,KarthikeyanRamasamy. p.cm. Includesbibliographicalreferencesandindex. ISBN-13:978-0-12-088588-6(hardcover:alk.paper) ISBN-10:0-12-088588-3(hardcover:alk.paper)1.Computernetworks.2.Routers(Computernetworks)3.Computer networkarchitectures.I.Ramasamy,Karthikeyan,1967-II.Title. TK5105.5.M4252007 004.6–dc22 2006028700 ISBN13:978-0-12-088588-6 ISBN10:0-12-088588-3 ForinformationonallMorganKaufmannpublications, visitourWebsiteatwww.mkp.comorwww.books.elsevier.com PrintedintheUnitedStatesofAmerica 07080910 54321 To Karen, Neiloy, and Robby: the core routers in our dynamic network where the distance costvariesinstantaneouslyandovertime,andwherealternateroutingandloopingoccur... Love, Deep/Dad Tomyparents,R.ChellammalandN.Ramasamy—backplaneofmylife. Loveandregards, Karthik This page intentionally left blank Contents Foreword xxiii Preface xxv AbouttheAuthors xxxi Part I: Network Routing: Basics and Foundations 1 1 NetworkingandNetwork Routing:AnIntroduction 2 1.1 AddressingandInternetService:AnOverview 4 1.2 NetworkRouting:AnOverview 5 1.3 IPAddressing 7 1.3.1 ClassfulAddressingScheme 8 1.3.2 Subnetting/Netmask 9 1.3.3 ClasslessInterdomainRouting 10 1.4 OnArchitectures 11 1.5 ServiceArchitecture 12 1.6 ProtocolStackArchitecture 13 1.6.1 OSIReferenceModel 13 1.6.2 IPProtocolStackArchitecture 14 1.7 RouterArchitecture 19 1.8 NetworkTopologyArchitecture 20 1.9 NetworkManagementArchitecture 21 1.10 PublicSwitchedTelephoneNetwork 21 1.11 CommunicationTechnologies 22 1.12 StandardsCommittees 24 1.12.1 InternationalTelecommunicationUnion 24 1.12.2 InternetEngineeringTaskForce 25 1.12.3 MFAForum 25 1.13 LastTwoBits 25 1.13.1 Type-Length-Value 25 1.13.2 NetworkProtocolAnalyzer 26 viii Contents 1.14 Summary 26 FurtherLookup 27 Exercises 27 2 RoutingAlgorithms:ShortestPathandWidestPath 30 2.1 Background 31 2.2 Bellman–FordAlgorithmandtheDistanceVectorApproach 33 2.2.1 CentralizedView:Bellman–FordAlgorithm 33 2.2.2 DistributedView:ADistanceVectorApproach 36 2.3 Dijkstra’sAlgorithm 38 2.3.1 CentralizedApproach 38 2.3.2 DistributedApproach 40 2.4 ComparisonoftheBellman–FordAlgorithmandDijkstra’sAlgorithm 42 2.5 ShortestPathComputationwithCandidatePathCaching 43 2.6 WidestPathComputationwithCandidatePathCaching 45 2.7 WidestPathAlgorithm 47 2.7.1 Dijkstra-BasedApproach 47 2.7.2 Bellman–Ford-BasedApproach 49 2.8 k-ShortestPathsAlgorithm 49 2.9 Summary 51 FurtherLookup 53 Exercises 53 3 RoutingProtocols: Framework andPrinciples 56 3.1 RoutingProtocol,RoutingAlgorithm,andRoutingTable 57 3.2 RoutingInformationRepresentationandProtocolMessages 59 3.3 DistanceVectorRoutingProtocol 60 3.3.1 ConceptualFrameworkandIllustration 60 3.3.2 WhyTimersMatter 66 3.3.3 Solutions 70 3.3.4 CanWeAvoidLoops? 74 3.3.5 DistanceVectorProtocolBasedonDiffusingComputationwith CoordinatedUpdate 74 3.4 LinkStateRoutingProtocol 82 3.4.1 LinkStateProtocol:In-BandHop-by-HopDisseminations 83 3.4.2 LinkStateProtocol:In-BandBasedonEnd-to-EndSession 91 3.4.3 RouteComputation 92 3.5 PathVectorRoutingProtocol 93 3.5.1 BasicPrinciple 93 3.5.2 PathVectorwithPathCaching 97 3.6 LinkCost 102 3.6.1 ARPANETRoutingMetrics 102 3.6.2 OtherMetrics 103 Contents ix 3.7 Summary 104 FurtherLookup 105 Exercises 105 4 Network FlowModeling 108 4.1 Terminologies 109 4.2 Single-CommodityNetworkFlow 110 4.2.1 AThree-NodeIllustration 110 4.2.2 FormalDescriptionandMinimumCostRoutingObjective 111 4.2.3 VariationinObjective:LoadBalancing 114 4.2.4 VariationinObjective:AverageDelay 116 4.2.5 SummaryandApplicability 117 4.3 MulticommodityNetworkFlow:Three-NodeExample 118 4.3.1 MinimumCostRoutingCase 118 4.3.2 LoadBalancing 123 4.3.3 AverageDelay 125 4.4 MulticommodityNetworkFlowProblem:GeneralFormulation 128 4.4.1 BackgroundonNotation 129 4.4.2 Link-PathFormulation 130 4.4.3 Node-LinkFormulation 135 4.5 MulticommodityNetworkFlowProblem:Non-SplittableFlow 137 4.6 Summary 138 FurtherLookup 139 Exercises 139 Part II: Routing in IP Networks 141 5 IPRoutingandDistanceVectorProtocolFamily 142 5.1 Routers,Networks,andRoutingInformation:SomeBasics 143 5.1.1 RoutingTable 143 5.1.2 CommunicationofRoutingInformation 146 5.2 StaticRoutes 146 5.3 RoutingInformationProtocol,Version1(RIPv1) 147 5.3.1 CommunicationandMessageFormat 147 5.3.2 GeneralOperation 149 5.3.3 IsRIPv1GoodtoUse? 150 5.4 RoutingInformationProtocol,Version2(RIPv2) 150 5.5 InteriorGatewayRoutingProtocol(IGRP) 153 5.5.1 PacketFormat 153 5.5.2 ComputingCompositeMetric 154 5.6 EnhancedInteriorGatewayRoutingProtocol(EIGRP) 157 5.6.1 PacketFormat 157 5.7 RouteRedistribution 160 5.8 Summary 161

Description:
Network routing can be broadly categorized into Internet routing, PSTN routing, and telecommunication transport network routing. This book systematically considers these routing paradigms, as well as their interoperability. The authors discuss how algorithms, protocols, analysis, and operational dep
See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.