Home Page Icon
Home Page
Table of Contents for
Cover image
Close
Cover image
by Deep Medhi, Michal Pioro
Routing, Flow, and Capacity Design in Communication and Computer Networks
Cover image
Title page
Table of Contents
The Morgan Kaufmann Series in Networking
Copyright
Dedication
FOREWORD
PREFACE
PART I: INTRODUCTORY NETWORK DESIGN
INTRODUCTION TO 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 FORMULATION
2.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 DESIGN
3.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
INTRODUCTION TO 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 READING
EXERCISES 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
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
7.10 *NP-COMPLETENESS OF THE SHORTEST-PATH ROUTING ALLOCATION PROBLEM
7.11 SELFISH ROUTING AND ITS RELATION TO OPTIMAL ROUTING
7.12 SUMMARY AND FURTHER READING
EXERCISES FOR Chapter 7
CHAPTER 8: Fair Networks
8.1 NOTIONS OF FAIRNESS
8.2 DESIGN PROBLEMS FOR MAX-MIN FAIRNESS (MMF)
8.4 SUMMARY AND FURTHER READING
EXERCISES FOR Chapter 8
PART III: ADVANCED MODELS
INTRODUCTION TO ADVANCED MODELS
CHAPTER 9: Restoration and Protection Design of Resilient Networks
9.1 FAILURE STATES, PROTECTION/RESTORATION MECHANISMS, AND DIVERSITY
9.2 LINK CAPACITY PROTECTION/RESTORATION
9.3 DEMAND FLOW RE-ESTABLISHMENT
9.4 EXTENSIONS
9.5 PROTECTION PROBLEMS
9.6 APPLICABILITY OF THE PROTECTION/RESTORATION DESIGN MODELS
9.7 SUMMARY AND FURTHER READING
EXERCISES FOR Chapter 9
CHAPTER 10: Application of Optimization Techniques for Protection and Restoration Design
10.1 PATH GENERATION
10.2 LAGRANGIAN RELAXATION (LR) WITH SUBGRADIENT MAXIMIZATION
10.3 BENDERS’ DECOMPOSITION
10.4 MODULAR LINKS
10.5 STOCHASTIC HEURISTIC METHODS
10.6 SELECTED APPLICATION: WAVELENGTH ASSIGNMENT PROBLEM IN WDM NETWORKS
10.7 SUMMARY AND FURTHER READING
EXERCISES FOR Chapter 10
CHAPTER 11: Multi-Hour and Multi–Time-Period Network Modeling and Design
11.1 MULTI-HOUR DESIGN
11.2 MULTI-PERIOD DESIGN
11.3 SUMMARY AND FURTHER READING
EXERCISES FOR Chapter 11
CHAPTER 12: Multi-Layer Networks: Modeling and Design
12.1 DESIGN OF MULTI-LAYER NETWORKS
12.2 MODELING OF MULTI-LAYER NETWORKS FOR RESTORATION DESIGN
12.3 MULTI-LAYER DESIGN WITH MULTI-HOUR TRAFFIC
12.4 APPLICATION OF DECOMPOSITION METHODS FOR TWO-LAYER DESIGN
12.5 NUMERICAL RESULTS
12.6 COST COMPARISON
12.7 GROOMING/MULTIPLEX BUNDLING
12.8 SUMMARY AND FURTHER READING
EXERCISES FOR Chapter 12
CHAPTER 13: Restoration Design of Single- and Multi-Layer Fair Networks
13.1 RESTORATION DESIGN OF SINGLE-LAYER PF NETWORKS
13.2 DECOMPOSITION METHODS FOR THE SINGLE-LAYER RESTORATION PROBLEMS
13.3 DESIGN OF RESILIENT TWO-LAYER PF NETWORKS
13.4 EXTENSIONS
13.5 SUMMARY AND FURTHER READING
EXERCISES FOR Chapter 13
APPENDICES
APPENDIX A: Optimization Theory Refresher
APPENDIX B: Introduction to Complexity Theory and NP-Completeness
APPENDIX C: Shortest-Path Algorithms
APPENDIX D: Using LP/MIP Packages
LIST OF ACRONYMS
SOLUTIONS TO SELECTED EXERCISES
BIBLIOGRAPHY
INDEX
Search in book...
Toggle Font Controls
Playlists
Add To
Create new playlist
Name your new playlist
Playlist description (optional)
Cancel
Create playlist
Sign In
Email address
Password
Forgot Password?
Create account
Login
or
Continue with Facebook
Continue with Google
Sign Up
Full Name
Email address
Confirm Email Address
Password
Login
Create account
or
Continue with Facebook
Continue with Google
Next
Next Chapter
Title page
Add Highlight
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click
here
login for view all page.
Day Mode
Cloud Mode
Night Mode
Reset