Burst Ratio of Packet Losses in Individual Network Flows
Volume 34, Issue 1 (2023), pp. 35–52
Pub. online: 8 February 2023
Type: Research Article
Open Access
Open Access
Received
1 June 2022
1 June 2022
Accepted
1 January 2023
1 January 2023
Published
8 February 2023
8 February 2023
Abstract
We study the burst ratio of packet loss processes in networking. This parameter characterizes the inclination of packet losses to form long, consecutive sequences. Such long sequences of losses may have a negative impact on multimedia streams, particularly those of real-time type. In packet networks, the burst ratio is often elevated due to overflows of packet buffers, which are present in all routers and switches. In the article, we investigate the burst ratio in the per-flow manner, i.e. individually for every flow of packets traversing a network node. We first confront all the per-flow burst ratios with each other, as well as with the burst ratio computed for the multiplexed traffic. Next, we study the influence of different features of the system on these burst ratios. In particular, the influence of rates of flows and their proportions, the standard deviation of interarrival times, the capacity of the buffer, the system load and the distribution of the service time, is studied. Special attention is paid to models with non-Poisson flows, which are not analytically tractable.
References
Baker, F., Fairhurst, G. (2015). IETF Recommendations Regarding Active Queue Management. Request for Comments RFC 7567, Internet Engineering Task Force. https://doi.org/10.17487/RFC7567.
Benko, P., Veres, A. (2002). A passive method for estimating end-to-end TCP packet loss. In: IEEE Global Telecommunications Conference, 2002. GLOBECOM ’02, Vol. 3, pp. 2609–26133. https://doi.org/10.1109/GLOCOM.2002.1189102.
Bolot, J.-C. (1993). End-to-end packet delay and loss behavior in the internet. In: Conference Proceedings on Communications Architectures, Protocols and Applications, SIGCOMM ’93. Association for Computing Machinery, New York, NY, USA, pp. 289–298. 978-0-89791-619-6. https://doi.org/10.1145/166237.166265.
Bratiychuk, M., Chydzinski, A. (2009). On the loss process in a batch arrival queue. Applied Mathematical Modelling, 33(9), 3565–3577. https://doi.org/10.1016/j.apm.2008.11.015.
Chydzinski, A. (2022). Per-flow structure of losses in a finite-buffer queue. Applied Mathematics and Computation, 428, 127215. https://doi.org/10.1016/j.amc.2022.127215.
Chydzinski, A., Adamczyk, B. (2012). Transient and stationary losses in a finite-buffer queue with batch arrivals. Mathematical Problems in Engineering, 2012, 1–17. https://doi.org/10.1155/2012/326830.
Chydzinski, A., Adamczyk, B. (2022). Burst ratios of individual flows. In: Rocha, A., Adeli, H., Dzemyda, G., Moreira, F. (Eds.), Information Systems and Technologies, Lecture Notes in Networks and Systems. Springer International Publishing, Cham, pp. 372–381. 978-3-031-04829-6. https://doi.org/10.1007/978-3-031-04829-6_33.
Chydzinski, A., Samociuk, D. (2019). Burst ratio in a single-server queue. Telecommunication Systems, 70(2), 263–276. https://doi.org/10.1007/s11235-018-0476-7.
Chydzinski, A., Barczyk, M., Samociuk, D. (2018a). The single-server queue with the dropping function and infinite buffer. Mathematical Problems in Engineering, 2018, 3260428. https://doi.org/10.1155/2018/3260428.
Chydzinski, A., Samociuk, D., Adamczyk, B. (2018b). Burst ratio in the finite-buffer queue with batch poisson arrivals. Applied Mathematics and Computation, 330, 225–238. https://doi.org/10.1016/j.amc.2018.02.021.
Cidon, I., Khamisy, A., Sidi, M. (1993). Analysis of packet loss processes in high-speed networks. IEEE Transactions on Information Theory, 39(1), 98–108. https://doi.org/10.1109/18.179347.
Duffield, N.G., Lo Presti, F., Paxson, V., Towsley, D. (2001). Inferring link loss using striped unicast probes. In: Proceedings IEEE INFOCOM 2001, Conference on Computer Communications, Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), Vol. 2, pp. 915–9232. https://doi.org/10.1109/INFCOM.2001.916283.
Feng, C.-W., Huang, L.-F., Xu, C., Chang, Y.-C. (2017). Congestion control scheme performance analysis based on nonlinear RED. IEEE Systems Journal, 11(4), 2247–2254. https://doi.org/10.1109/JSYST.2014.2375314.
Hotchi, R., Chibana, H., Iwai, T., Kubo, R. (2020). Active queue management supporting TCP flows using disturbance observer and Smith predictor. IEEE Access, 8, 173401–173413. https://doi.org/10.1109/ACCESS.2020.3025680.
Jelassi, S., Rubino, G. (2018). A perception-oriented Markov model of loss incidents observed over VoIP networks. Computer Communications, 128, 80–94. https://doi.org/10.1016/j.comcom.2018.06.009.
Kahe, G., Jahangir, A.H. (2019). A self-tuning controller for queuing delay regulation in TCP/AQM networks. Telecommunication Systems, 71(2), 215–229. https://doi.org/10.1007/s11235-018-0526-1.
Khoshnevisan, L., Salmasi, F.R. (2016). A robust and high-performance queue management controller for large round trip time networks. International Journal of Systems Science, 47(7), 1586–1597. https://doi.org/10.1080/00207721.2014.941959.
Lan, H., Ding, W., Zhang, Y. (2019). Strengthening packet loss measurement from the network intermediate point. KSII Transactions on Internet and Information Systems (TIIS), 13(12), 5948–5971. https://doi.org/10.3837/tiis.2019.12.009.
Leland, W.E., Taqqu, M.S., Willinger, W., Wilson, D.V. (1994). On the self-similar nature of ethernet traffic (extended version). IEEE/ACM Transactions on Networking, 2(1), 1–15. https://doi.org/10.1109/90.282603.
Nichols, K., Jacobson, V. (2012). Controlling Queue Delay: a modern AQM is just one piece of the solution to bufferbloat. Queue, 10(5), 20–34. https://doi.org/10.1145/2208917.2209336.
OpenSim Ltd. (2019). OMNeT++ Discrete Event Simulator. https://omnetpp.org/.
Patel, S., Karmeshu (2019). A new modified dropping function for congested AQM networks. Wireless Personal Communications, 104(1), 37–55. https://doi.org/10.1007/s11277-018-6007-8.
Paxson, V., Floyd, S. (1995). Wide area traffic: the failure of Poisson modeling. IEEE/ACM Transactions on Networking, 3(3), 226–244. https://doi.org/10.1109/90.392383.
Samociuk, D., Barczyk, M., Chydzinski, A. (2019). Measuring and analyzing the burst ratio in IP traffic. In: Li, Q., Song, S., Li, R., Xu, Y., Xi, W., Gao, H. (Eds.), Broadband Communications, Networks, and Systems, Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. Springer International Publishing, Cham, pp. 86–101. 978-3-030-36442-7. https://doi.org/10.1007/978-3-030-36442-7_6.
Sanneck, H.A., Carle, G. (1999). Framework model for packet loss metrics based on loss runlengths. In: Multimedia Computing and Networking 2000, Vol. 3969. SPIE, San Jose, CA, USA, pp. 177–187. https://doi.org/10.1117/12.373520.
Sommers, J., Barford, P., Duffield, N., Ron, A. (2005). Improving accuracy in end-to-end packet loss measurement. In: Proceedings of the 2005 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM ’05. Association for Computing Machinery, New York, NY, USA, pp. 157–168. 978-1-59593-009-5. https://doi.org/10.1145/1080091.1080111.
Wang, P., Zhu, D., Lu, X. (2017). Active queue management algorithm based on data-driven predictive control. Telecommunication Systems, 64(1), 103–111. https://doi.org/10.1007/s11235-016-0162-6.
Yajnik, M., Moon, S., Kurose, J., Towsley, D. (1999). Measurement and modelling of the temporal dependence in packet loss. In: IEEE INFOCOM ’99. Conference on Computer Communications, Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future Is Now (Cat. No.99CH36320), Vol. 1, pp. 345–3521. https://doi.org/10.1109/INFCOM.1999.749301.
Yu, X., Modestino, J.W., Tian, X. (2005). The accuracy of Gilbert models in predicting packet-loss statistics for a single-multiplexer network model. In: Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 4, pp. 2602–2612. https://doi.org/10.1109/INFCOM.2005.1498544.
Biographies
Chydzinski Andrzej
A. Chydzinski received his MSc degree with honours in applied mathematics in 1997, and his PhD and DSc degrees, in computer science, in 2002 and 2008, respectively, from the Silesian University of Technology. In 2015, he received the professor title from President of the Republic of Poland. Currently, he is a full professor at the Silesian University of Technology, and the head of Department of Computer Networks and Systems. His scientific interests are in computer networking, in particular in the performance evaluation, network modelling, queueing theory, virtualization of networks and discrete-event simulations. Prof. Chydzinski authored two scientific monographs and about 120 peer-reviewed papers, including publications in many leading scientific journals. He acted as the project leader in six large scientific projects, founded by research agencies, and participated in several other scientific projects as a researcher. He received three awards for outstanding conference papers and a prestigious award from POLITYKA, a well-recognized Polish magazine.
Adamczyk Blazej
B. Adamczyk received his MSc degree with honours in 2009, and his PhD in 2013 – both in computer science, from the Silesian University of Technology. Currently, he is an assistant professor at Department of Computer Networks and Systems at the Silesian University of Technology. His scientific interests are in operating systems and networking, virtualization and security. Dr. Adamczyk authored around 30 peer-reviewed papers, including publications in leading scientific journals. He participated as a researcher in several large scientific projects, founded by research agencies. He is leading a team in one of such projects at the moment. He has found many different vulnerabilities in computer systems and software and published them as CVEs using the responsible disclosure policy.
