Other available formats:
Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact email@example.com providing details of the course you are teaching.
This rigorous and self-contained book describes mathematical and, in particular, stochastic methods to assess the performance of networked systems. It consists of three parts. Part one is a review of 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.Read more
- Self-contained with problems and solutions for self-study
- Emphasis on rigorous mathematical derivations providing methods to solve real network problems analytically
- Some detailed proofs are given in footnote size to denote text that can be skipped at first reading
Reviews & endorsements
"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
Review was not posted due to profanity×
- Date Published: April 2009
- format: Paperback
- isbn: 9780521108737
- length: 544 pages
- dimensions: 244 x 170 x 28 mm
- weight: 0.86kg
- contains: 87 b/w illus. 3 tables 47 exercises
- availability: Available
Table of Contents
2. Random variables
3. Basic distributions
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
Find resources associated with this titleYour search for '' returned .
Type Name Unlocked * Format Size
*This title has one or more locked files and access is given only to instructors adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.
These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.
If you are having problems accessing these resources please email firstname.lastname@example.org
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×