activity
20092026
most citedEfficient Distinct Heavy Hitters for DNS DDoS Attack Detection

7 citations · 14 across the 10 of their papers we have counts for

collaborators

10 papers

cs.NI2026

SpraySense: Sensing Gray Failures through Packet Spraying Discrepancies

Jakob Krebs, Daniel Amir, Shir Landau Feibish +1

Distributed machine learning (ML) training has become a dominant workload in modern data center networks, operating at massive scale with clusters comprising tens to hundreds of th…

cs.NI2026

NODE: Network Wide Top-K Flows in the Data Plane

Eitan Stein, Lior Zeno, Shir Landau Feibish

Monitoring network traffic is crucial for most network tasks, such as, identifying and blocking attacks, pinpointing failures and engineering and rerouting heavy traffic to maintai…

cs.NI2026

ReAct: Reflection Attack Mitigation For Asymmetric Routing

David Hay, Mary Hogan, Shir Landau Feibish

Amplification Reflection Distributed Denial-of-Service (AR-DDoS) attacks remain a formidable threat, exploiting stateless protocols to flood victims with illegitimate traffic. Rece…

cs.NI2025

SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate

Murayyiam Parvez, Annus Zulfiqar, Roman Beltiukov +4

Machine learning (ML) is increasingly being deployed in programmable data planes (switches and SmartNICs) to enable real-time traffic analysis, security monitoring, and in-network…

cs.NI2025

Measuring Round-Trip Response Latencies Under Asymmetric Routing

Bhavana Vannarth Shobhana, Yen-lin Chien, Jonathan Diamant +3

Latency is a key indicator of Internet service performance. Continuously tracking the latency of client requests enables service operators to quickly identify bottlenecks, perform…

cs.NI2020★ 4 cited

Routing Oblivious Measurement Analytics

Ran Ben Basat, Xiaoqi Chen, Gil Einziger +3

Network-wide traffic analytics are often needed for various network monitoring tasks. These measurements are often performed by collecting samples at network switches, which are th…

cs.NI2017

Detecting Heavy Flows in the SDN Match and Action Model

Yehuda Afek, Anat Bremler-Barr, Shir Landau Feibish +1

Efficient algorithms and techniques to detect and identify large flows in a high throughput traffic stream in the SDN match-and-action model are presented. This is in contrast to p…

cs.CR2016★ 7 cited

Efficient Distinct Heavy Hitters for DNS DDoS Attack Detection

Yehuda Afek, Anat Bremler-Barr, Edith Cohen +2

Motivated by a recent new type of randomized Distributed Denial of Service (DDoS) attacks on the Domain Name Service (DNS), we develop novel and efficient distinct heavy hitters al…

cs.DS2010

Unified Compression-Based Acceleration of Edit-Distance Computation

Danny Hermelin, Gad M. Landau, Shir Landau +1

The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s…

cs.CC2009★ 3 cited

A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression

Danny Hermelin, Gad M. Landau, Shir Landau +1

We present a unified framework for accelerating edit-distance computation between two compressible strings using straight-line programs. For two strings of total length having…