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 firstname.lastname@example.org providing details of the course you are teaching.
This rigorous, self-contained book describes mathematical and, in particular, stochastic and graph theoretic methods to assess the performance of complex networks and systems. It comprises three parts: the first is a review of probability theory; Part II covers the classical theory of stochastic processes (Poisson, Markov and queueing theory), which are considered to be the basic building blocks for performance evaluation studies; Part III focuses on the rapidly expanding new field of network science. This part deals with the recently obtained insight that many very different large complex networks – such as the Internet, World Wide Web, metabolic and human brain networks, utility infrastructures, social networks – evolve and behave according to general common scaling laws. This understanding is useful when assessing the end-to-end quality of Internet services and when designing robust and secure networks. Containing problems and solved solutions, the book is ideal for graduate students taking courses in performance analysis.Read more
- Covers the basics of probability and includes problems and solved solutions, making the book self-contained and ideal for self-study
- Emphasises rigorous mathematical derivations, providing computational methods to solve realistic network problems analytically
- Dedicates a full chapter to a complete overview of SIS epidemics on networks
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: June 2014
- format: Hardback
- isbn: 9781107058606
- length: 688 pages
- dimensions: 253 x 178 x 40 mm
- weight: 1.38kg
- contains: 103 b/w illus. 4 tables 104 exercises
Table of Contents
Part I. Probability Theory:
2. Random variables
3. Basic distributions
6. Limit laws
Part II. Stochastic Processes:
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 queueing theory
14. Queueing models
Part III. Network Science:
15. General characteristics of graphs
16. The shortest path problem
17. Epidemics in networks
18. The efficiency of multicast
19. The hopcount and weight to an anycast group
Appendix A. A summary of matrix theory
Appendix B. Solutions to problems.
Welcome to the resources site
Here you will find free-of-charge online materials to accompany this book. The range of materials we provide across our academic and higher education titles are an integral part of the book package whether you are a student, instructor, researcher or professional.
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 email@example.com
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.orgRegister 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 ×