A tandem queue with a gate mechanism

DOI10.1023/A:1023213914432MaRDI QIDQ1810754zbMATH OpenFDO

Authors Zbigniew Palmowski, Sabine Schlegel, Onno Boxma

Publication date 9 June 2003

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1023213914432

zbMATH Keywords

access networksbatch customerscollision resolutiongate mechanismtandem queue

Mathematics Subject Classification ID

Factorization theory (including Wiener-Hopf and spectral factorizations) of linear operators (47A68) Markov renewal processes, semi-Markov processes (60K15) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Recommendations

• A single server queue with a varying gate mechanism
• Batch arrivals to a tandem queue without an intermediate buffer
• An M/G/1 queueing model with gated random order of service
• Work-conserving tandem queues
• A Tandem Network of Queues with Deterministic Service and Intermediate Arrivals

Cited in

(3)

• A Single Server Queue with Two Types of Customers and a Gate Mechanism
• The gate distribution
• A single server queue with a varying gate mechanism

This page was built for publication: A tandem queue with a gate mechanism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1810754)