Követés
Ori Rottenstreich
Ori Rottenstreich
Technion
E-mail megerősítve itt: cs.technion.ac.il - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
Heavy-Hitter Detection Entirely in the Data Plane
V Sivaraman, S Narayana, O Rottenstreich, S Muthukrishnan, J Rexford
5022017
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
2422018
The variable-increment counting Bloom filter
O Rottenstreich, Y Kanizo, I Keslassy
INFOCOM, 2012 Proceedings IEEE, 1880-1888, 2012
1652012
Fine-Grained Queue Measurement in the Data Plane
X Chen, SL Feibish, Y Koral, J Rexford, O Rottenstreich, S Monetti, ...
ACM CoNext, 2019
1192019
Optimizing virtual backup allocation for middleboxes
Y Kanizo, O Rottenstreich, I Segall, J Yallouz
IEEE/ACM Transactions on Networking 25 (5), 2759-2772, 2017
1172017
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
1122018
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
1052014
The Bloom paradox: When not to use a Bloom filter?
O Rottenstreich, I Keslassy
INFOCOM, 2012 Proceedings IEEE, 1638-1646, 2012
942012
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
91*2018
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
892015
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
862020
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
83*2019
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
812018
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
732018
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
702021
Exact Worst-Case TCAM Rule Expansion
O Rottenstreich, R Cohen, D Raz, I Keslassy
IEEE Transactions on Computers 62 (6), 1127-1140, 2013
632013
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
612020
Optimal rule caching and lossy compression for longest prefix matching
O Rottenstreich, J Tapolcai
IEEE/ACM Transactions on Networking 25 (2), 864-878, 2016
522016
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
512020
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
502016
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20