IIASA RepositoryShortest Expected Delay Routing for Erlang ServersI.J.B.F.AdanauthorJ.WesselsauthorThe 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.1993-11-26Eindhoven University of TechnologyOther

For work being deposited by its own author: In self-archiving this collection of files and associated bibliographic metadata, I grant IIASA Repository the right to store them and to make them permanently available publicly for free on-line. I declare that this material is my own intellectual property and I understand that IIASA Repository does not assume any responsibility if there is any breach of copyright in distributing these files or metadata. (All authors are urged to prominently assert their copyright on the title page of their work.)

For work being deposited by someone other than its author: I hereby declare that the collection of files and associated bibliographic metadata that I am archiving at IIASA Repository) is in the public domain. If this is not the case, I accept full responsibility for any breach of copyright that distributing these files or metadata may entail.

Clicking on the deposit button indicates your agreement to these terms.