Performance Analysis of Communications Networks and Systems

A rigourous and self-contained graduate text covering methods to assess the performance of networked systems.

Piet Van Mieghem (Author)

9780521108737, Cambridge University Press

Paperback / softback, published 9 April 2009

544 pages, 87 b/w illus. 3 tables 47 exercises
24.4 x 17 x 2.8 cm, 0.86 kg

"The monograph Performance Analysis of Communications Networks and Systems by Piet Van Mieghem, Professor of Delft University of Technology (Netherlands), can be recommended for graduate students and researchers working in the area of networking performance analysis...The book includes a lot of solved exercises and supplementary problems well suited for self-work, as well as an exhaustive bibliography...if you prefer fresh approaches and results within the area of probabilistic modeling of packet networks at the inevitable danger of being haunted by rigorous mathematical derivations, you must refer to van Mieghem's book."
IEEE Communications Magazine

This rigourous and self-contained book describes mathematical and, in particular, stochastic methods to assess the performance of networked systems. It consists of three parts. The first part is a review on probability theory. Part two covers the classical theory of stochastic processes (Poisson, renewal, Markov and queuing theory), which are considered to be the basic building blocks for performance evaluation studies. Part three focuses on the relatively new field of the physics of networks. This part deals with the recently obtained insights that many very different large complex networks - such as the Internet, World Wide Web, proteins, utility infrastructures, social networks - evolve and behave according to more general common scaling laws. This understanding is useful when assessing the end-to-end quality of communications services, for example, in Internet telephony, real-time video and interacting games. Containing problems and solutions, this book is ideal for graduate students taking courses in performance analysis.

1. Introduction
2. Random variables
3. Basic distributions
4. Correlation
5. Inequalities
6. Limit laws
7. The Poisson process
8. Renewal theory
9. Discrete time Markov chains
10. Continuous time Markov chains
11. Applications of Markov chains
12. Branching processes
13. General queuing theory
14. Queuing models
15. General characteristics of graphs
16. The shortest path problem
17. The efficiency of multicast
18. The hop count to an any cast group
Appendix A. Stochastic matrices
Appendix B. Algebraic graph theory
Appendix C. Solutions of problems
Bibliography
Index.

Subject Areas: Educational: Technology [YQT], Signal processing [UYS], Computer networking & communications [UT], Probability & statistics [PBT]