Communication Networks
An Optimization, Control, and Stochastic Networks Perspective

A modern mathematical approach to the design of communication network architectures, algorithms and protocols, blending control, optimization, and stochastic network theories.

R. Srikant (Author), Lei Ying (Author)

9781107036055, Cambridge University Press

Hardback, published 14 November 2013

363 pages, 155 b/w illus. 108 exercises
25.3 x 19.3 x 2 cm, 0.93 kg

'Chapters follow the logical flow of designing layers of the network. Each chapter brings another aspect of network modeling. Although many algorithms are presented in the form of pseudo-code only, no clarity is lost and the book can be recommended to programmers seeking a solid reference … Exercises are interesting and feel like real research problems. With solutions available to instructors, this book is also an excellent choice as a textbook for a performance evaluation course. The most appreciated feature of this work is its freshness: all the examples and exercises are up to date. This makes classic theories more attractive to students, who can see the real applications of complex mathematics, and motivate[s] them to dive into the exciting world of network optimization and control.' IEEE Communications Magazine

Provides a modern mathematical approach to the design of communication networks for graduate students, blending control, optimization, and stochastic network theories. A broad range of performance analysis tools are discussed, including important advanced topics that have been made accessible to students for the first time. Taking a top-down approach to network protocol design, the authors begin with the deterministic model and progress to more sophisticated models. Network algorithms and protocols are tied closely to the theory, illustrating the practical engineering applications of each topic. The background behind the mathematical analyses is given before the formal proofs and is supported by worked examples, enabling students to understand the big picture before going into the detailed theory. End-of-chapter problems cover a range of difficulties, with complex problems broken into several parts, and hints to many problems are provided to guide students. Full solutions are available online for instructors.

1. Introduction
2. Mathematics of internet architecture
3. Links: statistical multiplexing and queues
4. Scheduling in packet switches
5. Scheduling in wireless networks
6. Back to network utility maximization
7. Network protocols
8. Peer-to-peer networks
9. Queuing theory in continuous time
10. Heavy-traffic limits of queuing networks
11. Large deviations
12. Geometric random graph models of wireless networks.

Subject Areas: Signal processing [UYS], Computer science [UY], Computer networking & communications [UT], Electrical engineering [THR], Probability & statistics [PBT]