Analysis of the symmetric shortest queue problem

I.J.B.F. Adan, J. Wessels, W.H.M. Zijm

Research output: Book/ReportReportAcademic

90 Downloads (Pure)

Abstract

In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On· arrival a job joins the shortest queue and in case both queues have equal lengths, he joins either queue with probability ½. By using a compensation method, we show that the stationary queue length distribution can be expressed as an infinite linear combination of product forms. Explicit relations are found for these product forms, as well as for the coefficients in the linear combination. These analytic results offer an elegant and efficient numerical algorithm, with effective bounds on the error of each partial sum.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages17
Publication statusPublished - 1990

Publication series

NameMemorandum COSOR
Volume9019
ISSN (Print)0926-4493

Fingerprint

Dive into the research topics of 'Analysis of the symmetric shortest queue problem'. Together they form a unique fingerprint.

Cite this