Abstract
Abstract 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
