Academic Press, 2014. — 463 p.
Design of communication network is a complex task, as many of the problems involved are inherently difficult to solve. This leads to the necessity of using a collection of cleverly designed algorithms and methods rather than a single approach.
The book is written on at least two levels. Firstly, specific problems related to network design form the main structure of the book. On a second level, various types of algorithms are used, discussed and modified in the course of the text. The structure gives views: one problem based, one method based.
The Design Process
Models and Algorithms
Networks and Flows
Graph Connectivity
Shortest Paths
Maximum Flows
Topological Design
Capacitated Network Design
Important Properties of Graphs
Ring Topologies
Spanning Trees and Spanners
Gomory-Hu Design
Randomized Topological Design
Gemeric Algoritm
Resource Allocation
Stochastic Processes and Queues
The Erlang B-Formula and Generalizations
Loss Networks
Network Programming
Flow Analysis by Effective Bandwidth
Survivable Networks