Shortest expected delay routing for Erlang servers

Shortest expected delay routing for Erlang servers

0.00 Avg rating0 Votes
Article ID: iaor19993195
Country: United States
Volume: 23
Issue: 1/4
Start Page Number: 77
End Page Number: 105
Publication Date: Jan 1996
Journal: Queueing Systems
Authors: ,
Keywords: M/E/c queues
Abstract:

The queueing problem with Poisson arrivals and two identical parallel Erlang servers is analyzed for the case of shortest expected delay routing. This problem may be represented as a random walk on the integer grid in the first quadrant of the plane. An important aspect of the random walk is that it is possible to make large jumps in the direction of the boundaries. This feature gives rise to complicated boundary behavior. Generating function approaches to analyze this type of random walk seem to be extremely complicated and have not been successful yet. The approach presented in this paper directly solves the equilibrium equations. It is shown that the equilibrium distribution of the random walk can be written as an infinite linear combination of products. This linear combination is constructed in a compensation procedure. The starting solutions for this procedure are found by solving the shortest expected delay problem with instantaneous jockeying. The results can be used for an efficient computation of performance criteria, such as the waiting time distribution and the moments of the waiting time and the queue lengths.

Reviews

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