Two-Stage Cyclic Queues with Nonexponential Servers: Steady-State and Cyclic Time

DOI10.1287/OPRE.34.3.455zbMATH Open0608.68023OpenAlexW2140696523MaRDI QIDQ3747713FDOQ3747713

Hans Daduna

Publication date: 1986

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.34.3.455

zbMATH Keywords

sojourn timesclosed networksmultiprogrammed computer systemnon-exponential FCFS queues

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)

Cited In (4)

• An efficient convolution algorithm for the non-Markovian two-node cyclic network
• Derivation of the \(N\)-step interdeparture time distribution in \(GI/G/1\) queueing systems
• Evaluation of the performance parameters of a closed queuing network using artificial neural networks
• The cyclic queue and the tandem queue

This page was built for publication: Two-Stage Cyclic Queues with Nonexponential Servers: Steady-State and Cyclic Time

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