Analysis of a discrete-time queue with load dependent service under discrete-time Markovian arrival process
DOI10.1016/J.JKSS.2014.03.003zbMath1304.60105OpenAlexW2043856757MaRDI QIDQ488600
U. C. Gupta, Sujit Kumar Samanta, Veena Goswami
Publication date: 26 January 2015
Published in: Journal of the Korean Statistical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jkss.2014.03.003
imbedded Markov chainsupplementary variable techniquediscrete-time Markovian arrival processqueue length dependent servicesteady-state probability
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An \(M/G/1\)-type queuing model with service times depending on queue length
- A queueing system with queue length dependent service times, with applications to cell discarding in ATM networks
- Descriptors of arrival-process burstiness with application to the discrete Markovian arrival process
- On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals
- On the relations among the distributions at different epochs for discrete-time GI/Geom/1 queues
- Data and queueing analysis of a Japanese air-traffic flow
- Analysis of an MMPP/G/1/K queue with queue length dependent arrival rates, and its application to preventive congestion control in telecommunication networks
- Regenerative Analysis and Steady State Distributions for Markov Chains
- Simultaneity in discrete-time single server queues with Bernoulli inputs
- On the Analysis of the Discrete-Time Geom(n)/G(n)/1/N Queue
This page was built for publication: Analysis of a discrete-time queue with load dependent service under discrete-time Markovian arrival process