{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:16:45Z","timestamp":1758845805770},"reference-count":25,"publisher":"Sociedade Brasileira de Computacao - SB","issue":"1","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"vor","delay-in-days":9,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Internet Serv Appl"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Internet eXchange Points (IXPs) are Internet infrastructures composed of high-performance networks that allow multiple autonomous systems to exchange traffic. Given the challenges of managing the flows that cross an IXP, identifying elephant flows may help improve the quality of services provided to its participants. In this context, we leverage the new flexibility and resources of programmable data planes to identify elephant flows in IXP networks adaptively via the dynamic adjustment of thresholds. Our mechanism uses the information reported by the data plane to monitor network utilization in the control plane, calculating new thresholds based on previous flow sizes and durations percentiles and configuring them back into switches to support the local classification of flows. Thus, the thresholds are updated to make the identification process better aligned with the network behavior. The experimental results show that it is possible to identify and react to elephant flows quickly, less than 0.4ms, and efficiently, with only 98.4KB of data inserted into the network by the mechanism. In addition, the threshold updating mechanism achieved accuracy of up to 90% in our evaluation scenarios.<\/jats:p>","DOI":"10.1186\/s13174-020-00131-6","type":"journal-article","created":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:29:22Z","timestamp":1607560162000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Identifying elephant flows using dynamic thresholds in programmable IXP networks"],"prefix":"10.5753","volume":"11","author":[{"given":"Marcus Vinicius Brito da","family":"Silva","sequence":"first","affiliation":[]},{"given":"Jonatas Adilson","family":"Marques","sequence":"additional","affiliation":[]},{"given":"Luciano Paschoal","family":"Gaspary","sequence":"additional","affiliation":[]},{"given":"Lisandro Zambenedetti","family":"Granville","sequence":"additional","affiliation":[]}],"member":"3742","published-online":{"date-parts":[[2020,12,10]]},"reference":[{"key":"131_CR1","doi-asserted-by":"publisher","unstructured":"Afaq M, Rehman S, Song WC. Visualization of Elephant Flows and QoS Provisioning in SDN-based Networks. In: 17th Asia-Pacific Network Operations and Management Symposium (APNOMS). IEEE: 2015. p. 444\u20137. https:\/\/doi.org\/10.1109\/apnoms.2015.7275384.","DOI":"10.1109\/apnoms.2015.7275384"},{"key":"131_CR2","doi-asserted-by":"publisher","unstructured":"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. ACM: 2012. p. 163\u201374. https:\/\/doi.org\/10.1145\/2342356.2342393.","DOI":"10.1145\/2342356.2342393"},{"issue":"4","key":"131_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/2377677.2377714","volume":"42","author":"B Ager","year":"2012","unstructured":"Ager B, Chatzis N, Feldmann A, Sarrar N, Uhlig S, Willinger W. Anatomy of a large European IXP. ACM SIGCOMM Conf Internet Meas. 2012; 42(4):163\u201374.","journal-title":"ACM SIGCOMM Conf Internet Meas"},{"key":"131_CR4","volume-title":"ACM SIGCOMM Conference on Internet Measurement, IMC \u201909","author":"B Augustin","year":"2009","unstructured":"Augustin B, Krishnamurthy B, Willinger W. IXPs: Mapped? In: ACM SIGCOMM Conference on Internet Measurement, IMC \u201909. USA: ACM, NY: 2009. p. 336\u201349."},{"key":"131_CR5","volume-title":"ACM SIGCOMM Conf Internet Meas","author":"R Basat","year":"2017","unstructured":"Basat R, Einziger G, Friedman R, Luizelli M, Waisbard E. Constant Time Updates in Hierarchical Heavy Hitter. In: ACM SIGCOMM Conf Internet Meas. USA: ACM, NY: 2017. p. 127\u201340."},{"key":"131_CR6","doi-asserted-by":"publisher","unstructured":"Basat RB, Einziger G, Friedman R, Kassner Y. Optimal elephant flow detection. In: IEEE Conference on Computer Communications (INFOCOM). IEEE: 2017. p. 1\u20139. https:\/\/doi.org\/10.1109\/infocom.2017.8057216.","DOI":"10.1109\/infocom.2017.8057216"},{"key":"131_CR7","volume-title":"ACM SIGCOMM Conference on Internet Measurement","author":"P Bosshart","year":"2014","unstructured":"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 Conference on Internet Measurement. New York: ACM: 2014. p. 87\u201395."},{"key":"131_CR8","doi-asserted-by":"crossref","unstructured":"Cardona Restrepo JC, Stanojevic R. IXP Traffic: a Macroscopic View. New York: ACM: 2012. p. 1\u20138.","DOI":"10.1145\/2382016.2382018"},{"key":"131_CR9","doi-asserted-by":"publisher","unstructured":"Curtis AR, Kim W, Yalagandula P. Mahout: Low-overhead Datacenter Traffic Management Using End-host-based Elephant Detection. In: IEEE INFOCOM Conference on Computer Communications. IEEE: 2011. p. 1629\u201337. https:\/\/doi.org\/10.1109\/infcom.2011.5934956.","DOI":"10.1109\/infcom.2011.5934956"},{"key":"131_CR10","volume-title":"ACM SIGCOMM Conference on Internet Measurement, vol. 41","author":"AR Curtis","year":"2011","unstructured":"Curtis AR, Mogul JC, Tourrilhes J, Yalagandula P, Sharma P, Banerjee S. DevoFlow: Scaling Flow Management for High-performance Networks. In: ACM SIGCOMM Conference on Internet Measurement, vol. 41. USA: ACM, NY: 2011. p. 254\u201365."},{"key":"131_CR11","doi-asserted-by":"publisher","unstructured":"da Silva MVB, Jacobs AS, Pfitscher RJ, Granville LZ. IDEAFIX: Identifying Elephant Flows in P4-Based IXP Networks. In: Proceedings of the IEEE GLOBECOM Global Telecommunications Conference. IEEE: 2018. https:\/\/doi.org\/10.1109\/glocom.2018.8647685.","DOI":"10.1109\/glocom.2018.8647685"},{"key":"131_CR12","doi-asserted-by":"publisher","unstructured":"Gregori E, Improta A, Lenzini L, Orsini C. The Impact of IXPs on the AS-level Topo-logy Structure of the Internet. In: Computer Communications. Elsevier: 2011. p. 68\u201382. https:\/\/doi.org\/10.1016\/j.comcom.2010.09.002.","DOI":"10.1016\/j.comcom.2010.09.002"},{"key":"131_CR13","doi-asserted-by":"publisher","unstructured":"Guo L, Matta I. The War Between Mice and Elephants. In: Network Protocols, 2001. Ninth International Conference on. IEEE: 2001. p. 180\u20138. https:\/\/doi.org\/10.1109\/icnp.2001.992898.","DOI":"10.1109\/icnp.2001.992898"},{"key":"131_CR14","volume-title":"ACM SIGCOMM Conference on Internet Measurement, vol. 44","author":"A Gupta","year":"2015","unstructured":"Gupta A, Vanbever L, Shahbaz M, Donovan SP, Schlinker B, Feamster N, Rexford J, Shenker S, Clark R, Katz-Bassett E. Sdx: A Software Defined Internet Exchange. In: ACM SIGCOMM Conference on Internet Measurement, vol. 44. New York: ACM: 2015. p. 551\u201362."},{"key":"131_CR15","volume-title":"Proceedings of the 12th International on Conference on emerging Networking EXperiments and Technologies","author":"D Hancock","year":"2016","unstructured":"Hancock D, Van der Merwe J. Hyper4: Using p4 to virtualize the programmable data plane. In: Proceedings of the 12th International on Conference on emerging Networking EXperiments and Technologies. Irvine: ACM: 2016. p. 35\u201349."},{"key":"131_CR16","volume-title":"Proceedings of the Symposium on SDN Research, SOSR \u201918","author":"R Harrison","year":"2018","unstructured":"Harrison R, Cai Q, Gupta A, Rexford J. Network-Wide Heavy Hitter Detection with Commodity Switches. In: Proceedings of the Symposium on SDN Research, SOSR \u201918. New York: ACM: 2018. p. 8:1\u20138:7."},{"key":"131_CR17","doi-asserted-by":"publisher","unstructured":"Knob LAD, Esteves RP, Granville LZ, Tarouco LMR. SDEFIX\u2014Identifying Elephant Flows in SDN-based IXP Networks. In: IEEE\/IFIP NOMS Network Operations and Management Symposium. IEEE: 2016. p. 19\u201326. https:\/\/doi.org\/10.1109\/noms.2016.7502792.","DOI":"10.1109\/noms.2016.7502792"},{"key":"131_CR18","doi-asserted-by":"publisher","unstructured":"Knob LAD, Esteves RP, Granville LZ, Tarouco LMR. Mitigating Elephant Flows in SDN-based IXP Networks. In: IEEE ISCC Symposium on Computers and Communication. IEEE: 2017. p. 1352\u20139. https:\/\/doi.org\/10.1109\/iscc.2017.8024712.","DOI":"10.1109\/iscc.2017.8024712"},{"key":"131_CR19","volume-title":"ACM SIGCOMM Conference on Internet Measurement","author":"N McKeown","year":"2008","unstructured":"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 Conference on Internet Measurement. USA: ACM, NY: 2008. p. 69\u201374."},{"key":"131_CR20","unstructured":"sFlow. sFlow.org. http:\/\/www.sflow.org. Accessed 15 Feb 2019."},{"key":"131_CR21","doi-asserted-by":"crossref","unstructured":"Silva MVB, Marques JA, Gaspary LP, Granville LZ. Identificac\u00e3o de Fluxos Elefantes em Redes de Ponto de Troca de Tr\u00e1fego com Suporte \u00e0 Programabilidade P4 [in Portuguese]\u0327. In: 36th SBRC Simp\u00f3sio Brasileiro de Redes de Computadores e Sistemas Distribu\u00eddos: 2018.","DOI":"10.5753\/sbrc.2018.2483"},{"key":"131_CR22","doi-asserted-by":"publisher","unstructured":"Sivaraman V, Narayana S, Rottenstreich O, Muthukrishnan S, Rexford J. Heavy-hitter detection entirely in the data plane. In: Symposium on SDN Research. ACM: 2017. p. 164\u201376. https:\/\/doi.org\/10.1145\/3050220.3063772.","DOI":"10.1145\/3050220.3063772"},{"key":"131_CR23","doi-asserted-by":"publisher","unstructured":"Suh J, Kwon TT, Dixon C, Felter W, Carter J. Opensample: A Low-latency, Sampling-based Measurement Platform for Commodity SDN. In: 34th IEEE ICDCS International Conference on Distributed Computing Systems. IEEE: 2014. p. 228\u201337. https:\/\/doi.org\/10.1109\/icdcs.2014.31.","DOI":"10.1109\/icdcs.2014.31"},{"key":"131_CR24","doi-asserted-by":"publisher","unstructured":"Tong D, Prasanna V. High Throughput Hierarchical Heavy Hitter Detection in Data Streams. In: 22nd IEEE HiPC International Conference on High Performance Computing. IEEE: 2015. p. 224\u201333. https:\/\/doi.org\/10.1109\/hipc.2015.30.","DOI":"10.1109\/hipc.2015.30"},{"key":"131_CR25","doi-asserted-by":"publisher","unstructured":"Turkovic B, Kuipers F, van Adrichem N, Langendoen K. Fast network congestion detection and avoidance using P4. In: Proceedings of the 2018 Workshop on Networking for Emerging Applications and Technologies. ACM: 2018. p. 45\u201351. https:\/\/doi.org\/10.1145\/3229574.3229581.","DOI":"10.1145\/3229574.3229581"}],"container-title":["Journal of Internet Services and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13174-020-00131-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13174-020-00131-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13174-020-00131-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,3]],"date-time":"2022-12-03T19:50:13Z","timestamp":1670097013000},"score":1,"resource":{"primary":{"URL":"https:\/\/jisajournal.springeropen.com\/articles\/10.1186\/s13174-020-00131-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["131"],"URL":"https:\/\/doi.org\/10.1186\/s13174-020-00131-6","relation":{},"ISSN":["1867-4828","1869-0238"],"issn-type":[{"value":"1867-4828","type":"print"},{"value":"1869-0238","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12]]},"assertion":[{"value":"22 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"10"}}