An Incrementally-Deployable P4-Enabled Architecture for Network-Wide Heavy-Hitter Detection

被引:41
作者
Ding, Damu [1 ,2 ]
Savi, Marco [1 ]
Antichi, Gianni [3 ]
Siracusa, Domenico [1 ]
机构
[1] Fdn Bruno Kessler, Ctr Informat & Commun Technol, I-38123 Trento, Italy
[2] Univ Bologna, Dept Elect Elect & Informat Engn, I-40126 Bologna, Italy
[3] Queen Mary Univ London, Sch Elect Engn & Comp Sci, London E1 4NS, England
来源
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT | 2020年 / 17卷 / 01期
基金
英国工程与自然科学研究理事会; 欧盟地平线“2020”;
关键词
Network monitoring; programmable data plane; incremental deployment; heavy-hitter detection; SKETCH;
D O I
10.1109/TNSM.2020.2968979
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The advent of Software-Defined Networking with OpenFlow first, and subsequently the emergence of programmable data planes, has boosted lots of research around many networking aspects: monitoring, security, traffic engineering. In the context of monitoring, most of the proposed solutions show the benefits of data plane programmability by simplifying the network complexity with a one big-switch abstraction. Only few papers look at network-wide solutions, but consider the network only composed by programmable devices. In this paper, we argue that the primary challenge for a successful adoption of those solutions is the deployment problem: how to compose and monitor a network consisting of both legacy and programmable switches? We propose an approach for incrementally deploy programmable devices in an ISP network with the goal of monitoring as many distinct network flows as possible. While assessing the benefits of our solution, we realized that proposed network-wide monitoring algorithms might not be optimized for a partial deployment scenario. We then also developed and implemented in P4 a novel strategy capable of detecting network-wide heavy flows: results show that it can achieve better accuracy than state-of-the-art solutions while relying on less information from the data plane and leading to only marginal additional packet processing time.
引用
收藏
页码:75 / 88
页数:14
相关论文
共 42 条
  • [1] [Anonymous], P NETW DISTR SYST SE
  • [2] [Anonymous], 2014, UCBEECS2014172
  • [3] [Anonymous], [No title captured]
  • [4] [Anonymous], XXHASH EXTREMELY FAS
  • [5] Network-Wide Routing-Oblivious Heavy Hitters
    Ben Basat, Ran
    Einziger, Gil
    Feibish, Shir Landau
    Moraney, Jalil
    Raz, Danny
    [J]. PROCEEDINGS OF THE 2018 SYMPOSIUM ON ARCHITECTURES FOR NETWORKING AND COMMUNICATIONS SYSTEMS (ANCS '18), 2018, : 66 - 73
  • [6] Programming Protocol-Independent Packet Processors
    Bosshart, Pat
    Daly, Dan
    Gibb, Glen
    Izzard, Martin
    McKeown, Nick
    Rexford, Jennifer
    Schlesinger, Cole
    Talayco, Dan
    Vahdat, Amin
    Varghese, George
    Walker, David
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2014, 44 (03) : 87 - 95
  • [7] OPTIMIZATION OF CYCLIC REDUNDANCY-CHECK CODES WITH 24 AND 32 PARITY BITS
    CASTAGNOLI, G
    BRAUER, S
    HERRMANN, M
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1993, 41 (06) : 883 - 892
  • [8] An improved data stream summary: the count-min sketch and its applications
    Cormode, G
    Muthukrishnan, S
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2005, 55 (01): : 58 - 75
  • [9] Cormode Graham, 2005, P ACM VLDB, P13
  • [10] Ding DM, 2019, PROCEEDINGS OF THE 2019 IEEE CONFERENCE ON NETWORK SOFTWARIZATION (NETSOFT 2019), P160, DOI [10.1109/netsoft.2019.8806649, 10.1109/NETSOFT.2019.8806649]