Moments of the queue size distribution in the MAP/G/1 retrial queue

Kim, Jeongsim; Kim, Bara; Kim, Jerim

doi:10.1016/j.cor.2009.04.007

Cited by 5 publications

(1 citation statement)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Later, queueing models with MAP have been studied extensively, in past, see e.g., [9][10][11][12][13][14][15] and many others. For recent development in MAP, see, [16][17][18][19][20][21] and the references therein.…”

Section: Introductionmentioning

confidence: 99%

Analysis of finite buffer queue with state dependent service and correlated customer arrivals

Banerjee

2016

Journal of the Egyptian Mathematical Society

View full text Add to dashboard Cite

This paper deals with a finite capacity queue with workload dependent service. The arrival of a customer follows Markovian arrival process (MAP). MAP is very effective arrival process to model massage-flow in the modern telecommunication networks, as these messages are very bursty and correlated in nature. The service time, which depends on the queue length at service initiation epoch, is considered to be generally distributed. Queue length distribution at various epoch and key performance measures have been obtained. Finally, some numerical results have been discussed to illustrate the numerical compatibility of the analytic analysis of the queueing model under consideration. 2000 MATHEMATICS SUBJECT CLASSIFICATION: 60K25; 68M20; 90B22 ª 2015 Production and hosting by Elsevier B.V. on behalf of Egyptian Mathematical Society. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

show abstract