STABILIZING PERFORMANCE IN NETWORKS OF QUEUES WITH TIME-VARYING ARRIVAL RATES. Issue 4 (9th July 2014)

• Record Type: Journal Article
• Authors: Liu, Yunan; Whitt, Ward
• Is Part Of: Probability in the engineering and informational sciences. Volume 28:Issue 4(2014)
• Page Start: 419
• Page End: 449
• Publication Date: 2014-07-09
• Subjects: Probabilities -- Periodicals; Engineering -- Statistical methods -- Periodicals; Information science -- Statistical methods -- Periodicals; 519.202462
• DOI: 10.1017/S0269964814000084
• Languages: English
• ISSNs: 0269-9648

Abstract

<abstract abstract-type="normal"> <title> <x content-type="archive" xml:space="preserve">Abstract</x> </title> <p>This paper investigates extensions to feed-forward queueing networks of an algorithm to set staffing levels (the number of servers) to stabilize performance % at Quality of Service (QoS) targets in an <italic>M</italic><sub><italic>t</italic></sub>/<italic>GI</italic>/<italic>s</italic><sub><italic>t</italic></sub>+<italic>GI</italic> multi-server queue with a time-varying arrival rate. The model has a non-homogeneous Poisson process (NHPP), customer abandonment, and non-exponential service and patience distributions. For a single queue, simulation experiments showed that the algorithm successfully stabilizes abandonment probabilities and expected delays over a wide range of Quality-of-Service (QoS) targets. A limit theorem showed that stable performance at fixed QoS targets is achieved asymptotically as the scale increases (by letting the arrival rate grow while holding the service and patience distributions fixed). Here we extend that limit theorem to a feed-forward queueing network. However, these fixed QoS targets provide low QoS as the scale increases. Hence, these limits primarily support the algorithm with a low QoS target. For a high QoS target, effectiveness depends on the NHPP property, but the departure process never is exactly an NHPP. Thus, we investigate when a departure process can be regarded as approximately an NHPP. We show that index of dispersion for counts is effective for determining when a departure process is approximately an NHPP in this setting. In the important common case when all queues have high QoS targets, we show that both: (i) the departure process is approximately an NHPP from this perspective and (ii) the algorithm is effective.</p> </abstract>