You are previewing Design of Modern Communication Networks.
O'Reilly logo
Design of Modern Communication Networks

Book Description

Design of Modern Communication Networks focuses on methods and algorithms related to the design of communication networks, using optimization, graph theory, probability theory and simulation techniques. The book discusses the nature and complexity of the network design process, then introduces theoretical concepts, problems and solutions. It demonstrates the design of network topology and traditional loss networks, followed by uncontrolled packet networks, flow-controlled networks, and multiservice networks. Access network design is reviewed, and the book concludes by considering the design of survivable (reliable) networks and various reliability concepts.

  • A toolbox of algorithms: The book provides practical advice on implementing algorithms, including the programming aspects of combinatorial algorithms.
  • Extensive solved problems and illustrations: Wherever possible, different solution methods are applied to the same examples to compare performance and verify precision and applicability.
  • Technology-independent: Solutions are applicable to a wide range of network design problems without relying on particular technologies.

Table of Contents

  1. Cover image
  2. Title page
  3. Table of Contents
  4. Copyright
  5. Dedication
  6. Preface
  7. 1: Introduction
    1. 1.1 The purpose of this book
    2. 1.2 The design process
    3. 1.3 A first example
    4. 1.4 Algorithms for hard problems
    5. 1.5 Models and algorithms
    6. 1.6 Organization of this book
    7. 1.7 Summary
  8. 2: Networks and Flows
    1. 2.1 Preliminaries
    2. 2.2 Network representations
    3. 2.3 Graph connectivity
    4. 2.4 Shortest paths
    5. 2.5 Maximum flows
    6. 2.6 Summary
  9. 3: Advanced Flow Theory
    1. 3.1 Multi-terminal flows
    2. 3.2 Minimum-cost flows
    3. 3.3 Multi-commodity flows
    4. 3.4 Summary
  10. 4: Topological Design
    1. 4.1 Capacitated network design
    2. 4.2 Important properties of graphs
    3. 4.3 Ring topologies
    4. 4.4 Spanning trees and spanners
    5. 4.5 Gomory-Hu design
    6. 4.6 Randomized topological design
    7. 4.7 Genetic algorithms
    8. 4.8 Resource allocation
    9. 4.9 Summary
  11. 5: Stochastic Processes and Queues
    1. 5.1 Traffic and blocking
    2. 5.2 Modeling with queues
    3. 5.3 Markov chain analysis
    4. 5.4 The Erlang B-formula and generalizations
    5. 5.5 Overflow theory
    6. 5.6 Summary
  12. 6: Loss Networks
    1. 6.1 Calculating blocking in a network
    2. 6.2 Resource allocation
    3. 6.3 Routing and admission control
    4. 6.4 Network programming
    5. 6.5 Simulation of loss networks
    6. 6.6 Efficiency and stability of loss networks
    7. 6.7 Summary
  13. 7: Simple Packet Networks
    1. 7.1 General properties of packet networks
    2. 7.2 Queueing networks
    3. 7.3 Resource allocation
    4. 7.4 Flow optimization
    5. 7.5 Simultaneous resource and flow optimization
    6. 7.6 Finite buffers
    7. 7.7 Local search
    8. 7.8 Simulation of general packet networks
    9. 7.9 Summary
  14. 8: Flow-Controlled Packet Networks
    1. 8.1 Flow control and congestion control
    2. 8.2 Closed queueing networks
    3. 8.3 Convolution
    4. 8.4 Mean value analysis
    5. 8.5 Closed network approximations
    6. 8.6 Decomposition
    7. 8.7 TCP controlled networks
    8. 8.8 Summary
  15. 9: Effective Bandwidth
    1. 9.1 Broadband services
    2. 9.2 Queues in multi-service networks
    3. 9.3 Large deviations
    4. 9.4 Effective bandwidth
    5. 9.5 Modeling services
    6. 9.6 Estimation techniques
    7. 9.7 Finite buffers
    8. 9.8 Summary
  16. 10: Multi-Service Systems
    1. 10.1 The acceptance region
    2. 10.2 The Binomial-Poisson-Pascal models
    3. 10.3 Loss systems with multiple services
    4. 10.4 Admission control
    5. 10.5 Processor load sharing
    6. 10.6 Summary
  17. 11: Multi-Service Network Analysis
    1. 11.1 Fixed-point network analysis
    2. 11.2 Generalized queueing networks
    3. 11.3 Flow analysis by effective bandwidth
    4. 11.4 Summary
  18. 12: Survivable Networks
    1. 12.1 Connectivity and cuts
    2. 12.2 Spanning trees
    3. 12.3 A primal-dual algorithm
    4. 12.4 Local search
    5. 12.5 The reliability polynomial
    6. 12.6 Optimal topologies and circulants
    7. 12.7 Summary
  19. Bibliography
  20. Index