Analysis of an open tandem queueing network with population constraint and constant service times
type: Item
instance of: scholarly article
title: Analysis of an open tandem queueing network with population constraint and constant service times
zbMATH Open document ID: 0913.90112
DOI: 10.1016/0377-2217(95)00291-X
author: Young Rhee
author: Harry G. Perros
published in: European Journal of Operational Research
publication date: 1999-05-31T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 1212226
zbMATH Keywords: semaphore queue
zbMATH Keywords: upper and lower bounds
zbMATH Keywords: external queue
zbMATH Keywords: open tandem queueing network
zbMATH Keywords: population constraint
zbMATH Keywords: constant service times
zbMATH Keywords: mean waiting time
MaRDI profile type: Publication
cites work: A Sequence of Service Stations with Arbitrary Input and Regular Service Times
cites work: Reduction Methods for Tandem Queuing Systems
cites work: Some inequalities for the queue GI/G/1
cites work: Queuing Networks with Population Size Constraints
cites work: Q5811575
cites work: A modified erlang approach to approximating GI/G/1 queues
cites work: Technical Note—Some Simpler Bounds on the Mean Queuing Time
cites work: An Approximate Analytical Method for General Queueing Networks
cites work: Some Inequalities in Queuing
cites work: Approximate behavior of tandem queues
cites work: A Tandem Network of Queues with Deterministic Service and Intermediate Arrivals
cites work: Nested sliding window protocols with packet fragmentation
cites work: Delay Decomposition at a Single Server queue with Constant Service Time and Multiple Inputs
Wikidata QID: Q127360559
full work available at URL: 0377-2217(95)00291-x
OpenAlex ID: W2077254698
description: scientific article; zbMATH DE number 1212226