Analysis of an \(M/M/1 + G\) queue operated under the FCFS policy with exact admission control
DOI10.1007/s11134-013-9366-6zbMath1277.90028OpenAlexW2115184432MaRDI QIDQ386350
Lawrence Jenkins, Sudipta Das, Debasis Sengupta
Publication date: 9 December 2013
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-013-9366-6
bounded sojourn timeexact admission controlfirm real-time systemloss ratioreal-time queueservice time-dependent scheduling
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Cites Work
- The \(M/G/1+G\) queue revisited
- On queueing with customer impatience until the beginning of service
- Rejection rules in the \(M/G/1\) queue
- Explicit solutions for the steady state distributions in \(M/PH/1\) queues with workload dependent balking
- Single server queues with restricted accessibility
- Finite-buffer queues with workload-dependent service and arrival rates
- Queueing systems with restricted workload: an explicit solution
- Single-server queues with impatient customers
- On Queueing with Customer Impatience Until the End of Service
- The Markovian Queue with Bounded Waiting time
- Weakly hard real-time systems
- General customer impatience in the queue GI/G/1
- Queuing with Impatient Customers and Indifferent Clerks
- Queuing with Impatient Customers and Ordered Service
- On the waiting time distribution in a generalized queueing system with uniformly bounded sojourn times
This page was built for publication: Analysis of an \(M/M/1 + G\) queue operated under the FCFS policy with exact admission control