A fork-join queueing model: Diffusion approximation, integral representations and asymptotics

A fork-join queueing model: Diffusion approximation, integral representations and asymptotics

0.00 Avg rating0 Votes
Article ID: iaor19993187
Country: United States
Volume: 22
Issue: 3/4
Start Page Number: 287
End Page Number: 322
Publication Date: Oct 1996
Journal: Queueing Systems
Authors: ,
Keywords: M/M/1 queues
Abstract:

We consider two parallel M/M/1 queues which are fed by a single Poisson arrival stream. An arrival splits into two parts, with each part joining a different queue. This is the simplest example of a fork-join model. After the individual parts receive service, they may be joined back together, though we do not consider the join part here. We study this model in the heavy traffic limit, where the service rate in either queue is only slightly larger than the arrival rate. In this limit we obtain asymptotically the joint steady-state queue length distribution. In the symmetric case, where the two servers are identical, this distribution has a very simple form. In the non-symmetric case we derive several integral representations for the distribution. We then evaluate these integrals asymptotically, which leads to simple formulas which show the basic qualitative structure of the joint distribution function.

Reviews

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