The GI/Geom/N Queue In Discrete Time

DOI10.1080/03155986.1978.11731705zbMath0388.60095OpenAlexW2394715347MaRDI QIDQ4170041

No author found.

Publication date: 1978

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1978.11731705

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Queueing theory (aspects of probability theory) (60K25)

Related Items (11)

On discrete-time multiserver queues with finite buffer: \(GI/Geom/m/N\) ⋮ Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues ⋮ Discrete scheduling and critical utilization ⋮ Customers' joining behavior in an unobservable \(GI/Geo/m\) queue ⋮ History of Queueing Theory in Canada Prior to 1980 ⋮ Performance analysis of a \(GI^{[X}/Geo/m/N\) queue with partial- and total-batch rejection] ⋮ A new and pragmatic approach to the \(GI^X /Geo/c/N\) queues using roots ⋮ Multiserver bulk service discrete-time queue with finite buffer and renewal input ⋮ Computing queue length and waiting time distributions in finite-buffer discrete-time multiserver queues with late and early arrivals ⋮ Analyzing discrete-time bulk-serviceGeo/Geo^b/mqueue ⋮ Performance analysis of finite buffer discrete-time queue with bulk service

This page was built for publication: The GI/Geom/N Queue In Discrete Time