Analysis of an open tandem queueing network with population constraint and constant service times

DOI10.1016/0377-2217(95)00291-XzbMath0913.90112OpenAlexW2077254698WikidataQ127360559 ScholiaQ127360559MaRDI QIDQ1268236

Young Rhee, Harry G. Perros

Publication date: 31 May 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00291-x

zbMATH Keywords

upper and lower boundsmean waiting timeconstant service timespopulation constraintsemaphore queueexternal queueopen tandem queueing network

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

Some notes on the reduction of network dimensionality in nested open queueing networks

Cites Work

• Unnamed Item
• Approximate behavior of tandem queues
• Technical Note—Some Simpler Bounds on the Mean Queuing Time
• A Tandem Network of Queues with Deterministic Service and Intermediate Arrivals
• An Approximate Analytical Method for General Queueing Networks
• A modified erlang approach to approximating GI/G/1 queues
• Queuing Networks with Population Size Constraints
• Delay Decomposition at a Single Server queue with Constant Service Time and Multiple Inputs
• Nested sliding window protocols with packet fragmentation
• Reduction Methods for Tandem Queuing Systems
• A Sequence of Service Stations with Arbitrary Input and Regular Service Times
• Some Inequalities in Queuing
• Some inequalities for the queue GI/G/1