Skip to content
Register Sign in Wishlist

Performance Analysis of Complex Networks and Systems

$87.99 (P)

  • Date Published: June 2014
  • availability: Available
  • format: Hardback
  • isbn: 9781107058606

$ 87.99 (P)
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


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 collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • 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
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • 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
    • availability: Available
  • Table of Contents

    1. Introduction
    Part I. Probability Theory:
    2. Random variables
    3. Basic distributions
    4. Correlation
    5. Inequalities
    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.

  • Resources for

    Performance Analysis of Complex Networks and Systems

    Piet Van Mieghem

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to instructors whose faculty status has been verified. To gain access to locked resources, instructors 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 instructors 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. Instructors 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 lecturers@cambridge.org.

  • Author

    Piet Van Mieghem, Technische Universiteit Delft, The Netherlands
    Piet Van Mieghem is a Professor at the Delft University of Technology with a chair in telecommunication networks, and chairman of the Network Architectures and Services (NAS) section. His main research interests lie in the modeling and analysis of complex networks (such as biological, brain, social, infrastructural, and so on) and in new Internet-like architectures and algorithms for future communications networks.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» 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 ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

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.

×
Please fill in the required fields in your feedback submission.
×