Cyclic queueing networks with subexponential service times

Hayriye Ayhan · Zbigniew Palmowski · Sabine Schlegel

12 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 Statistical Research Probability and Risk Models

Abstract

For a K-stage cyclic queueing network with N customers and general service times, we provide bounds on the nth departure time from each stage. Furthermore, we analyze the asymptotic tail behavior of cycle times and waiting times given that at least one service-time distribution is subexponential.

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

References

1987Applied Probability and Queues 2003Elements of Queueing Theory 1967Closed Queuing Systems with Exponential Servers 1996Stochastic Networks Theory and Applications 1988Subexponential distributions and integrated tails 1986Asymptotic Methods in Queueing Theory.1986Convolution tails, product tails and domains of attraction 1980Subexponential distribution functions

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.