Abstract
Internet eXchange Points (IXPs) are high-performance networks that allow multiple autonomous systems to exchange traffic. As in any network, IXP operators face management challenges to promote better usage of the services provided by the network. Among these, a critical problem lies in the identification of elephant flows, which are characterized by having traffic size and duration significantly higher than other flows. We explore the periodic pattern of IXP network traffic to predict the new flows’ size and duration by observing the previous flows’ temporal behavior. One of the critical parameters of success for periodicity-based predictions is the sample selection, with the quality and size of samples directly influencing results. In this paper, we present a sample selection strategy, based on the Cuckoo Search Algorithm, to match it with our mechanism. Our approach uses a Sample Selection Module based on views updated from an objective function adapted to the IXP network traffic. Thus, we optimize in \(\approx \) 32% the predictions processing time and increased the mechanism accuracy by \(\approx \) 20%, using conservative tolerance for the prediction interval, compared to previous approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ager, B., Chatzis, N., Feldmann, A., Sarrar, N., Uhlig, S., Willinger, W.: Anatomy of a large European IXP. In: ACM SIGCOMM Computer Communication Review, vol. 42, pp. 163–174. ACM (2012)
AMS-IX: Amsterdam Internet Exchange Infrastructure (2019). https://ams-ix.net/technical/ams-ix-infrastructure
Augustin, B., Krishnamurthy, B., Willinger, W.: IXPs: mapped? In: ACM SIGCOMM Conference on Internet Measurement, IMC 2009, pp. 336–349. ACM, New York (2009)
Bosshart, P., Daly, D., Gibb, G., Izzard, M., McKeown, N., Rexford, J., Schlesinger, C., Talayco, D., Vahdat, A., Varghese, G., et al.: P4: programming protocol-independent packet processors. In: ACM SIGCOMM Computer Communication Review, pp. 87–95. ACM (2014)
Cardona Restrepo, J.C., Stanojevic, R.: IXP traffic: a macroscopic view. In: The 7th Latin American Networking Conference, pp. 1–8. ACM (2012)
Cleveland, W.S., Devlin, S.J.: Locally weighted regression: an approach to regression analysis by local fitting. J. Am. Stat. Assoc. 83, 596–610 (1988)
Curtis, A.R., Mogul, J.C., Tourrilhes, J., Yalagandula, P., Sharma, P., Banerjee, S.: DevoFlow: scaling flow management for high-performance networks. In: ACM SIGCOMM Computer Communication Review, vol. 41, pp. 254–265. ACM, New York (2011)
Dainotti, A., De Donato, W., Pescape, A., Rossi, P.S.: Classification of network traffic via packet-level hidden Markov models. In: Global Telecommunications Conference, IEEE GLOBECOM 2008, pp. 1–5. IEEE (2008)
Dalmazo, B.L., Vilela, J.P., Curado, M.: Performance analysis of network traffic predictors in the cloud. J. Netw. Syst. Manage. 25(2), 290–320 (2017)
Erman, J., Mahanti, A., Arlitt, M.: QRP05-4: internet traffic identification using machine learning. In: Global Telecommunications Conference, GLOBECOM 2006, pp. 1–6. IEEE (2006)
Gregori, E., Improta, A., Lenzini, L., Orsini, C.: The impact of IXPs on the AS-level topology structure of the Internet. Comput. Commun. 34, 68–82 (2011)
Guo, L., Matta, I.: The war between mice and elephants. In: Ninth International Conference on Network Protocols, pp. 180–188. IEEE (2001)
IX Australia: Australia Internet Exchange Point (2018). https://www.ix.asn.au/
Karagiannis, T., Molle, M., Faloutsos, M., Broido, A.: A nonstationary Poisson view of Internet traffic. In: IEEE Conference on Computer Communications (INFOCOM), vol. 3, pp. 1558–1569. IEEE (2004)
Knob, L.A.D., Esteves, R.P., Granville, L.Z., Tarouco, L.M.R.: SDEFIX—Identifying elephant flows in SDN-based IXP networks. In: IEEE/IFIP Network Operations and Management Symposium (NOMS), pp. 19–26. IEEE (2016)
Li, Y., Liu, H., Yang, W., Hu, D., Wang, X., Xu, W.: Predicting inter-data-center network traffic using elephant flow and sublink information. IEEE Trans. Netw. Serv. Manage. 13, 782–792 (2016)
McKeown, N., Anderson, T., Balakrishnan, H., Parulkar, G., Peterson, L., Rexford, J., Shenker, S., Turner, J.: OpenFlow: enabling innovation in campus networks. In: ACM SIGCOMM Computer Communication Review, pp. 69–74. ACM, New York (2008)
Mori, T., Kawahara, R., Naito, S., Goto, S.: On the characteristics of Internet traffic variability: spikes and elephants. IEICE Trans. Inf. Syst. 87, 2644–2653 (2004)
Mori, T., Uchida, M., Kawahara, R., Pan, J., Goto, S.: Identifying elephant flows through periodically sampled packets. In: ACM SIGCOMM Conference on Internet Measurement, IMC 2004, pp. 115–120. ACM (2004)
Schaal, S., Atkeson, C.G.: Robot juggling: implementation of memory-based learning. IEEE Control Syst. 14(1), 57–71 (1994)
sFlow: sFlow.org (2018). http://www.sflow.org
da Silva, M.V.B., Jacobs, A.S., Pfitscher, R.J., Granville, L.Z.: IDEAFIX: identifying elephant flows in P4-based IXP networks. In: IEEE Global Communications Conference (GLOBECOM), pp. 1–6. IEEE (2018)
da Silva, M.V.B., Jacobs, A.S., Pfitscher, R.J., Granville, L.Z.: Predicting elephant flows in internet exchange point programmable networks. In: International Conference on Advanced Information Networking and Applications, pp. 485–497. Springer (2019)
Suh, J., Kwon, T.T., Dixon, C., Felter, W., Carter, J.: OpenSample: a low-latency, sampling-based measurement platform for commodity SDN. In: 34th IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 228–237. IEEE (2014)
Yang, X.S., Deb, S.: Cuckoo search via Lévy flights. In: 2009 World Congress on Nature and Biologically Inspired Computing (NaBIC), pp. 210–214. IEEE (2009)
Zhang, Y., Breslau, L., Paxson, V., Shenker, S.: On the characteristics and origins of internet flow rates. In: ACM SIGCOMM Computer Communication Review, vol. 32, pp. 309–322. ACM, New York, August 2002
Acknowledgement
We thank CNPq for the financial support. This research has been supported by call Universal 01/2016 (CNPq), project NFV-MENTOR process 423275/2016-0.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
da Silva, M.V.B., de Carvalho, A.A.P., Jacobs, A.S., Pfitscher, R.J., Granville, L.Z. (2020). Sample Selection Search to Predict Elephant Flows in IXP Programmable Networks. In: Barolli, L., Amato, F., Moscato, F., Enokido, T., Takizawa, M. (eds) Advanced Information Networking and Applications. AINA 2020. Advances in Intelligent Systems and Computing, vol 1151. Springer, Cham. https://doi.org/10.1007/978-3-030-44041-1_33
Download citation
DOI: https://doi.org/10.1007/978-3-030-44041-1_33
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-44040-4
Online ISBN: 978-3-030-44041-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)