Exact transient solution of a state-dependent queue in discrete time
From MaRDI portal
A discrete-time single-server queue is considered where the customers are discouraged by the queue length and the arrivals are geared due to the availability of service. The methods of continuous fractions and confluent hypergeometric functions are applied to describe the probability distribution of the system size as well as of busy period.
Recommendations
- Exact transient solution of a discrete time queue with state-dependent rates
- Transient behaviour of a simple queue with discouraged arrivals
- Analysis of state-dependent discrete-time queue with system disaster
- Transient solution for a queue with state- and time-dependent rates
- Transient analysis of a discrete-time infinite server queue with system disaster
Cites work
- Continued fractions with applications
- scientific article; zbMATH DE number 3858110 (Why is no real title available?)
- scientific article; zbMATH DE number 193562 (Why is no real title available?)
- scientific article; zbMATH DE number 1251882 (Why is no real title available?)
- On the transient state probabilities for a queueing model where potential customers are discouraged by queue length
- Queueing modelling fundamentals.
Cited in
(5)- Transient analysis of a queue where potential customers are discouraged by queue length
- Exact transient solutions of nonempty Markovian queues
- Exact transient solution of a discrete time queue with state-dependent rates
- Transient behaviour of a simple queue with discouraged arrivals
- Transient solution of multiprocessor systems with state-dependent arrivals
This page was built for publication: Exact transient solution of a state-dependent queue in discrete time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5945395)
