Computational algorithms for closed queueing networks with exponential servers

Jeffrey P. Buzen

863 citations0/0 files storedCommunications of the ACM

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Network Traffic and Congestion Control Interconnection Networks and Systems

Abstract

Methods are presented for computing the equilibrium distribution of customers in closed queueing networks with exponential servers. Expressions for various marginal distributions are also derived. The computational algorithms are based on two-dimensional iterative techniques which are highly efficient and quite simple to implement. Implementation considerations such as storage allocation strategies and order of evaluation are examined in some detail.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 863 citations exist upstream.

References

1963Jobshop-Like Queueing Systems

Cited by

1981Blocking in a Shared Resource Environment 1993An introduction to queueing theory 1978The Operational Analysis of Queueing Network Models 1992Push and Pull Production Systems: Issues and Comparisons 1975Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms 1979Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System 1977Product Form and Local Balance in Queueing Networks 1977Queueing Models for Computer Communications System Analysis

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.