Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 1,148

The DOI matches its Crossref record.

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

Down, D., Bolch, G., Greiner, S., Meer, H. De, Trivedi, K.·2000·Journal of the American Statistical Association

Abstract

Preface to the Second Edition. Preface to the First Edition. 1. Introduction. 1.1 Motivation. 1.2 Methodological Background. 1.3 Basics of Probability and Statistics. 2. Markov Chains. 2.1 Markov Processes. 2.2 Performance Measures. 2.3 Generation Methods. 3. Steady-State Solutions of Markov Chains. 3.1 Solution for a Birth Death Process. 3.2 Matrix-Geometric Method: Quasi-Birth-Death Process. 3.3 Hessenberg Matrix: Non-Markovian Queues. 3.4 Numerical Solution: Direct Methods. 3.5 Numerical Solution: Iterative Methods. 3.6 Comparison of Numerical Solution Methods. 4. Steady-State Aggregation/Disaggregation Methods. 4.1 Courtois' Approximate Method. 4.2 Takahashi's Iterative Method. 5. Transient Solution of Markov Chains. 5.1 Transient Analysis Using Exact Methods. 5.2 Aggregation of Stiff Markov Chains. 6. Single Station Queueing Systems. 6.1 Notation. 6.2 Markovian Queues. 6.3 Non-Markovian Queues. 6.4 Priority Queues. 6.5 Asymmetric Queues. 6.6 Queues with Batch Service and Batch Arrivals. 6.7 Retrial Queues. 6.8 Special Classes of Point Arrival Processes. 7. Queueing Networks. 7.1 Definitions and Notation. 7.2 Performance Measures. 7.3 Product-Form Queueing Networks. 8. Algorithms for Product-Form Networks. 8.1 The Convolution Algorithm. 8.2 The Mean Value Analysis. 8.3 Flow Equivalent Server Method. 8.4 Summary. 9. Approximation Algorithms for Product-Form Networks. 9.1 Approximations Based on the MVA. 9.2 Summation Method. 9.3 Bottapprox Method. 9.4 Bounds Analysis. 9.5 Summary. 10. Algorithms for Non-Product-Form Networks. 10.1 Nonexponential Distributions. 10.2 Different Service Times at FCFS Nodes. 10.3 Priority Networks. 10.4 Simultaneous Resource Possession. 10.5 Prograrns with Internal Concurrency. 10.6 Parallel Processing. 10.7 Networks with Asymmetric Nodes. 10.8 Networks with Blocking. 10.9 Networks with Batch Service. 11. Discrete-Event Simulation. 11.1 Introduction to Simulation. 11.2 Simulative or Analytic Solution? 11.3 Classification of Simulation Models. 11.4 Classification of Tools in DES. 11.5 The Role of Probability and Statistics in Simulation. 11.6 Applications. 12. Performance Analysis Tools. 12.1 PEPSY. 12.2 SPNP. 12. 3 MOSEL-2. 12.4 SHARPE. 12.5 Characteristics of Some Tools. 13. Applications. 13.1 Case Studies of Queueing Networks. 13.2 Case Studies of Markov Chains. 13.3 Case Studies of Hierarchical Models. Glossary. Bibliography. Index.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.2307/2669582

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 1,148

Metadata

Authors
Down, D., Bolch, G., Greiner, S., Meer, H. D., & Trivedi, K.
Venue
Journal of the American Statistical Association
Publisher
JSTOR
Published
2000-03
Volume
95
Issue
449
Pages
346
ISSN
0162-1459 (ISSN-L)
OpenAlex
W2082442678
Cited by
1,148
References
0
FWCI
46.95
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications. https://app.cochat.ai/papers/10.2307/2669582
The paper
Down, D., Bolch, G., Greiner, S., Meer, H. D., & Trivedi, K. (2000). Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications. Journal of the American Statistical Association. https://doi.org/10.2307/2669582

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.