Introduction To Communication Network Analysis

A self-contained text on modeling and performance evaluation of communication networks

This quantitative book focuses on the real issues behind modeling and analysis of communication networks. The author covers a wide variety of topical networking subject matter based on the provided background material in probability, Markov chains, and queues. Leveraging this material, the author explores topics in local multiplexing and routing over three successive chapters, stressing both continuous-time and discrete-time contexts. The remaining chapters focus more directly on networking, such as traffic shaping and multiplexing, static routing, dynamic routing, and peer-to-peer file sharing systems.

Providing more rigorous and technically deep coverage than most commonly used networking textbooks, An Introduction to Communication Network Analysis covers classical (e.g., queuing theory) and modern (e.g., pricing) aspects of networking in a clear, accessible manner. Chapters include:
*

Review of Elementary Probability Theory
*

Markov Chains
*

Introduction to Queuing Theory
*

Local Multiplexing
*

Queuing Networks with Static Routing
*

Dynamic Routing with Incentives
*

Peer-to-Peer File Sharing with Incentives

Appendices include additional background information, solutions, and references for selected problems, making this an invaluable text for graduate-level students and networking researchers alike.

George Kesidis, PhD, is a Professor at the Pennsylvania State University. He is a senior member of the IEEE and TCP co-chair of INFOCOM 2007.