Analysis of an M/M/1 + G queue operated under the FCFS policy with exact admission control

DOI10.1007/S11134-013-9366-6MaRDI QIDQ386350zbMATH OpenOpenAlexFDO

Authors Sudipta Das, Lawrence Jenkins, 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

zbMATH Keywords

bounded sojourn timeexact admission controlfirm real-time systemloss ratioreal-time queueservice time-dependent scheduling

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) Stochastic scheduling theory in operations research (90B36)

Recommendations

• scientific article; zbMATH DE number 5252116
• Analysis of an M/G/1/K/N queue
• Analytical distribution of waiting time in the M/\{iD\}/1 queue
• A Unified Framework for the Analysis of M/G/1 Queue Controlled by Workload
• Queueing systems with restricted workload: an explicit solution

Cites work

• Explicit solutions for the steady state distributions in \(M/PH/1\) queues with workload dependent balking
• Finite-buffer queues with workload-dependent service and arrival rates
• General customer impatience in the queue GI/G/1
• On Queueing with Customer Impatience Until the End of Service
• On queueing with customer impatience until the beginning of service
• On the waiting time distribution in a generalized queueing system with uniformly bounded sojourn times
• Queueing systems with restricted workload: an explicit solution
• Queuing with impatient customers and indifferent clerks
• Queuing with impatient customers and ordered service
• Rejection rules in the \(M/G/1\) queue
• Single server queues with restricted accessibility
• Single-server queues with impatient customers
• The Markovian Queue with Bounded Waiting time
• The \(M/G/1+G\) queue revisited
• Weakly hard real-time systems

Cited in

(1)

• Server assignment policies in queues with customer abandonments

This page was built for publication: Analysis of an \(M/M/1 + G\) queue operated under the FCFS policy with exact admission control

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