S. Singh, Christian Esteve Rothenberg, M. C. Luizelli, G. Antichi, Gergely Pongrácz
{"title":"Revisiting heavy-hitters: don't count packets, compute flow inter-packet metrics in the data plane","authors":"S. Singh, Christian Esteve Rothenberg, M. C. Luizelli, G. Antichi, Gergely Pongrácz","doi":"10.1145/3405837.3411388","DOIUrl":null,"url":null,"abstract":"Detecting Heavy Hitter (HH) flows, i.e., flows exceeding a pre-determined threshold in a time window, is a fundamental task as it enables network management and security applications like DoS attack detection/prevention, flow-size aware routing, and QoS. The recent breakthroughs of programmable data planes has provided an unique opportunity: detect them directly in the data plane to enable fast control decisions. State-of-the-art solutions leverage either probabilistic data structures [1, 2] or prefix trees [3] to store flow counters directly in the programmable pipeline of switches. However, the former approach still depends on the intervention of a central controller to identify the HH flows from the hash-buckets, thus partially diminishing the fast data plane reaction. The latter approach instead, while successfully implemented on FPGA, is not yet a feasible solution for today's programmable ASICs due to limited accesses to registers [4].","PeriodicalId":396272,"journal":{"name":"Proceedings of the SIGCOMM '20 Poster and Demo Sessions","volume":"19 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the SIGCOMM '20 Poster and Demo Sessions","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3405837.3411388","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
Detecting Heavy Hitter (HH) flows, i.e., flows exceeding a pre-determined threshold in a time window, is a fundamental task as it enables network management and security applications like DoS attack detection/prevention, flow-size aware routing, and QoS. The recent breakthroughs of programmable data planes has provided an unique opportunity: detect them directly in the data plane to enable fast control decisions. State-of-the-art solutions leverage either probabilistic data structures [1, 2] or prefix trees [3] to store flow counters directly in the programmable pipeline of switches. However, the former approach still depends on the intervention of a central controller to identify the HH flows from the hash-buckets, thus partially diminishing the fast data plane reaction. The latter approach instead, while successfully implemented on FPGA, is not yet a feasible solution for today's programmable ASICs due to limited accesses to registers [4].