Shortest Expected Delay Routing for Erlang Servers

Adan, I.J.B.F. & Wessels, J. (1993). Shortest Expected Delay Routing for Erlang Servers. Eindhoven University of Technology , Eindhoven, Netherlands.

Preview

Text 453579.pdf - Published Version Available under License Creative Commons Attribution. Download (2MB) | Preview

Abstract

The queueing problem with a Poisson arrival stream and two identical Erlang servers is analysed for the queueing discipline based on shortest expected delay. This queueing problem may be represented as a random walk on the integer grid in the first quadrant of the plane. In the paper it is shown that the equilibrium distribution of this random walk can be written as a countable linear combination of product forms. This linear combination is constructed in a compensation procedure. In this case the compensation procedure is essentially more complicated than in other cases where the same idea was exploited. The reason for the complications is that in this case the boundary consists of several layers which in turn is caused by the fact that transitions starting in inner states are not restricted to end in neighbouring states. Good starting solutions for the compensation procedure are found by solving the shortest expected delay problem with the same service distributions but with instantaneous jockeying. It is also shown that the results can be used for an efficient computation of relevant performance criteria.

Actions (login required)

View Item