Abstract
In this paper we use the burst factor of a packet stream, which is defined in a general setting, to quantify the long-term variability, or burstiness, of such a stream. We briefly review some existing results to show that this parameter plays an important role in the performance assessment and dimensioning of buffers in network nodes, even in a non-Markovian setting. We then focus on the calculation of this parameter at the egress of a discrete-time GI / D / 1 queueing system, considering different routing scenarios, and show how it can be expressed in terms of the parameters that characterise the arrival process in such a queue. In addition, we demonstrate how these results can be applied to evaluate the buffer performance in the subsequent nodes of a network. The analytic results that are derived throughout this paper are supported by simulations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abate, J., Choudhury, G. L., & Whitt, W. (1995). Exponential approximation for tail probabilities of queues, I: Waiting times. Operations Research, 43(5), 885–901.
Abate, J., Choudhury, G. L., & Whitt, W. (1996). Exponential approximation for tail probabilities of queues, II: Sojourn time and workload. Operations Research, 44(5), 758–763.
Al Hanbali, A., Mandjes, M., Nazarathy, Y., & Whitt, W. (2011). The asymptotic variance of departures in critically loaded queues. Advances in Applied Probability, 43(1), 243–263.
Blondia, C. (1993). A discrete time batch Markovian arrival process as B-ISDN traffic model. Belgian Journal of Operations Research Statistics and Computer Science, 32, 3–23.
Bruneel, H., & Kim, B. G. (1993). Discrete-time models for communication systems including ATM. Norwell, MA:Kluwer Academic Publishers. ISBN 0-7923-9292-2.
Bruneel, H., Steyaert, B., Desmet, E., & Petit, G. H. (1994). Analytic derivation of tail probabilities for queue lengths and waiting times in ATM multiserver queues. European Journal of Operational Research, 76, 563–572.
Choe, J., & Shroff, N. B. (1998). A central-limit-theorem-based approach for analyzing queue behavior in high-speed networks. IEEE/ACM Transactions on Networking, 6(5), 659–671.
Daley, D. J. (1976). Queueing output processes. Advances in Applied Probability, 8(2), 395–415.
Halfin, S., & Whitt, W. (1981). Heavy-traffic limits for queues with many exponential servers. Operations Research, 29(3), 567–588.
Ji, Q. J. (2004). Can multifractal traffic burstiness be approximated by Markov modulated poisson processes? In Proceedings of 12th IEEE international conference on networks (ICON 2004), (pp. 26–30). Singapore.
Kim, B., & Kim, J. (2010). Queue size distribution in a discrete-time \(D-BMAP/G/1\) retrial queue. Computers & Operations Research, 37(7), 1220–1227.
Masuyama, H. (2011). Subexponential asymptotics of the stationary distributions of \(M/G/1-\)type Markov chains. European Journal of Operational Research, 213(3), 509–516.
Miyazawa, M. (2009). Tail decay rates in doubly QBD processes. Mathematics of Operations Research, 34(3), 547–575.
Nakagawa, K. (2004). On the exponential decay rate of the tail of a discrete probability distribution. Stocastic Models, 20(1), 31–42.
Nazarathy, Y. (2011). The variance of departure processes: Puzzling behavior and open problems. Queueing Systems, 68(3–4), 385–394.
Nazarathy, Y., & Weiss, G. (2008). The asymptotic variance rate of the output process of finite capacity birth-death queues. Queueing Systems, 59(2), 135–156.
Rueda, W. K. (1996). A survey of traffic characterization techniques in telecommunication networks. In: Proceedings of Canadian conference on electrical and computer engineering (vol. 2, pp. 830–833). Calgary.
Steyaert, B. (2008). Analysis of generic discrete-time buffer models with irregular packet arrival patterns. Ph.D. thesis, ISBN 978-908578-187-5. http://biblio.ugent.be/record/471285.
Steyaert, B., Claeys, D., & Bruneel, H. (2013). The burst factor and its impact on buffer performance. Information Processing Letters, 113(18), 681–684.
Szczotka, W. (1990). Exponential approximation of waiting time and queue size for queues in heavy traffic. Advances in Applied Probability, 22(10), 230–240.
Tai, Y., & He, Q. M. (2013). Logarithmic asymptotics for the GI/G/1-type Markov chains and their applications to the \(BMAP/G/1\) queue with vacations. INFOR, 51(2), 92–102.
Wischik, D. (2006). Buffer sizing theory for bursty TCP flows. In Proceedings IEEE 2006 international Zurich seminar on communications (pp. 98–101). Zurich. doi:10.1109/IZS.2006.1649089.
Wittevrongel, S., & Bruneel, H. (1998). Correlation effects in ATM queues due to data format conversions. Performance Evaluation, 32(1), 35–656.
Ying, Y., Guillemin, F., Mazumdar, R., & Rosenberg, C. (2008). Buffer overflow asymptotics for multiplexed regulated traffic. Performance Evaluation, 65(8), 555–572.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research has been funded by the Interuniversity Attraction Poles Programme initiated by the Belgian Science Policy Office.
Rights and permissions
About this article
Cite this article
Steyaert, B., Wittevrongel, S. & Bruneel, H. Characterisation of the output process of a discrete-time GI / D / 1 queue, and its application to network performance. Ann Oper Res 252, 175–190 (2017). https://doi.org/10.1007/s10479-015-2049-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-015-2049-4