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≥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 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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.