The cyclic queue and the tandem queue
type: Item
instance of: scholarly article
title: The cyclic queue and the tandem queue
zbMATH Open document ID: 1307.60128
author: Hans Daduna
author: Onno Boxma
published in: Queueing Systems
publication date: 2014-11-25T00:00:00Z
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 6373791
zbMATH Keywords: closed cyclic queue
zbMATH Keywords: tandem queue
zbMATH Keywords: sojourn time
MaRDI profile type: Publication
full work available at URL: s11134-013-9380-8
OpenAlex ID: W2126875352
cites work: Cyclic queueing networks with subexponential service times
cites work: Analysis of the \(M/GI/1\to ./M/1\) queueing model
cites work: On response time and cycle time distributions in a two-stage cyclic queue
cites work: The cyclic queue with one general and one exponential server
cites work: Joint distribution of sojourn time and queue length in the M/G/1 queue with (in)finite capacity
cites work: The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues
cites work: The Output Process of a Stationary $M/M/s$ Queueing System
cites work: Q2730382
cites work: The Cycle Time Distribution of Exponential Cyclic Queues
cites work: Q3938929
cites work: Passage times for overtake-free paths in Gordon–Newell networks
cites work: Q3339070
cites work: Two-Stage Cyclic Queues with Nonexponential Servers: Steady-State and Cyclic Time
cites work: Q3126556
cites work: Weak Convergence Limits for Sojourn Times in Cyclic Queues Under Heavy Traffic Conditions
cites work: Joint distributions in Poissonian tandem queues
cites work: Sojourn times in closed queueing networks
cites work: Travel and sojourn times in stochastic networks
cites work: Q2730383
cites work: Q3084785
cites work: Waiting Times When Queues are in Tandem
cites work: Note on Queues in Tandem
cites work: The Time for a Round Trip in a Cycle of Exponential Queues
cites work: Sojourn times in queuing networks with multiserver modes
cites work: Non-stationary waiting times in a closed exponential tandem queue
cites work: Sojourn times and the overtaking condition in Jacksonian networks
cites work: Q4894800
cites work: Cycle times in single server cyclic Jackson networks.
DOI: 10.1007/S11134-013-9380-8
description: scientific article; zbMATH DE number 6373791