Open AccessAnalysis of finite buffer queue with state dependent service and correlated customer arrivals
Author(s) -
Anuradha Banerjee
Publication year - 2016
Publication title -
journal of the egyptian mathematical society
Language(s) - English
Resource type - Journals
eISSN - 2090-9128
pISSN - 1110-256X
DOI - 10.1016/j.joems.2014.11.005
Subject(s) - computer science , queue , queueing theory , bulk queue , epoch (astronomy) , workload , state dependent , computer network , real time computing , mathematics , stars , computer vision , operating system , mathematical economics
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