Complete analytic and computational analyses of the discrete-time bulk-arrival infinite-server system: GIX/Geom/∞

Complete analytic and computational analyses of the discrete-time bulk-arrival infinite-server system: GIX/Geom/∞

0.00 Avg rating0 Votes
Article ID: iaor2005767
Country: United Kingdom
Volume: 31
Issue: 13
Start Page Number: 2119
End Page Number: 2135
Publication Date: Nov 2004
Journal: Computers and Operations Research
Authors: ,
Keywords: GI/G/infinity queues
Abstract:

In this paper, we consider the discrete-time queueing system with bulk arrivals, generally distributed inter-batch times, geometrically distributed service times, and infinite number of servers: the GIX/Geom/∞ queue. Under the assumptions of early arrival system and late arrival system, we derive the system size distributions at two different epochs – prearrival and random. In addition, simple relations among the binomial moments of the steady-state system-size distributions of the two systems are derived. Special cases, such as the GI/Geom/∞ or GI/D/∞ queues, are also presented. Some numerical results are included at the end.

Reviews

Required fields are marked *. Your email address will not be published.