Tail probabilities for M/G/∞ input processes (I): Preliminary asymptotics

Tail probabilities for M/G/∞ input processes (I): Preliminary asymptotics

0.00 Avg rating0 Votes
Article ID: iaor20002520
Country: United States
Volume: 27
Issue: 3/4
Start Page Number: 271
End Page Number: 296
Publication Date: Apr 1997
Journal: Queueing Systems
Authors: ,
Abstract:

The infinite server model of Cox with arbitrary service time distribution appears to provide a large class of traffic models – Pareto and log-normal distributions have already been reported in the literature for several applications. Here we begin the analysis of the large buffer asymptotics for a multiplexer driven by this class of inputs. To do so we rely on recent results by Duffield and O'Connell on overflow probabilities for the general single server queue. In this paper we focus on the key step in this approach: The appropriate large deviations scaling is shown to be related to the forward recurrence time of the service time distribution, and a closed form expression is derived for the corresponding generalized limiting log-moment generating function associated with the input process. Three different regimes are identified. In a companion paper we apply these results to obtain the large buffer asymptotics under a variety of service time distributions.

Reviews

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