Abstract

We consider a tandem queueing system with Markovian Arrival Process (MAP) as a model of remote technical support. The first stage is a multi-server queueing system with a finite buffer and impatient customers. After the service at the first stage the customer leaves the system or moves to the second stage. The second stage has a finite number of servers and an infinite buffer. The service time at the first and second stages has an exponential distribution with different parameters. The ergodicity condition is derived. A numerically stable algorithm for calculation of the stationary distribution of the system under consideration is presented. The main performance measures are calculated. The Laplace-Stieltjes transforms of the sojourn time distribution at the both stages are derived.

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 call

Disclaimer: 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.