EconPapers    
Economics at your fingertips  
 

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

Alan Scheller-Wolf ()
Additional contact information
Alan Scheller-Wolf: Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213-3890

Operations Research, 2003, vol. 51, issue 5, 748-758

Abstract: In this paper we establish the weakest known sufficient conditions for the existence of stationary delay moments in FIFO GI/GI/s queues, for s (ge)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 (alpha)th, moment for some finite (alpha). 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 are s slow 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, for s greater than a traffic-related constant, the answer is always . 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.

Keywords: Probability; random walk; stochastic model application; Queues: limit theorems; multichannel; Computers: system design and operation (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.51.5.748.16759 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:51:y:2003:i:5:p:748-758

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

 
Page updated 2025-03-19
Handle: RePEc:inm:oropre:v:51:y:2003:i:5:p:748-758