Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room

Paul Caseau · Guy Pujolle

65 citations0/0 files storedIEEE Transactions on Software Engineering

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

A tandem queueing system with blocking due to finite waiting room is considered. Maximum throughput is studied by an approximation for several cases. The service time can depend on the number of customers; intermediate arrivals can also be allowed. Some special models with two stations in sequence and blocking are examined. These models are used for the performance evaluation of computer systems. In particular, the maximum throughput for a virtual memory operating system and for a node-to-node protocol in a computer network are obtained.

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 — 65 citations exist upstream.

References

1956Sequential Arrays of Waiting Lines 1974Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions 1975On Approximate Computer System Models 1980Queueing network models of multiprogramming 1976A Queueing Model with Finite Waiting Room and Blocking 1965A Sequence of Two Servers with No Intermediate Queue 1963Introduction to the Theory of Queues 1976Probabilistic models of computer systems?Part I (exact results)

Cited by

1989A bibliography of papers on queueing networks with finite capacity queues 1989MEM for arbitrary queueing networks with multiple general servers and repetitive-service blocking 1994Equivalence, reversibility, symmetry and concavity properties in fork-join queuing networks with blocking 1989Equivalence relations in queueing models of Fork/Join networks with blocking 1994A survey of product form queueing networks with blocking and their equivalences 1994

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.