Ori Rottenstreich
Ori Rottenstreich
Verified email at cs.technion.ac.il - Homepage
TitleCited byYear
The variable-increment counting Bloom filter
O Rottenstreich, Y Kanizo, I Keslassy
INFOCOM, 2012 Proceedings IEEE, 1880-1888, 2012
932012
Heavy-Hitter Detection Entirely in the Data Plane
S Narayana, O Rottenstreich, S Muthukrishnan, J Rexford
89*2017
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
692015
SAX-PAC (scalable and expressive packet classification)
K Kogan, S Nikolenko, O Rottenstreich, W Culhane, P Eugster
ACM SIGCOMM Computer Communication Review 44 (4), 15-26, 2014
562014
The Bloom paradox: When not to use a Bloom filter?
O Rottenstreich, I Keslassy
INFOCOM, 2012 Proceedings IEEE, 1638-1646, 2012
532012
Exact Worst-Case TCAM Rule Expansion
O Rottenstreich, R Cohen, D Raz, I Keslassy
IEEE Transactions on Computers 62 (6), 1127-1140, 2013
392013
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
352013
Worst-case TCAM rule expansion
O Rottenstreich, I Keslassy
2010 Proceedings IEEE INFOCOM, 1-5, 2010
342010
Reducing power consumption in a fat-tree network
D Goldenberg, E Zahavi, O Rottenstreich
US Patent 8,570,865, 2013
292013
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
262016
Optimizing virtual backup allocation for middleboxes
Y Kanizo, O Rottenstreich, I Segall, J Yallouz
IEEE/ACM Transactions on Networking 25 (5), 2759-2772, 2017
232017
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
232016
Compressing forwarding tables for datacenter scalability
O Rottenstreich, M Radan, Y Cassuto, I Keslassy, C Arad, T Mizrahi, ...
IEEE Journal on Selected Areas in Communications 32 (1), 138-151, 2013
202013
Concise encoding of flow attributes in SDN switches
R MacDavid, R Birkner, O Rottenstreich, A Gupta, N Feamster, J Rexford
Proceedings of the Symposium on SDN Research, 48-60, 2017
172017
Optimal rule caching and lossy compression for longest prefix matching
O Rottenstreich, J Tapolcai
IEEE/ACM Transactions on Networking (TON) 25 (2), 864-878, 2017
172017
TimeFlip: Using timestamp-based TCAM ranges to accurately schedule network updates
T Mizrahi, O Rottenstreich, Y Moses
IEEE/ACM Transactions on Networking (ToN) 25 (2), 849-863, 2017
162017
On the code length of TCAM coding schemes
O Rottenstreich, I Keslassy
2010 IEEE International Symposium on Information Theory, 1908-1912, 2010
152010
Statistical Approach to Networks-on-Chip
I Cohen, O Rottenstreich, I Keslassy
IEEE Transactions on Computers 59 (6), 748-761, 2010
15*2010
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
142018
Lossy Compression of Packet Classifiers
O Rottenstreich, J Tapolcai
ACM/IEEE Symposium on Architectures for networking and communicationsá…, 2015
142015
The system can't perform the operation now. Try again later.
Articles 1–20