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

  • Authors:
  • Minothi Parulekar;Armand M. Makowski

  • Affiliations:
  • Electrical Engineering Department, and Institute for Systems Research, University of Maryland, College Park, MD 20742, USA E-mail: minothi@eng.umd.edu, armand@isr.umd.edu;Electrical Engineering Department, and Institute for Systems Research, University of Maryland, College Park, MD 20742, USA E-mail: minothi@eng.umd.edu, armand@isr.umd.edu

  • Venue:
  • Queueing Systems: Theory and Applications
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

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.