Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3405837.3411388acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
poster

Revisiting heavy-hitters: don't count packets, compute flow inter-packet metrics in the data plane

Published: 14 September 2021 Publication History

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].

References

[1]
G. Vorsanger V. Sekar Z. Liu, A. Manousis and V. Braverman. One Sketch to Rule Them All: Rethinking Network Flow Monitoring with UnivMon. SIGCOMM, 2016.
[2]
O. Rottenstreich S. Muthukrishnan V. Sivaraman, S. Narayana and J. Rexford. Heavy-Hitter Detection Entirely in the Data Plane. SOSR, 2017.
[3]
H. Wang A. Moore J. Korenek J. Kucera, D. A. Popescu and G. Antichi. Enabling Event-Triggered Data Plane Monitoring. SOSR, 2020.
[4]
C. Kim J. Lee R. Miao, H. Zeng and M. Yu. SilkRoad: Making Stateful Layer-4 Load Balancing Fast and Cheap Using Switching ASICs. SIGCOMM, 2017.
[5]
A. W. Moore G. Bianchi S. Galea, G. Antichi and R. Bifulco. Revealing Hidden Hierarchical Heavy Hitters in network traffic. SIGCOMM Poster, 2018.
[6]
CAIDA. The CAIDA UCSD Anonymized Internet Traces, 2016.
[7]
D. Agrawal A. Metwally and A. ElAbbadi. Efficient computation of frequent and top-k elements in data streams. International Conference on Database Theory. Springer, 2005.
[8]
H. Zhang H. Li S. Uhlig. S. Chen L. Uden J. Gong, T. Yang and X. Li. HeavyKeeper: An Accurate Algorithm for Finding Top-k Elephant Flows. USENIX Annual Technical Conference, 2018.
[9]
S. Bhattacharyya P. Thiran K. Salamatian K. Papagiannaki, N. Taft, L. Uden, and C. Diot. A Pragmatic Definition of Elephants in Internet Backbone Traffic. SIGCOMM Workshop on Internet Measurement, 2002.

Cited By

View all
  • (2024)Spinner: Enabling In-network Flow Clustering Entirely in a Programmable Data PlaneNOMS 2024-2024 IEEE Network Operations and Management Symposium10.1109/NOMS59830.2024.10575413(1-9)Online publication date: 6-May-2024
  • (2023)Taking Detours: An In-Network Fault-Tolerant Probing Planning for In-Band Network TelemetryICC 2023 - IEEE International Conference on Communications10.1109/ICC45041.2023.10279199(1934-1939)Online publication date: 28-May-2023
  • (2022)Innovative network monitoring techniques through in-band inter packet gap telemetry (IPGNET)Proceedings of the 5th International Workshop on P4 in Europe10.1145/3565475.3569077(53-56)Online publication date: 9-Dec-2022
  • Show More Cited By

Index Terms

  1. Revisiting heavy-hitters: don't count packets, compute flow inter-packet metrics in the data plane

        Recommendations

        Comments

        Please enable JavaScript to view thecomments powered by Disqus.

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        SIGCOMM '20: Proceedings of the SIGCOMM '20 Poster and Demo Sessions
        August 2020
        96 pages
        ISBN:9781450380485
        DOI:10.1145/3405837
        Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 14 September 2021

        Check for updates

        Author Tags

        1. P4
        2. network algorithms
        3. network monitoring
        4. programmable networks

        Qualifiers

        • Poster

        Funding Sources

        • Innovation Center, Ericsson Telecomunicacoes S.A., Brazil

        Conference

        SIGCOMM '20
        Sponsor:

        Acceptance Rates

        Overall Acceptance Rate 92 of 158 submissions, 58%

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)27
        • Downloads (Last 6 weeks)5
        Reflects downloads up to 30 Nov 2024

        Other Metrics

        Citations

        Cited By

        View all
        • (2024)Spinner: Enabling In-network Flow Clustering Entirely in a Programmable Data PlaneNOMS 2024-2024 IEEE Network Operations and Management Symposium10.1109/NOMS59830.2024.10575413(1-9)Online publication date: 6-May-2024
        • (2023)Taking Detours: An In-Network Fault-Tolerant Probing Planning for In-Band Network TelemetryICC 2023 - IEEE International Conference on Communications10.1109/ICC45041.2023.10279199(1934-1939)Online publication date: 28-May-2023
        • (2022)Innovative network monitoring techniques through in-band inter packet gap telemetry (IPGNET)Proceedings of the 5th International Workshop on P4 in Europe10.1145/3565475.3569077(53-56)Online publication date: 9-Dec-2022
        • (2022)HH-IPG: Leveraging Inter-Packet Gap Metrics in P4 Hardware for Heavy Hitter DetectionIEEE Transactions on Network and Service Management10.1109/TNSM.2022.322706520:3(3536-3548)Online publication date: 6-Dec-2022
        • (2022)Hybrid P4 Programmable Pipelines for 5G gNodeB and User Plane FunctionsIEEE Transactions on Mobile Computing10.1109/TMC.2022.320151222:12(6921-6937)Online publication date: 25-Aug-2022
        • (2022)Towards Efficient Selective In-Band Network Telemetry Report Using SmartNICsAdvanced Information Networking and Applications10.1007/978-3-030-99584-3_24(271-284)Online publication date: 31-Mar-2022

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media