End-to-end Delay Prediction Based on Traffic Matrix Sampling

In this paper we focus on the problem of predicting Quality of Service (QoS), and in particular end-to-end delay, by using traffic matrix samples. To this aim, we study different models based on machine learning as a promising tool to characterize performance in complex computer networks. More specifically, we first provide a simulation platform, based on NS 3 network simulator, in which each Origin-Destination (OD) flow is a mixture of UDP and TCP traffic and we generate useful data for our study. We present three datasets over which we gradually vary the network characteristics: incoming traffic intensity, link capacities, and propagation delays. The datasets are leveraged to train machine learning models, namely Neural Networks and Random Forests, to predict end-to-end delay starting from the knowledge of OD traffic matrix samples. The robustness of these models is evaluated in different test scenarios. Numerical results show that both models are able to accurately forecast the end-to-end delay over all tested datasets, with Random Forests outperforming Neural Networks with gaps as high as 40%.

[1]  Vasilis Friderikos,et al.  Delay Sensitive Virtual Network Function Placement and Routing , 2018, 2018 25th International Conference on Telecommunications (ICT).

[2]  Yusheng Ji,et al.  Understanding the Modeling of Computer Network Delays using Neural Networks , 2018, Big-DAMA@SIGCOMM.

[3]  Eitan Altman,et al.  Competitive routing in networks with polynomial costs , 2002, IEEE Trans. Autom. Control..

[4]  Jennifer Rexford,et al.  Route Optimization in IP Networks , 2006, Handbook of Optimization in Telecommunications.

[5]  Albert Cabellos-Aparicio,et al.  Unveiling the potential of Graph Neural Networks for network modeling and optimization in SDN , 2019, SOSR.

[6]  Michael Seufert,et al.  Features that Matter: Feature Selection for On-line Stalling Prediction in Encrypted Video Streaming , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[7]  Konstantina Papagiannaki,et al.  Structural analysis of network traffic flows , 2004, SIGMETRICS '04/Performance '04.

[8]  Laurent Vanbever,et al.  Stroboscope: Declarative Network Monitoring on a Budget , 2018, NSDI.

[9]  Zhibo Gong,et al.  Deep-Q: Traffic-driven QoS Inference using Deep Generative Network , 2018, NetAI@SIGCOMM.

[10]  Christophe Duhamel,et al.  k-splittable delay constrained routing problem: A branch and price approach , 2007, 2007 6th International Workshop on Design and Reliable Communication Networks.

[11]  George F. Riley,et al.  The ns-3 Network Simulator , 2010, Modeling and Tools for Network Simulation.

[12]  Luís Gouveia,et al.  Models for the piecewise linear unsplittable multicommodity flow problems , 2017, Eur. J. Oper. Res..

[13]  Thomas Bonald,et al.  Internet and the Erlang formula , 2012, CCRV.

[14]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .

[15]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[16]  Walid Ben-Ameur,et al.  Mathematical Models of the Delay Constrained Routing Problem , 2006, Algorithmic Oper. Res..