Note—On the Merits of an “Approximation” to the Busy Period of the <i>GI</i>/<i>G</i>/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 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.

• 저널Management Science · 25(3) · 285–289
• 토픽Advanced Queuing Theory Analysis · Management Information Systems
• DOI10.1287/mnsc.25.3.285
• 저자V. Ramaswami, David M. Lucantoni