Performance Analysis of Communications Networks and Systems
£54.99
- Author: Piet Van Mieghem, Technische Universiteit Delft, The Netherlands
- Date Published: April 2009
- availability: Available
- format: Paperback
- isbn: 9780521108737
£
54.99
Paperback
Other available formats:
eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
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.
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
Customer reviews
Review was not posted due to profanity
×Product details
- 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
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.-
General Resources
Find resources associated with this title
Type Name Unlocked * Format Size Showing of
This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.
Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.
Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.
If you are having problems accessing these resources please contact [email protected].
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
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 ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×