Queue length distribution in a first-in-first-out single-server queue with multiple arrival streams having different service time distributions

Queue length distribution in a first-in-first-out single-server queue with multiple arrival streams having different service time distributions

0.00 Avg rating0 Votes
Article ID: iaor20041291
Country: Netherlands
Volume: 39
Issue: 4
Start Page Number: 349
End Page Number: 375
Publication Date: Dec 2001
Journal: Queueing Systems
Authors:
Keywords: markov processes
Abstract:

This paper considers the queue length distribution in a class of FIFO single-server queues with (possibly correlated) multiple arrival streams, where the service time distribution of customers may be different for different streams. It is widely recognized that the queue length distribution in a FIFO queue with multiple non-Poissonian arrival streams having different service time distributions is very hard to analyze, since we have to keep track of the complete order of customers in the queue to describe the queue length dynamics. In this paper, we provide an alternative way to solve the problem for a class of such queues, where arrival streams are governed by a finite-state Markov chain. We characterize the joint probability generating function of the stationary queue length distribution, by considering the joint distribution of the number of customers arriving from each stream during the stationary attained waiting time. Further we provide recursion formulas to compute the stationary joint queue length distribution and the stationary distribution representing from which stream each customer in the queue arrived.

Reviews

Required fields are marked *. Your email address will not be published.