A state-dependent queue alternating between arrivals and services
Summary: A queueing system usually involves an arrival process, service time distribution, service discipline, system capacity, etc. and steady-state performance measures extensively studied. However, time-dependent probabilities are important in applications and they do not involve convergence conditions. Further, several different models can have the same steady-state probabilities. We consider a novel state-dependent queueing system which alternating between arrival and service-states. We assume that the arrival, service and transfer rates depend on the number present in the system. Time-dependent system size probabilities and the duration of the busy period are obtained in a closed form for state-independent rates. We present numerical illustrations when the parameters are state-dependent. We have employed Continued Fractions effectively to achieve these transient results for this complex system.
- Transient solution for a queue with state- and time-dependent rates
- State-dependent \(\mathrm{M}/\mathrm{G}/1\) queueing systems
- Exact transient solution of a discrete time queue with state-dependent rates
- On the numerical solution of transient probabilities of a state-dependent multiserver queue
- Transient Analysis for State-Dependent Queues with Catastrophes
This page was built for publication: A state-dependent queue alternating between arrivals and services
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1042699)
