Time-changing and truncating K-capacity queues from one K to another
From MaRDI portal
Publication:3980531
DOI10.2307/3214498zbMath0748.60095OpenAlexW159764143MaRDI QIDQ3980531
Publication date: 26 June 1992
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3214498
vacation modelsample path analysisergodic joint distribution of queue length and age of service timeergodic queue length probabilitiesrandom time-charge
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (4)
Decomposition property in a discrete-time queue with multiple input streams and service interruptions ⋮ The \(M/G/1/K\) blocking formula and its generalizations to state-dependent vacation systems and priority systems ⋮ A sample path analysis of \(M/GI/1\) queues with workload restrictions ⋮ Sample-path analysis of the proportional relation and its constant for discrete-time single-server queues
This page was built for publication: Time-changing and truncating K-capacity queues from one K to another