This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via Google Scholar Google Scholar Articles by Scheller-Wolf, A. Search for Related Content

Necessary and Sufficient Conditions for Delay Moments in FIFO Multiserver Queues with an Application Comparing s Slow Servers with One Fast One

Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213-3890
awolf{at}andrew.cmu.edu

In this paper we establish the weakest known sufficient conditions for the existence of stationary delay moments in FIFOGI/GI/squeues, fors 2. These conditions involve not only the service time distribution, as in the classic Kiefer and Wolfowitz conditions, but also the interplay of the traffic intensity and the number of servers in the queue. We then prove the necessity of our conditions for a large class of service times having finite first, but infinite th, moment for some finite . Such service time distributions include many, but not all of, the class of heavy-tailed distributions: The Pareto and Cauchy are members; the Weibull is not.

Our results are then applied to provide one answer to the classic question: When aresslow servers (operating at rate 1/s) better than one fast server (operating at rate 1)? We consider this question with respect to the rate of decay of the tail of stationary customer delay. In a system characterized by service times that have finite mean but lack some higher moments, such as are often used to model telecommunications traffic, forsgreater than a traffic-related constant, the answer isalways. Our results help to quantify the benefits of extra servers, while also pointing the way towards the derivation of bounds and asymptotics for the stationary delay distribution of multiserver queues having these types of service times. Such queues are attracting a great deal of academic research, motivated by their practical use modeling telecommunications systems.

Subject classifications: Probability, random walk, stochastic model application; Queues: limit theorems, multichannel; Computers: system design and operation.
History: Received September 2001; revision received May 2002; revision received September 2002; accepted September 2002.