The cyclic queue and the tandem queue
From MaRDI portal
Publication:475113
DOI10.1007/S11134-013-9380-8zbMath1307.60128OpenAlexW2126875352MaRDI QIDQ475113
Publication date: 25 November 2014
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-013-9380-8
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cycle times in single server cyclic Jackson networks.
- Joint distribution of sojourn time and queue length in the M/G/1 queue with (in)finite capacity
- Analysis of the \(M/GI/1\to ./M/1\) queueing model
- Joint distributions in Poissonian tandem queues
- Travel and sojourn times in stochastic networks
- Non-stationary waiting times in a closed exponential tandem queue
- Waiting Times When Queues are in Tandem
- The cyclic queue with one general and one exponential server
- Weak Convergence Limits for Sojourn Times in Cyclic Queues Under Heavy Traffic Conditions
- Sojourn times in closed queueing networks
- Two-Stage Cyclic Queues with Nonexponential Servers: Steady-State and Cyclic Time
- Sojourn times in queuing networks with multiserver modes
- The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues
- The Cycle Time Distribution of Exponential Cyclic Queues
- Sojourn times and the overtaking condition in Jacksonian networks
- Passage times for overtake-free paths in Gordon–Newell networks
- On response time and cycle time distributions in a two-stage cyclic queue
- Cyclic queueing networks with subexponential service times
- The Time for a Round Trip in a Cycle of Exponential Queues
- The Output Process of a Stationary $M/M/s$ Queueing System
- Note on Queues in Tandem
This page was built for publication: The cyclic queue and the tandem queue
