Analytic computation schemes for the discrete-time bulk service queue

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

40 Citaten (Scopus)
1 Downloads (Pure)

Samenvatting

In commonly used root-finding approaches for the discrete-time bulk service queue, the stationary queue length distribution follows from the roots inside or outside the unit circle of a characteristic equation. We present analytic representations of these roots in the form of sample values of periodic functions with analytically given Fourier series coefficients, making these approaches more transparent and explicit. The resulting computational scheme is easy to implement and numerically stable. We also discuss a method to determine the roots by applying successive substitutions to a fixed point equation. We outline under which conditions this method works, and compare these conditions with those needed for the Fourier series representation. Finally, we present a solution for the stationary queue length distribution that does not depend on roots. This solution is explicit and well-suited for determining tail probabilities up to a high accuracy, as demonstrated by some numerical examples.
Originele taal-2Engels
Pagina's (van-tot)141-163
TijdschriftQueueing Systems: Theory and Applications
Volume50
Nummer van het tijdschrift2-3
DOI's
StatusGepubliceerd - 2005

Vingerafdruk

Duik in de onderzoeksthema's van 'Analytic computation schemes for the discrete-time bulk service queue'. Samen vormen ze een unieke vingerafdruk.

Citeer dit