Abstract
Queueing systems with a special service mechanism are considered. Arrivals consist of two types of customers, and services are performed for pairs of one customer from each type. The state of the queue is described by the number of pairs and the difference, called the excess, between the number of customers of each class. Under different assumptions for the arrival process, it is shown that the excess, considered at suitably defined epochs, forms a Markov chain which is either transient or null recurrent. A system with Poisson arrivals and exponential services is then considered, for which the arrival rates depend on the excess, in such a way that the excess is bounded. It is shown that the queue is stable whenever the service rate exceeds a critical value, which depends in a simple manner on the arrival rates. For stable queues, the stationary probability vector is of matrix-geometric form and is easily computable.
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.
