| Heavy-Hitter Detection Entirely in the Data Plane V Sivaraman, S Narayana, O Rottenstreich, S Muthukrishnan, J Rexford | 561 | 2017 |
| Optimizing bloom filter: Challenges, solutions, and comparisons L Luo, D Guo, RTB Ma, O Rottenstreich, X Luo IEEE Communications Surveys & Tutorials 21 (2), 1912-1949, 2018 | 281 | 2018 |
| The variable-increment counting Bloom filter O Rottenstreich, Y Kanizo, I Keslassy INFOCOM, 2012 Proceedings IEEE, 1880-1888, 2012 | 177 | 2012 |
| Fine-Grained Queue Measurement in the Data Plane X Chen, SL Feibish, Y Koral, J Rexford, O Rottenstreich, S Monetti, ... ACM CoNext, 2019 | 135 | 2019 |
| Optimizing virtual backup allocation for middleboxes Y Kanizo, O Rottenstreich, I Segall, J Yallouz IEEE/ACM Transactions on Networking 25 (5), 2759-2772, 2017 | 122 | 2017 |
| Efficient measurement on programmable switches using probabilistic recirculation R Ben-Basat, X Chen, G Einziger, O Rottenstreich 2018 IEEE 26th International Conference on Network Protocols (ICNP), 313-323, 2018 | 121 | 2018 |
| SAX-PAC (scalable and expressive packet classification) K Kogan, S Nikolenko, O Rottenstreich, W Culhane, P Eugster Proceedings of the 2014 ACM Conference on SIGCOMM, 15-26, 2014 | 110 | 2014 |
| A fair consensus protocol for transaction ordering A Asayag, G Cohen, I Grayevsky, M Leshkowitz, O Rottenstreich, ... 2018 IEEE 26th International Conference on Network Protocols (ICNP), 55-65, 2018 | 108* | 2018 |
| Designing heavy-hitter detection algorithms for programmable switches RB Basat, X Chen, G Einziger, O Rottenstreich IEEE/ACM Transactions on Networking 28 (3), 1172-1185, 2020 | 100 | 2020 |
| The Bloom paradox: When not to use a Bloom filter? O Rottenstreich, I Keslassy INFOCOM, 2012 Proceedings IEEE, 1638-1646, 2012 | 99 | 2012 |
| Elmo: Source routed multicast for public clouds M Shahbaz, L Suresh, J Rexford, N Feamster, O Rottenstreich, M Hira Proceedings of the ACM Special Interest Group on Data Communication, 458-471, 2019 | 93* | 2019 |
| TimeFlip: Scheduling network updates with timestamp-based TCAM ranges T Mizrahi, O Rottenstreich, Y Moses 2015 IEEE Conference on Computer Communications (INFOCOM), 2551-2559, 2015 | 90 | 2015 |
| A framework for provisioning availability of NFV in data center networks J Fan, M Jiang, O Rottenstreich, Y Zhao, T Guan, R Ramesh, S Das, ... IEEE Journal on Selected Areas in Communications 36 (10), 2246-2259, 2018 | 83 | 2018 |
| Bloom filter with a false positive free zone SZ Kiss, É Hosszu, J Tapolcai, L Rónyai, O Rottenstreich IEEE Transactions on Network and Service Management 18 (2), 2334-2349, 2021 | 81 | 2021 |
| Catching the microburst culprits with snappy X Chen, SL Feibish, Y Koral, J Rexford, O Rottenstreich Proceedings of the Afternoon Workshop on Self-Driving Networks, 22-28, 2018 | 77 | 2018 |
| A computational approach to packet classification A Rashelbach, O Rottenstreich, M Silberstein Proceedings of the Annual conference of the ACM Special Interest Group on …, 2020 | 76 | 2020 |
| Exact Worst-Case TCAM Rule Expansion O Rottenstreich, R Cohen, D Raz, I Keslassy IEEE Transactions on Computers 62 (6), 1127-1140, 2013 | 64 | 2013 |
| Tuple space assisted packet classification with high performance on both search and update W Li, T Yang, O Rottenstreich, X Li, G Xie, H Li, B Vamanan, D Li, H Lin IEEE Journal on Selected Areas in Communications 38 (7), 1555-1569, 2020 | 63 | 2020 |
| Optimal rule caching and lossy compression for longest prefix matching O Rottenstreich, J Tapolcai IEEE/ACM Transactions on Networking 25 (2), 864-878, 2016 | 55 | 2016 |
| Exploiting order independence for scalable and expressive packet classification K Kogan, S Nikolenko, O Rottenstreich, W Culhane, P Eugster IEEE/ACM Transactions on Networking 24 (2), 1251-1264, 2016 | 55 | 2016 |
Isaac KeslassyTechnionVerified email at technion.ac.il
