Routing, Flow, and Capacity Design in Communication and Computer Networks

794 Pages·2004·11.389 MB·English

by  Michal Pioro, Deepankar Medhi

Routing, Flow, and Capacity Design
in
Communication and Computer Networks
TheMorganKaufmannSeriesinNetworking
SeriesEditor,DavidClark,M.I.T.
Routing,Flow,andCapacityDesignin OpticalNetworks:APracticalPerspective,2e
CommunicationandComputerNetworks RajivRamaswamiandKumarN.Sivarajan
MichalPióroandDeepankarMedhi
InternetQoS:ArchitecturesandMechanisms
WirelessSensorNetworks:AnInformation ZhengWang
ProcessingApproach
TCP/IPSocketsinJava:PracticalGuidefor
FengZhaoandLeonidasGuibas
Programmers
NetworkRecovery:ProtectionandRestoration MichaelJ.DonahooandKennethL.Calvert
ofOptical,SONET-SDH,IP,andMPLS
TCP/IPSocketsinC:PracticalGuidefor
JeanPhilippeVasseur,MarioPickavet,andPiet
Programmers
Demeester
KennethL.CalvertandMichaelJ.Donahoo
CommunicationNetworking:AnAnalytical MulticastCommunication:Protocols,
Approach Programming,andApplications
AnuragKumar,D.Manjunath,andJoyKuri RalphWittmannandMartinaZitterbart
TheInternetandItsProtocols:AComparative MPLS:TechnologyandApplications
Approach BruceDavieandYakovRekhter
AdrianFarrel
High-PerformanceCommunicationNetworks,2e
ModernCableTelevisionTechnology:Video,Voice, JeanWalrandandPravinVaraiya
andDataCommunications,2e
InternetworkingMultimedia
WalterCiciora,JamesFarmer,DavidLarge,and
JonCrowcroft,MarkHandley,andIanWakeman
MichaelAdams
UnderstandingNetworkedApplications:AFirst
BluetoothApplicationProgrammingwiththeJava
Course
APIs
DavidG.Messerschmitt
CBalaKumar,PaulJ.Kline,and
TimothyJ.Thompson IntegratedManagementofNetworkedSystems:
Concepts,Architectures,andtheirOperational
Policy-BasedNetworkManagement:Solutionsfor
Application
theNextGeneration
Heinz-GerdHegering,SebastianAbeck,and
JohnStrassner BernhardNeumair
ComputerNetworks:ASystemsApproach,3e VirtualPrivateNetworks:MakingtheRight
LarryL.PetersonandBruceS.Davie Connection
DennisFowler
NetworkArchitecture,Analysis,andDesign,2e
JamesD.McCabe NetworkedApplications:AGuidetotheNew
ComputingInfrastructure
MPLSNetworkManagement:MIBs,Tools,and DavidG.Messerschmitt
Techniques
ThomasD.Nadeau WideAreaNetworkDesign:Conceptsand
ToolsforOptimization
DevelopingIP-BasedServices:Solutionsfor RobertS.Cahn
ServiceProvidersandVendors
MoniqueMorrowandKateelVijayananda
Forfurtherinformationonthesebooksandfora
TelecommunicationsLawintheInternetAge listofforthcomingtitles,pleasevisitourwebsiteat
SharonK.Black http://www.mkp.com
Routing, Flow, and Capacity Design
in
Communication and Computer Networks
Micha Pióro
WarsawUniversityofTechnology,Warsaw,Poland
LundUniversity,Lund,Sweden
Deepankar Medhi
UniversityofMissouri-KansasCity
KansasCity,Missouri,USA
AMSTERDAM • BOSTON (cid:127) HEIDELBERG (cid:127) LONDON
NEW YORK (cid:127) OXFORD (cid:127) PARIS (cid:127) SAN DIEGO
SAN FRANCISCO (cid:127) SINGAPORE (cid:127) SYDNEY (cid:127) TOKYO
MORGAN KAUFMANN PUBLISHERS IS AN IMPRINT OF ELSEVIER
SeniorEditor RickAdams
PublishingServicesManager Andre´Cuello
ProjectManager AnneB.McGee
AssociateEditor KarynJohnson
CoverDesign EricDeCicco
Composition Kolam,Inc.
Copyeditor KolamUSA
Proofreader KolamUSA
Indexer KolamUSA
InteriorPrinter Maple-VailBookManufacturingGroup
CoverPrinter PhoenixColorCorp.
MorganKaufmannPublishersisanimprintofElsevier.
500SansomeStreet,Suite400,SanFrancisco,CA94111
Thisbookisprintedonacid-freepaper.
©2004byElsevierInc.Allrightsreserved.
Designationsusedbycompaniestodistinguishtheirproductsareoftenclaimedastrademarksor
registeredtrademarks.InallinstancesinwhichMorganKaufmannPublishersisawareofaclaim,
theproductnamesappearininitialcapitalorallcapitalletters.Readers,however,shouldcontactthe
appropriatecompaniesformorecompleteinformationregardingtrademarksandregistration.
Nopartofthispublicationmaybereproduced,storedinaretrievalsystem,ortransmittedinany
formorbyanymeans—electronic,mechanical,photocopying,scanning,orotherwise—without
priorwrittenpermissionofthepublisher.
PermissionsmaybesoughtdirectlyfromElsevier’sScience&TechnologyRights
DepartmentinOxford,UK:phone:[phone],fax:[phone],e-mail:
[e-mail]queston-lineviatheElsevier
homepage(http://elsevier.com)byselecting“CustomerSupport”andthen“ObtainingPermissions.”
LibraryofCongressCataloging-in-PublicationData
Applicationsubmitted.
ISBN:0-12-557189-5
ForinformationonallMorganKaufmannpublications,visitourwebsiteatwww.mkp.com.
PrintedintheUnitedStatesofAmerica
04 05 06 07 08 5 4 3 2 1
Toourparents
LiliannaandthememoryofMichałPio´ro
PreetiandJyotiprasadMedhi
This page intentionally left blank
B CONTENTS
Foreword...................................................................xix
Preface......................................................................xxi
PART I
INTRODUCTORY NETWORK DESIGN 1
.........................
CHAPTER 1
Overview.....................................................3
1.1 A Network Analogy......................................................4
1.2 Communication and Computer Networks, and Network
Providers.................................................................9
1.3 Notion of Traffic and Traffic Demand...................................11
1.3.1 Traffic in the Internet................................................12
1.3.2 Traffic in the Telephone Network.....................................17
1.3.3 Demand in the Transport Network..................................20
1.3.4 Distinction between Traffic and Transport Network..................22
1.3.5 Generic Naming for Demand Volume and Capacity..................22
1.4 A Simple Design Example...............................................22
1.5 Notion of Routing and Flows...........................................23
1.6 Architecture of Networks: Multi-Layer Networks.....................25
1.7 Network Management Cycle...........................................27
1.8 Scope of the Book......................................................31
1.9 Naming and Numbering Convention...................................35
1.10 Summary...............................................................36
CHAPTER 2 Network Design Problems—Notation and
Illustrations................................................37
2.1 A Network Flow Example in Link-Path Formulation..................38
2.2 Node-Link Formulation................................................43
2.3 Notions and Notations.................................................45
2.4 Dimensioning Problems ...............................................50
2.5 Shortest-Path Routing................................................60
2.6 Fair Networks..........................................................62
viii
Contents
2.7 Topological Design.....................................................65
2.8 Restoration Design....................................................66
2.9 *Multi-Layer Networks Modeling.....................................68
2.10 Summary...............................................................74
Exercises for Chapter 2......................................................76
CHAPTER 3
Technology-Related Modeling
Examples...................................................77
3.1 IP Networks: Intra-Domain Traffic Engineering.......................78
3.2 MPLS Networks: Tunneling Optimization..............................82
3.3 ATM Networks: Virtual Path Design...................................84
3.4 Digital Circuit-Switched Telephone Networks: Single–
Busy Hour and Multi–Busy Hour Network Dimensioning............86
3.5 SONET/SDH Transport Networks: Capacity and
Protection Design......................................................90
3.6 SONET/SDH Rings: Ring Bandwidth Design...........................94
3.7 WDM Networks: Restoration Design with Optical
Cross-Connects........................................................96
3.8 IP Over SONET: Combined Two-Layer Design........................98
3.9 Summary and Further Reading........................................101
Exercises for Chapter 3....................................................102
PART II
DESIGN MODELING AND METHODS 103
.................
CHAPTER 4 Network Design Problem Modeling ..................105
4.1 Basic Uncapacitated and Capacitated Design Problems.............106
4.1.1 Uncapacitated Problems...........................................106
4.1.2 Capacitated Problems..............................................112
4.1.3 Mixed Problems....................................................115
4.2 Routing Restrictions...................................................115
4.2.1 Path Diversity......................................................116
4.2.2 Lower Bounds on Non-Zero Flows.................................117
4.2.3 Limited Demand Split..............................................118
4.2.4 Integral Flows.....................................................123
4.3 Non-Linear Link Dimensioning, Cost, and Delay Functions .........124
4.3.1 Modular Links.....................................................124
4.3.2 Convex Cost and Delay Functions.................................128
Contents ix
4.3.3 Concave Link Dimensioning Functions.............................134
4.4 Budget Constraint....................................................140
4.5 Incremental NDPs......................................................141
4.6 Extensions of Problem Modeling......................................142
4.6.1 Representing Nodes...............................................143
4.6.2 Capabilities of Link-Path Representation..........................144
4.7 Summary and Further Reading........................................145
Exercises for Chapter 4....................................................148
CHAPTER 5
General Optimization Methods for Network
Design......................................................151
5.1 Linear Programming...................................................152
5.1.1 Basic Facts About LP...............................................152
5.1.2 Duality in LP.......................................................154
5.1.3 Simplex Method...................................................158
5.1.4 Interior Point Methods (IPM) .....................................160
5.2 Mixed-Integer Programming..........................................162
5.2.1 The Branch-and-Bound (BB) Method..............................162
5.2.2 The Branch-and-Cut (BC) Method................................166
5.2.3 The Cutting-Plane Method........................................167
5.2.4 Dynamic Programming............................................168
5.3 Stochastic Heuristic Methods.........................................169
5.3.1 Local Search.......................................................169
5.3.2 Simulated Annealing (SAN)........................................170
5.3.3 Evolutionary Algorithm (EA).......................................172
5.3.4 Simulated Allocation (SAL).........................................173
5.3.5 Tabu Search (TS)..................................................176
5.3.6 Other Methods....................................................177
5.4 LP Decomposition Methods...........................................178
5.4.1 Lagrangian Relaxation (LR).........................................178
5.4.2 Column Generation Technique for Candidate Path List
Augmentation (CPLA).............................................184
5.4.3 Benders’ Decomposition..........................................192
5.5 Gradient Minimization and Other Approaches for
Convex Programming Problems.......................................194
5.5.1 The Flow Deviation (FD) Method..................................195
5.5.2 The Gradient Projection (GP) Method.............................196
5.5.3 Dual Method......................................................198