Queueing Networks and Markov Chains

By G. Bolch, S. Greiner, Hermann de Meer, Kishor S. Trivedi. 2005

877 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Service Performance and Analysis in Cloud Computing (2009, background): “According to Bolch et al. [4] and Perros [17], the response time T is exponentially distributed with the parameter µ(1 − ρ), i.e., its probability distribution function is given by f T (t) = µ(1 − ρ)e −µ(1−ρ)t .”
Model-based evaluation: from dependability to security (2004, methodology): “1 Markov Reward Models [17], [8], [52] Let fXðtÞ; t 0g be a homogeneous finite state continuous”
Performance Modeling and Design of Computer Systems: Queueing Theory in Action (2013, neutral): “A comprehensive discussion of the use of MVA for solving both single-class and multi-class product form networks is provided in [23].”
Scalable Approach to Uncertainty Quantification and Robust Design of Interconnected Dynamical Systems (2011, neutral): “…there are techniques that work best on dynamical systems (such as uncertainty quantiﬁcation), and other techniques that are more appropriate for probabilistic transition systems (such as Probabilistic Model Checking [3, 4, 55], and performance and reliability analysis using Markov Chains [6]).”