An interpolation approximation for queueing systems with Poisson input
Operations Research
Open queueing systems in light traffic
Mathematics of Operations Research
The QNET method for two-moment analysis of open queueing networks
Queueing Systems: Theory and Applications
An interpolation approximation for the mean workload in a GI/G/1 queue
Operations Research
An embedded gateway based on real-time database
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
A functional approximation for the M/G/1/N queue
Discrete Event Dynamic Systems
Hi-index | 0.00 |
The performance evaluation of many complex manufacturing, communication and computer systems has been made possible by modeling them as queueing systems. Many approximations used in queueing theory have been drawn from the behavior of queues in light and heavy traffic conditions. In this paper, we propose a new approximation technique, which combines the light and heavy traffic characteristics. This interpolation approximation is based on the theory of multipoint Padé approximation which is applied at two points: light and heavy traffic. We show how this can be applied for estimating the waiting time moments of the GI/G/1 queue. The light traffic derivatives of any order can be evaluated using the MacLaurin series analysis procedure. The heavy traffic limits of the GI/G/1 queue are well known in the literature. Our technique generalizes the previously developed interpolation approximations and can be used to approximate any order of the waiting time moments. Through numerical examples, we show that the moments of the steady state waiting time can be estimated with extremely high accuracy under all ranges of traffic intensities using low orders of the approximant. We also present a framework for the development of simple analytical approximation formulas.