{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T18:44:47Z","timestamp":1769193887446,"version":"3.49.0"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Project \u201cPrecise and Reusable Models of Flow and Flowlet Properties in the Internet\u201d funded by the Polish National Science Centre","award":["2023\/49\/N\/ST7\/00532"],"award-info":[{"award-number":["2023\/49\/N\/ST7\/00532"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3485588","type":"journal-article","created":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T17:50:05Z","timestamp":1729705805000},"page":"158561-158578","source":"Crossref","is-referenced-by-count":4,"title":["Elephant Flow Detection With Random Forest Models Under Programmable Network Dataplane Constraints"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0774-610X","authenticated-orcid":false,"given":"Piotr","family":"Jurkiewicz","sequence":"first","affiliation":[{"name":"Institute of Telecommunications, AGH University of Krakow, Krakow, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3093-9089","authenticated-orcid":false,"given":"Bartosz","family":"Kadzio\u0142ka","sequence":"additional","affiliation":[{"name":"Institute of Telecommunications, AGH University of Krakow, Krakow, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miros\u0142aw","family":"Kantor","sequence":"additional","affiliation":[{"name":"Institute of Telecommunications, AGH University of Krakow, Krakow, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9562-606X","authenticated-orcid":false,"given":"Robert","family":"W\u00f3jcik","sequence":"additional","affiliation":[{"name":"Institute of Telecommunications, AGH University of Krakow, Krakow, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8379-2810","authenticated-orcid":false,"given":"Jerzy","family":"Dom\u017ca\u0142","sequence":"additional","affiliation":[{"name":"Institute of Telecommunications, AGH University of Krakow, Krakow, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.06.002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2371999"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2633579"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2019.10.029"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342390"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2024.103883"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICC51166.2024.10623094"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737629"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2020.12.016"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40552-5_4"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3436056"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3323297"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316225"},{"key":"ref14","first-page":"19","article-title":"Hedera: Dynamic flow scheduling for data center networks","volume-title":"Proc. NSDI","volume":"10","author":"Al-Fares"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018466"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.4108\/icst.iniscom.2015.258274"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.23919\/CNSM46954.2019.9012716"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2020.2976838"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-020-05440-2"},{"key":"ref20","article-title":"PForest: In-network inference with random forests","author":"Busse-Grawitz","year":"2019","journal-title":"arXiv:1909.05680"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.23919\/IFIPNetworking52078.2021.9472832"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.softx.2021.100929"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3398065"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.3390\/e26070537"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057001"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICTON.2017.8024959"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2016.7785324"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2020.102766"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2987977"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.23919\/APNOMS56106.2022.9919927"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISPA-BDCloud-SocialCom-SustainCom57177.2022.00088"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-15032-7_41"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM48099.2022.10001221"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/nem.2188"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.23919\/CNSM59352.2023.10327790"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-023-46471-8"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.2307\/2699986"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2020.3025131"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3272894"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2023.3318752"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.22266\/ijies2021.0831.33"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3203070"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/505202.505234"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.softx.2023.101506"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s12065-019-00203-y"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-6226-1"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3472716.3472846"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3624354.3630089"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3364757"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10380310\/10731663.pdf?arnumber=10731663","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T01:58:38Z","timestamp":1732672718000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10731663\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":51,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3485588","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}