Ori Rottenstreich
Ori Rottenstreich
Verified email at cs.technion.ac.il - Homepage
Title
Cited by
Cited by
Year
Heavy-Hitter Detection Entirely in the Data Plane
S Narayana, O Rottenstreich, S Muthukrishnan, J Rexford
218*2017
The variable-increment counting Bloom filter
O Rottenstreich, Y Kanizo, I Keslassy
INFOCOM, 2012 Proceedings IEEE, 1880-1888, 2012
1262012
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
832015
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
772014
The Bloom paradox: When not to use a Bloom filter?
O Rottenstreich, I Keslassy
INFOCOM, 2012 Proceedings IEEE, 1638-1646, 2012
742012
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
652018
Optimizing virtual backup allocation for middleboxes
Y Kanizo, O Rottenstreich, I Segall, J Yallouz
IEEE/ACM Transactions on Networking 25 (5), 2759-2772, 2017
602017
Exact Worst-Case TCAM Rule Expansion
O Rottenstreich, R Cohen, D Raz, I Keslassy
IEEE Transactions on Computers 62 (6), 1127-1140, 2013
462013
On Finding an Optimal TCAM Encoding Scheme for Packet Classification
O Rottenstreich, I Keslassy, A Hassidim, H Kaplan, E Porat
INFOCOM, 2013 Proceedings IEEE, 2013
392013
Worst-case TCAM rule expansion
O Rottenstreich, I Keslassy
2010 Proceedings IEEE INFOCOM, 1-5, 2010
382010
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
352016
Optimal In/Out TCAM encodings of ranges
O Rottenstreich, I Keslassy, A Hassidim, H Kaplan, E Porat
IEEE/ACM Transactions on Networking 24 (1), 555-568, 2016
352016
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
322018
Reducing power consumption in a fat-tree network
D Goldenberg, E Zahavi, O Rottenstreich
US Patent 8,570,865, 2013
302013
Optimal rule caching and lossy compression for longest prefix matching
O Rottenstreich, J Tapolcai
IEEE/ACM Transactions on Networking 25 (2), 864-878, 2016
282016
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
272018
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
262018
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
25*2018
Bloom filter with a false positive free zone
SZ Kiss, É Hosszu, J Tapolcai, L Rónyai, O Rottenstreich
IEEE INFOCOM 2018-IEEE Conference on Computer Communications, 1412-1420, 2018
252018
Lossy Compression of Packet Classifiers
O Rottenstreich, J Tapolcai
ACM/IEEE Symposium on Architectures for networking and communications …, 2015
252015
The system can't perform the operation now. Try again later.
Articles 1–20