Bounds for the expected delays in some tandem queues

Shun‐Chen Niu

17 citations0/0 files storedJournal of Applied Probability

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 Probability and Risk Models Age of Information Optimization

Abstract

Tandem queues are analyzed. An upper bound for the stationary expected delay in front of the second server is found for a sequence of two queues in tandem where the first server has deterministic service times, the second server has general service distribution, and the arrival process is an arbitrary renewal process. The result is extended to the case of n queues in tandem where all the servers except the last one have constant service times.

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

References

1956The Output of a Queuing System 1970Inequalities in the Theory of Queues 1962Some Inequalities for the Queue GI/G/1 1957Waiting Times When Queues are in Tandem 1968Some Inequalities in Queuing 1965Reduction Methods for Tandem Queuing Systems 1968The Output Process of a Stationary $M/M/s$ Queueing System 1974The Optimal Order of Service in Tandem Queues

Cited by

1981On the comparison of waiting times in tandem queues

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.