Predicting Elephant Flows in Internet Exchange Point Programmable Networks

Internet Exchange Points (IXPs) are high-performance networks that allow multiple autonomous systems to exchange traffic, with benefits ranging from cost reductions to performance improvements. As in any network, IXP operators face daily management challenges to promote better usage of the services provided by the network. An essential problem in IXP management concerns the identification of elephant flows, which are characterized by having traffic size and duration significantly higher than other flows. The current approaches to the identification of elephant flow in IXP networks depend that the analyzed flows exceed predefined thresholds to classify them as elephants. However, although it is not perceptible initially, elephant flows are elephant ones since their first packet. Hence, in this paper, we present a mechanism to predict flows behavior using historical observations and, by recognizing temporal patterns, identify elephant flows even before they exceed such thresholds. Our approach consists in predicting new flows size and duration through a Locally Weighted Regression (LWR) model, using the previous flows behavior and its temporal correlation with the new flow. The experimental results show that our mechanism is able to predict the volume and duration of new flows, and react to elephant flows rapidly, approximately 50.3 ms with up to 32 historical samples in the prediction model. These numbers are much smaller than the time each flow would take to exceed the thresholds to classify it as an elephant. In addition, the mechanism accurately predicts up to 80% of elephant flows in our evaluation scenarios and approximately 5% of false positives.

[1]  Raj Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[2]  Lisandro Zambenedetti Granville,et al.  Mitigating elephant flows in SDN-based IXP networks , 2017, 2017 IEEE Symposium on Computers and Communications (ISCC).

[3]  Ted Taekyoung Kwon,et al.  OpenSample: A Low-Latency, Sampling-Based Measurement Platform for Commodity SDN , 2014, 2014 IEEE 34th International Conference on Distributed Computing Systems.

[4]  Q. Henry Wu,et al.  Electric Load Forecasting Based on Locally Weighted Support Vector Regression , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[5]  W. Cleveland,et al.  Locally Weighted Regression: An Approach to Regression Analysis by Local Fitting , 1988 .

[6]  Scott Shenker,et al.  On the characteristics and origins of internet flow rates , 2002, SIGCOMM.

[7]  Shigeki Goto,et al.  Identifying elephant flows through periodically sampled packets , 2004, IMC '04.

[8]  Shigeki Goto,et al.  On the characteristics of Internet traffic variability: spikes and elephants , 2004, 2004 International Symposium on Applications and the Internet. Proceedings..

[9]  S. Schaal,et al.  Robot juggling: implementation of memory-based learning , 1994, IEEE Control Systems.

[10]  Nick McKeown,et al.  OpenFlow: enabling innovation in campus networks , 2008, CCRV.

[11]  Brice Augustin,et al.  IXPs: mapped? , 2009, IMC '09.

[12]  Hong Liu,et al.  Predicting Inter-Data-Center Network Traffic Using Elephant Flow and Sublink Information , 2016, IEEE Transactions on Network and Service Management.

[13]  Roy Friedman,et al.  Constant Time Updates in Hierarchical Heavy Hitters , 2017, SIGCOMM.

[14]  Rade Stanojevic,et al.  IXP traffic: a macroscopic view , 2012, LANC.

[15]  Lisandro Zambenedetti Granville,et al.  IDEAFIX: Identifying Elephant Flows in P4-Based IXP Networks , 2018, 2018 IEEE Global Communications Conference (GLOBECOM).

[16]  Sujata Banerjee,et al.  DevoFlow: scaling flow management for high-performance networks , 2011, SIGCOMM 2011.

[17]  Larry Peterson,et al.  Inter-AS traffic patterns and their implications , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[18]  W. R. Schucany,et al.  Gaussian‐based kernels , 1990 .

[19]  Chiara Orsini,et al.  C Consiglio Nazionale delle Ricerche The Impact of IXPs on the AS-level Topology Structure of the Internet , 2010 .

[20]  George Varghese,et al.  P4: programming protocol-independent packet processors , 2013, CCRV.

[21]  Lisandro Zambenedetti Granville,et al.  SDEFIX - Identifying elephant flows in SDN-based IXP networks , 2016, NOMS.

[22]  Liang Guo,et al.  The war between mice and elephants , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[23]  J. Simonoff Smoothing Methods in Statistics , 1998 .