Note--On the Merits of an "Approximation" to the Busy Period of the GI/G/1 Queue

V. Ramaswami and David M. Lucantoni
Additional contact information
V. Ramaswami: Drexel University
David M. Lucantoni: University of Delaware

Management Science, 1979, vol. 25, issue 3, 285-289

Abstract: An approximation suggested by D. Gross and C. M. Harris in their book Fundamentals of Queueing Theory for computing the busy period characteristics in the single server queue with renewal input and general i.i.d. service times commonly denoted by GI/G/1 is shown to be lacking in accuracy, and therefore quite undesirable for practical use. Incidentally, we also demonstrate how for a wide subclass of such queues, computations can be done exactly using practical algorithmic methods.

Keywords: queues: busy period analysis; probability: renewal processes (search for similar items in EconPapers)
Date: 1979
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.25.3.285 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:25:y:1979:i:3:p:285-289

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().