Performance Analysis of Complex Networks and Systems - Piet Van Mieghem

Performance Analysis of Complex Networks and Systems

Buch | Hardcover
688 Seiten
2014
Cambridge University Press (Verlag)
978-1-107-05860-6 (ISBN)
94,75 inkl. MwSt
A rigorous and self-contained guide to the mathematical, stochastic and graph theoretic methods needed to analyse the performance and robustness of complex networks and systems. Containing problems and solved solutions, the book is ideal for graduate students taking courses in performance analysis.
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.

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.

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.

Zusatzinfo Worked examples or Exercises; 4 Tables, black and white; 103 Line drawings, unspecified
Verlagsort Cambridge
Sprache englisch
Maße 178 x 253 mm
Gewicht 1380 g
Themenwelt Mathematik / Informatik Informatik Netzwerke
Mathematik / Informatik Mathematik Angewandte Mathematik
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
Technik Elektrotechnik / Energietechnik
Technik Nachrichtentechnik
ISBN-10 1-107-05860-0 / 1107058600
ISBN-13 978-1-107-05860-6 / 9781107058606
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Ein einführendes Lehrbuch

von Wolfgang Riggert; Ralf Lübben

Buch | Hardcover (2022)
Hanser, Carl (Verlag)
34,99
das umfassende Handbuch für den Einstieg in die Netzwerktechnik

von Martin Linten; Axel Schemberg; Kai Surendorf

Buch | Hardcover (2023)
Rheinwerk (Verlag)
29,90