Abstract

We consider a tandem queueing system consisting of two stations. The input flow at the single-server first station is described by a BMAP (batch Markovian arrival process). If a customer from this flow meets the busy server, it goes to the orbit of infinite size and tries its luck later on in exponentially distributed random time. The service time distribution at the first station is assumed to be semi-Markovian. After service at the first station a customer proceeds to the second station which is described by a multi-server queue without a buffer. The service time by the server of the second station is exponentially distributed. We derive the condition for the stable operation of the system and determine the stationary distribution of the system states. Some key performance measures are calculated and illustrative numerical results are presented.

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.