O
Ori Rottenstreich
Researcher at Technion – Israel Institute of Technology
Publications - 142
Citations - 2607
Ori Rottenstreich is an academic researcher from Technion – Israel Institute of Technology. The author has contributed to research in topics: Computer science & Bloom filter. The author has an hindex of 24, co-authored 121 publications receiving 1880 citations. Previous affiliations of Ori Rottenstreich include Mellanox Technologies & Princeton University.
Papers
More filters
Proceedings ArticleDOI
Heavy-Hitter Detection Entirely in the Data Plane
Vibhaalakshmi Sivaraman,Srinivas Narayana,Ori Rottenstreich,S. Muthukrishnan,Jennifer Rexford +4 more
TL;DR: This work proposes HashPipe, a heavy hitter detection algorithm using emerging programmable data planes which implements a pipeline of hash tables which retain counters for heavy flows while evicting lighter flows over time.
Journal ArticleDOI
Optimizing Bloom Filter: Challenges, Solutions, and Comparisons
TL;DR: In this article, a survey of the existing literature on BF optimization, covering more than 60 variants, is presented, and a comprehensive analysis and qualitative comparison are conducted from the perspectives of BF components.
Journal ArticleDOI
The variable-increment counting bloom filter
TL;DR: A new general method based on variable increments to improve the efficiency of CBFs and their variants and can extend many variants of CBF that have been published in the literature.
Journal ArticleDOI
Optimizing Virtual Backup Allocation for Middleboxes
TL;DR: This work suggests a novel approach for planning and deploying backup schemes for network functions that guarantee high levels of survivability with significant reduction in resource consumption and describes different goals that network designers can take into account when determining which functions to implement in each of the backup servers.
Proceedings ArticleDOI
TimeFlip: Scheduling network updates with timestamp-based TCAM ranges
TL;DR: A practical method for implementing accurate time-based updates, using TIMEFLIPs, and shows that if there is enough flexibility in determining the scheduled time, a TimeFlip can be encoded by a single TCAM entry, using a single bit to represent the timestamp, and allowing the update to be performed with an accuracy on the order of 1 microsecond.