Routing, flow, and capacity design in communication and computer networks
In network design, the gap between theory and practice is woefully broad. This book narrows it, comprehensively and critically examining current network design models and methods. You will learn where mathematical modeling and algorithmic optimization have been under-utilized. At the opposite extrem...
| Autor principal: | |
|---|---|
| Otros Autores: | |
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Amsterdam ; Boston :
Elsevier/Morgan Kaufmann
c2004.
|
| Edición: | 1st edition |
| Colección: | Morgan Kaufmann series in networking.
|
| Materias: | |
| Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009627328306719 |
Tabla de Contenidos:
- Front Cover; Routing, Flow, and Capacity Design in Communication and Computer Networks; Copyright Page; Contents; Foreword; Preface; PART I: INTRODUCTORY NETWORK DESIGN; Chapter 1. Overview; 1.1 A Network Analogy; 1.2 Communication and Computer Networks, and Network Providers; 1.3 Notion of Traffic and Traffic Demand; 1.4 A Simple Design Example; 1.5 Notion of Routing and Flows; 1.6 Architecture of Networks: Multi-Layer Networks; 1.7 Network Management Cycle; 1.8 Scope of The Book; 1.9 Naming and Numbering Convention; 1.10 Summary; Chapter 2. Network Design Problems-Notation and Illustrations
- 2.1 A Network Flow Example in Link-Path Formulation2.2 Node-Link Formulation; 2.3 Notions and Notations; 2.4 Dimensioning Problems; 2.5 Shortest-Path Routing; 2.6 Fair Networks; 2.7 Topological Design; 2.8 Restoration Design; 2.9 *Multi-Layer Networks Modeling; 2.10 Summary; Exercises For Chapter 2; Chapter 3. Technology-Related Modeling Examples; 3.1 IP Networks: Intra-Domain Traffic Engineering; 3.2 MPLS Networks: Tunneling Optimization; 3.3 ATM Networks: Virtual Path Design; 3.4 Digital Circuit-Switched Telephone Networks: Single-Busy Hour and Multi-Busy Hour Network Dimensioning
- 3.5 SONET/SDH Transport Networks: Capacity and Protection Design3.6 SONET/SDH Rings: Ring Bandwidth Design; 3.7 WDM Networks: Restoration Design with Optical Cross-Connects; 3.8 IP Over Sonet: Combined Two-Layer Design; 3.9 Summary and Further Reading; Exercises for Chapter 3; PART II: DESIGN MODELING AND METHODS; Chapter 4. Network Design Problem Modeling; 4.1 Basic Uncapacitated and Capacitated Design Problems; 4.2 Routing Restrictions; 4.3 Non-Linear Link Dimensioning, Cost, and Delay Functions; 4.4 Budget Constraint; 4.5 Incremental NDPS; 4.6 Extensions of Problem Modeling
- 4.7 Summary and Further ReadingExercises for Chapter 4; Chapter 5. General Optimization Methods for Network Design; 5.1 Linear Programming; 5.2 Mixed-Integer Programming; 5.3 Stochastic Heuristic Methods; 5.4 LP Decomposition Methods; 5.5 Gradient Minimization and Other Approaches for Convex Programming Problems; 5.6 Special Heuristics for Concave Programming Problems; 5.7 Solving Multi-Commodity Flow Problems; 5.8 Summary and Further Reading; Exercises for Chapter 5; Chapter 6. Location and Topological Design; 6.1 Node Location Problem; 6.2 Joint Node Location and Link Connectivity Problem
- 6.3 Topological Design6.4 Lower Bounds for Branch-and-Bound; 6.5 Summary and Further Reading; Exercises for Chapter 6; Chapter 7. Networks With Shortest-Path Routing; 7.1 Shortest-Path Routing Allocation Problem; 7.2 MIP Formulation of the Shortest-Path Routing Allocation Problem and Dual Problems; 7.3 Heuristic Direct Methods for Determining the Link Metric System; 7.4 Two-Phase Solution Approach; 7.5 Impact Due to Stochastic Approaches; 7.6 Impact of Different Link Weight System; 7.7 Impact on Different Performance Measures; 7.8 Uncapacitated Shortest-Path Routing Problem
- 7.9 Optimization of the Link Metric System Under Transient Failures
