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

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 the...

Full description

Saved in:
Bibliographic Details
Published in:Management science 1979-03, Vol.25 (3), p.285-289
Main Authors: Ramaswami, V, Lucantoni, David M
Format: Article
Language:English
Subjects:
probability: renewal processes
queues: busy period analysis
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.25.3.285