Skip to content

Queueing Networks and Markov Chains Modeling and Performance Evaluation with Computer Science Applications

Spend $50 to get a free DVD!

ISBN-10: 0471565253

ISBN-13: 9780471565253

Edition: 2nd 2006 (Revised)

Authors: Gunter Bolch, Stefan Greiner, Hermann de Meer, Kishor S. Trivedi, Kishor Shridharbhai Trivedi

List price: $204.00
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!


Performance analysis seeks to discover the information bottlenecks in a computer system, and allows the designer to create an optimal system for a specific need. This text presents the theory and application of computer performance evaluation.
Customers also bought

Book details

List price: $204.00
Edition: 2nd
Copyright year: 2006
Publisher: John Wiley & Sons, Incorporated
Publication date: 4/14/2006
Binding: Hardcover
Pages: 896
Size: 6.50" wide x 9.50" long x 1.75" tall
Weight: 3.036
Language: English

GUNTER BOLCH, PhD, is Academic Director in the Department of Computer Science, University of Erlangen. He is a coauthor of MOSEL, a powerful specification language based on Markov chains.He has published five textbooks and more than 130 articles on performance modeling of computer and communication systems and applications.STEFAN GREINER, PhD, is Researcher at the DaimlerChrysler AG. He is coauthor of MOSEL and the recipient of the best paper award at the ESS94conference.HERMANN de MEER, PhD, is Professor in the Faculty of Mathematicsand Computer Science, University of Passau. He holds a chair in the Computer Networking and Communications Department; has published more than eighty peer-reviewed articles on performance modeling, computer networking, self-organization, quality of service, and peer-to-peer systems; and holds several international patents on related topics.KISHOR S. TRIVEDI, PhD, is Chaired Professor in the Department of Electrical and Computer Engineering and the Department of Computer Science, Duke University. A Fellow of IEEE, he is the author of the bestselling textbook Probability and Statistics with Reliability, Queueing, and Computer Science Applications, Second Edition, published by Wiley.

Preface to the Second Edition
Preface to the First Edition
Methodological Background
Problem Formulation
The Modeling Process
Basics of Probability and Statistics
Random Variables
Multiple Random Variables
Parameter Estimation
Order Statistics
Distribution of Sums
Markov Chains
Markov Processes
Stochastic and Markov Processes
Markov Chains
Performance Measures
A Simple Example
Markov Reward Models
A Case Study
Generation Methods
Petri Nets
Generalized Stochastic Petri Nets
Stochastic Reward Nets
GSPN/SRN Analysis
A Larger Example
Stochastic Petri Net Extensions
Non-Markovian Models
Symbolic State Space Storage Techniques
Steady-State Solutions of Markov Chains
Solution for a Birth-Death Process
Matrix-Geometric Method: Quasi-Birth-Death Process
The Concept
Example: The QBD Process
Hessenberg Matrix: Non-Markovian Queues
Nonexponential Service Times
Server with Vacations
Numerical Solution: Direct Methods
Gaussian Elimination
The Grassmann Algorithm
Numerical Solution: Iterative Methods
Convergence of Iterative Methods
Power Method
Jacobi's Method
Gauss-Seidel Method
The Method of Successive Over-Relaxation
Comparison of Numerical Solution Methods
Case Studies
Steady-State Aggregation/Disaggregation Methods
Courtois' Approximate Method
Analysis of the Substructures
Aggregation and Unconditioning
The Algorithm
Takahashi's Iterative Method
The Fundamental Equations
The Algorithm
Final Remarks
Transient Solution of Markov Chains
Transient Analysis Using Exact Methods
A Pure Birth Process
A Two-State CTMC
Solution Using Laplace Transforms
Numerical Solution Using Uniformization
Other Numerical Methods
Aggregation of Stiff Markov Chains
Outline and Basic Definitions
Aggregation of Fast Recurrent Subsets
Aggregation of Fast Transient Subsets
Aggregation of Initial State Probabilities
The Algorithm
An Example: Server Breakdown and Repair
Single Station Queueing Systems
Kendall's Notation
Performance Measures
Markovian Queues
The M/M/1 Queue
The M/M/[infinity] Queue
The M/M/m Queue
The M/M/1/K Finite Capacity Queue
Machine Repairman Model
Closed Tandem Network
Non-Markovian Queues
The M/G/1 Queue
The GI/M/1 Queue
The GI/M/m Queue
The GI/G/1 Queue
The M/G/m Queue
The GI/G/m Queue
Priority Queues
Queue without Preemption
Conservation Laws
Queue with Preemption
Queue with Time-Dependent Priorities
Asymmetric Queues
Approximate Analysis
Exact Analysis
Queues with Batch Service and Batch Arrivals
Batch Service
Batch Arrivals
Retrial Queues
M/M/1 Retrial Queue
M/G/1 Retrial Queue
Special Classes of Point Arrival Processes
Point, Renewal, and Markov Renewal Processes
Queueing Networks
Definitions and Notation
Single Class Networks
Multiclass Networks
Performance Measures
Single Class Networks
Multiclass Networks
Product-Form Queueing Networks
Global Balance
Local Balance
Jackson Networks
Gordon-Newell Networks
BCMP Networks
Algorithms for Product-Form Networks
The Convolution Algorithm
Single Class Closed Networks
Multiclass Closed Networks
The Mean Value Analysis
Single Class Closed Networks
Multiclass Closed Networks
Mixed Networks
Networks with Load-Dependent Service
Flow Equivalent Server Method
FES Method for a Single Node
FES Method for Multiple Nodes
Approximation Algorithms for Product-Form Networks
Approximations Based on the MVA
Bard Schweitzer Approximation
Self-Correcting Approximation Technique
Summation Method
Single Class Networks
Multiclass Networks
Bottapprox Method
Initial Value of [lambda]
Single Class Networks
Multiclass Networks
Bounds Analysis
Asymptotic Bounds Analysis
Balanced Job Bounds Analysis
Algorithms for Non-Product-Form Networks
Nonexponential Distributions
Diffusion Approximation
Maximum Entropy Method
Decomposition for Open Networks
Methods for Closed Networks
Closing Method for Open and Mixed Networks
Different Service Times at FCFS Nodes
Priority Networks
The Method of Shadow Server
Simultaneous Resource Possession
Memory Constraints
I/O Subsystems
Method of Surrogate Delays
Programs with Internal Concurrency
Parallel Processing
Asynchronous Tasks
Fork-Join Systems
Networks with Asymmetric Nodes
Closed Networks
Open Networks
Networks with Blocking
Different Blocking Types
Product-Form Solution for Networks with Two Nodes
Networks with Batch Service
Open Networks with Batch Service
Closed Networks with Batch Service
Discrete-Event Simulation
Introduction to Simulation
Simulative or Analytic Solution?
Classification of Simulation Models
Classification of Tools in DES
The Role of Probability and Statistics in Simulation
Random Variate Generation
Generating Events from an Arrival Process
Output Analysis
Speedup Techniques
Summary of Output Analysis
Web Cache Example in CSIM-19
OPNET Modeler
Model Construction in ns-2
Performance Analysis Tools
Structure of PEPSY
Different Programs in PEPSY
Example of Using PEPSY
Graphical User Interface XPEPSY
SPNP Features
The CSPL Language
The MOSEL-2 Formal Description Technique
Tandem Network with Blocking after Service
A Retrial Queue
Central-Server Queueing Network
M/M/m/K System
M/M/1/K System with Server Failure and Repair
GSPN Model of a Polling System
Characteristics of Some Tools
Case Studies of Queueing Networks
Multiprocessor Systems
Client-Server Systems
Communication Systems
Proportional Differentiated Services
UNIX Kernel
J2EE Applications
Flexible Production Systems
Kanban Control
Case Studies of Markov Chains
Wafer Production System
Polling Systems
Client-Server Systems
ISDN Channel
ATM Network Under Overload
UMTS Cell with Virtual Zones
Handoff Schemes in Cellular Mobile Networks
Case Studies of Hierarchical Models
A Multiprocessor with Different Cache Strategies
Performability of a Multiprocessor System