Abstract
We discuss the application of an efficient numerical algorithm to sensitivity analysis of the GI/M/1 queue. Specifically, we use a numerical approach based on the Taylor series expansion to examine the robustness of the GI/M/1 queue to some specific perturbations in the arrival process: linear and non-linear perturbations. For each kind of perturbation we approximately compute the sensitivity of the main characteristics of the GI/M/1 queue corresponding to the case where the arrival processes are lightly different from that of the nominal queue. Numerical examples are presented to illustrate the accuracy of the proposed approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abbas, K., Aïssani, D.: Strong Stability of the Embedded Markov Chain in an GI/M/1 Queue with Negative Customers. Applied Mathematical Modelling 34, 2806–2812 (2010)
Abbas, K., Heidergott, B.: A Functional Approximation for Queues with Breakdowns (in preparation)
Abbas, K., Heidergott, B., Aïssani, D.: A Functional Approximation for the M/G/1/N Queue. Discrete Event Dynamic Systems 23, 93–104 (2013)
Albin, S.L.: Analyzing M/M/1 Queues with Perturbations in the Arrival Process. Journal of the Operational Research Society 35, 303–309 (1984)
Benaouicha, M., Aïssani, D.: Strong Stability in a G/M/1 Queueing System. Theory of Probability and Mathematical Statistics 71, 22–32 (2004)
Campbell, S.L., Meyer Jr., C.D.: Generalized Inverses of Linear Transformations. Dover Publications, Mineola (1991)
De Turck, K., De Cuypere, E., Wittevrongel, S., Fiems, D.: Algoritmic Approach to Series Expansions around Transient Markov Chains with Applications to Paired Queuing Systems. In: 6th International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2012), pp. 38–44. IEEE Press, Piscataway (2012)
De Turck, K., Fiems, D., Wittevrongel, S., Bruneel, H.: A Taylor Series Expansions Approach to Queues with Train Arrivals. In: 5th International ICST Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2011), pp. 447–455. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), Brussels (2011)
Fricker, C., Guillemin, F., Robert, P.: Perturbation Analysis of an M/M/1 Queue in a Diffusion Random Environment. Queueing Systems: Theory and Applications 61, 1–35 (2009)
Gross, D., Harris, C.: Fundamentals of Queueing Theory. Wiley (1985)
Heidergott, B., Hordijk, A.: Taylor Series Expansions for Stationary Markov Chains. Advances in Applied Probability 35, 1046–1070 (2003)
Heidergott, B., Hordijk, A., Leder, N.: Series Expansions for Continuous-Time Markov Processes. Operations Research 58, 756–767 (2010)
Kotzurek, M., Stoyan, D.: A Quantitative Continuity Theorem for Mean Stationary Waiting Time in GI/G/l. Mathematische Operationsforschung und Statistik 7, 595–599 (1976)
Núñez-Queija, R., Altman, E., Avrachenkov, K.: Perturbation Analysis for Denumerable Markov Chains with Application to Queueing Models. Advances in Applied Probability 36, 839–853 (2004)
Schweitzer, E.: Perturbation Theory and Finite Markov Chains. Journal of Applied Probability 5, 401–413 (1968)
Whitt, W.: Quantitative Continuity Results for the GI/G/l Queue. Bell Laboratories report (1981)
Zolotarev, V.M.: General Problems of the Stability of Mathematical Models. In: 41st International Statistical Institute, New Delhi (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ouazine, S., Abbas, K., Heidergott, B. (2013). The Taylor Series Expansions for Performance Functions of Queues: Sensitivity Analysis. In: Dudin, A., De Turck, K. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2013. Lecture Notes in Computer Science, vol 7984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39408-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-39408-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39407-2
Online ISBN: 978-3-642-39408-9
eBook Packages: Computer ScienceComputer Science (R0)