default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOri Rottenstreich
Person information
- affiliation: Technion, Israel Institute of Technology, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j63]Mohammad Nassar, Ori Rottenstreich
, Ariel Orda:
CFTO: Communication-Aware Fairness in Blockchain Transaction Ordering. IEEE Trans. Netw. Serv. Manag. 21(1): 490-506 (2024)- [j62]Arad Kotzer, Daniel Gandelman, Ori Rottenstreich:
SoK: Applications of Sketches and Rollups in Blockchain Networks. IEEE Trans. Netw. Serv. Manag. 21(3): 3194-3208 (2024) - [j61]Tomer Voronov, Danny Raz, Ori Rottenstreich:
A Framework for Anomaly Detection in Blockchain Networks With Sketches. IEEE/ACM Trans. Netw. 32(1): 686-698 (2024) - [j60]Ori Rottenstreich, Jose Yallouz:
Edge-Disjoint Tree Allocation for Multi-Tenant Cloud Security in Datacenter Topologies. IEEE/ACM Trans. Netw. 32(4): 2858-2874 (2024) - [c81]Arad Kotzer, Ori Rottenstreich:
Privacy Comparison for Bitcoin Light Client Implementations. AFT 2024: 15:1-15:23 - [c80]Ori Mazor, Ori Rottenstreich:
Understanding the Blockchain Interoperability Graph Based on Cryptocurrency Price Correlation. Blockchain 2024: 392-399 - [c79]Ori Rottenstreich, Eliav Buchnik, Shai Ferster, Tom Kalvari, Dan Karliner, Omer Litov, Nitzan Tur, Danny Veikherman, Avishai Zagoury, Jack Haddad, Dotan Emanuel, Avinatan Hassidim:
Probe-Based Study of Traffic Variability for the Design of Traffic Light Plans. COMSNETS 2024: 353-360 - [c78]Yekaterina Podiatchev, Ariel Orda, Ori Rottenstreich:
Survivable Payment Channel Networks. COMSNETS 2024: 479-487 - [c77]Ori Mazor, Ori Rottenstreich:
An Empirical Study of Cross-Chain Arbitrage in Decentralized Exchanges. COMSNETS 2024: 488-496 - [c76]Jack Haddad, Nitzan Tur, Danny Veikherman, Eliav Buchnik, Shai Ferster, Tom Kalvari, Dan Karliner, Omer Litov, Avishai Zagoury, Ori Rottenstreich, Dotan Emanuel, Avinatan Hassidim:
Quantitative Approach for Coordination, at Scale, of Signalized Intersection Pairs. ECC 2024: 1881-1888 - [c75]Ori Rottenstreich, Tom Kalvari, Nitzan Tur, Eliav Buchnik, Shai Ferster, Dan Karliner, Omer Litov, Danny Veikherman, Avishai Zagoury, Jack Haddad, Dotan Emanuel, Avinatan Hassidim:
Estimating Daily Start Times of Periodic Traffic Light Plans from Traffic Trajectories. ECC 2024: 3378-3385 - [c74]Arad Kotzer, Mostafa Naamneh, Ori Rottenstreich, Pedro Reviriego:
Detection of NFT Duplications with Image Hash Functions. ICBC 2024: 1-7 - [c73]Avi Mizrahi, Daniella Bar-Lev, Eitan Yaakobi, Ori Rottenstreich:
Invertible Bloom Lookup Tables with Listing Guarantees. SIGMETRICS/Performance (Abstracts) 2024: 19-20 - [i23]Ori Mazor, Ori Rottenstreich:
Understanding the Blockchain Interoperability Graph based on Cryptocurrency Price Correlation. IACR Cryptol. ePrint Arch. 2024: 1357 (2024) - [i22]Yekaterina Podiatchev, Ariel Orda, Ori Rottenstreich:
Survivable Payment Channel Networks. IACR Cryptol. ePrint Arch. 2024: 1393 (2024) - [i21]Arad Kotzer, Ori Rottenstreich:
Privacy Comparison for Bitcoin Light Client Implementations. IACR Cryptol. ePrint Arch. 2024: 1415 (2024) - [i20]Avi Mizrahi, Noam Koren, Ori Rottenstreich, Yuval Cassuto:
Traffic-aware Merkle Trees for Shortening Blockchain Transaction Proofs. IACR Cryptol. ePrint Arch. 2024: 1451 (2024) - 2023
- [j59]Avi Mizrahi, Daniella Bar-Lev, Eitan Yaakobi, Ori Rottenstreich:
Invertible Bloom Lookup Tables with Listing Guarantees. Proc. ACM Meas. Anal. Comput. Syst. 7(3): 61:1-61:29 (2023) - [j58]Pedro Reviriego, Alfonso Sánchez-Macián, Elena Merino Gómez, Ori Rottenstreich, Shanshan Liu, Fabrizio Lombardi:
Attacking the Privacy of Approximate Membership Check Filters by Positive Concentration. IEEE Trans. Computers 72(5): 1409-1419 (2023) - [j57]Yiting Chen, Lailong Luo, Deke Guo, Ori Rottenstreich, Jie Wu:
SDTP: Accelerating Wide-Area Data Analytics With Simultaneous Data Transfer and Processing. IEEE Trans. Cloud Comput. 11(1): 911-926 (2023) - [j56]Dor Harris, Arik Rinberg, Ori Rottenstreich:
Compressing Distributed Network Sketches With Traffic-Aware Summaries. IEEE Trans. Netw. Serv. Manag. 20(2): 1962-1975 (2023) - [j55]Roi Ben Haim, Ori Rottenstreich:
Low-Latency and Reliable Virtual Network Function Placement in Edge Clouds. IEEE Trans. Netw. Serv. Manag. 20(3): 2172-2185 (2023) - [j54]Ori Rottenstreich:
Path Diversity and Survivability for the HyperX Datacenter Topology. IEEE Trans. Netw. Serv. Manag. 20(3): 2370-2385 (2023) - [j53]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Load Balancing With Minimal Deviation in Switch Memories. IEEE Trans. Netw. Serv. Manag. 20(4): 4283-4296 (2023) - [j52]Alon Rashelbach, Ori Rottenstreich, Mark Silberstein:
Scaling by Learning: Accelerating Open vSwitch Data Path With Neural Networks. IEEE/ACM Trans. Netw. 31(3): 1230-1243 (2023) - [j51]Muhammad Ibrar, Lei Wang, Nadir Shah, Ori Rottenstreich, Gabriel-Miro Muntean, Aamir Akbar:
Reliability-Aware Flow Distribution Algorithm in SDN-Enabled Fog Computing for Smart Cities. IEEE Trans. Veh. Technol. 72(1): 573-588 (2023) - [c72]Alon Rashelbach, Ori Rottenstreich, Mark Silberstein:
Nucleotide String Indexing using Range Matching. BCB 2023: 83:1-83:2 - [c71]Tom Azoulay, Uri Carl, Ori Rottenstreich:
Allowing Blockchain Loans with Low Collateral. ICBC 2023: 1-9 - [c70]Arad Kotzer, Ori Rottenstreich:
Braess Paradox in Layer-2 Blockchain Payment Networks. ICBC 2023: 1-9 - [c69]Daniella Bar-Lev, Avi Mizrahi, Tuvi Etzion, Ori Rottenstreich, Eitan Yaakobi:
Coding for IBLTs with Listing Guarantees. ISIT 2023: 1657-1662 - [c68]Alon Rashelbach, Ori Rottenstreich, Mark Silberstein:
Neural Networks for Computer Systems. SYSTOR 2023: 147 - [i19]Daniella Bar-Lev, Avi Mizrahi, Tuvi Etzion, Ori Rottenstreich, Eitan Yaakobi:
Coding for IBLTs with Listing Guarantees. CoRR abs/2305.05972 (2023) - [i18]Tom Azoulay, Uri Carl, Ori Rottenstreich:
Allowing Blockchain Loans with Low Collateral. CoRR abs/2306.11620 (2023) - [i17]Alon Rashelbach, Ori Rottenstreich, Mark Silberstein:
Nucleotide String Indexing using Range Matching. CoRR abs/2308.03804 (2023) - [i16]Ori Mazor, Ori Rottenstreich:
An Empirical Study of Cross-chain Arbitrage in Decentralized Exchanges. IACR Cryptol. ePrint Arch. 2023: 1898 (2023) - [i15]Tom Azoulay, Uri Carl, Ori Rottenstreich:
Allowing Blockchain Loans with Low Collateral. IACR Cryptol. ePrint Arch. 2023: 1899 (2023) - 2022
- [j50]Oded Noam, Ori Rottenstreich:
Realizing privacy aspects in blockchain networks. Ann. des Télécommunications 77(1-2): 3-12 (2022) - [j49]Maya Leshkowitz, Olivia Benattasse, Oded Wertheim, Ori Rottenstreich:
Scalable blockchain execution via parallel block validation. Ann. des Télécommunications 77(1-2): 61-76 (2022) - [j48]Pedro Reviriego, Jorge Martínez, Ori Rottenstreich, Shanshan Liu, Fabrizio Lombardi:
Remove Minimum (RM): An Error-Tolerant Scheme for Cardinality Estimate by HyperLogLog. IEEE Trans. Dependable Secur. Comput. 19(2): 966-977 (2022) - [j47]Pedro Reviriego, Alfonso Sánchez-Macián, Ori Rottenstreich, David Larrabeiti:
Adaptive One Memory Access Bloom Filters. IEEE Trans. Netw. Serv. Manag. 19(2): 848-859 (2022) - [j46]Ori Rottenstreich, Ariel Kulik, Ananya Joshi, Jennifer Rexford, Gábor Rétvári, Daniel Sadoc Menasché:
Data Plane Cooperative Caching With Dependencies. IEEE Trans. Netw. Serv. Manag. 19(3): 2092-2106 (2022) - [j45]Salil S. Kanhere, Andreas G. Veneris, Sachiko Yoshihama, Sandip Chakraborty, Ori Rottenstreich, Marta Beltrán Pardo, Bruno Rodriguez:
Guest Editorial: Special Issue on Recent Advances on Blockchain for Network and Service Management. IEEE Trans. Netw. Serv. Manag. 19(4): 3689-3693 (2022) - [j44]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Optimal Weighted Load Balancing in TCAMs. IEEE/ACM Trans. Netw. 30(3): 985-998 (2022) - [j43]Alon Rashelbach, Ori Rottenstreich, Mark Silberstein:
A Computational Approach to Packet Classification. IEEE/ACM Trans. Netw. 30(3): 1073-1087 (2022) - [c67]Yuxi Liu, Yao Xin, Wenjun Li, Haoyu Song, Ori Rottenstreich, Gaogang Xie, Weichao Li, Yi Wang:
HybridTSS: A Recursive Scheme Combining Coarse- and Fine- Grained Tuples for Packet Classification. APNet 2022: 43-49 - [c66]Ori Rottenstreich:
Survivability via Path Disjointness for HyperX. APOCS 2022: 61-75 - [c65]Mohammad Nassar, Ori Rottenstreich, Ariel Orda:
Communication-aware Fairness in Blockchain Transaction Ordering. HPSR 2022: 175-182 - [c64]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Minimal Total Deviation in TCAM Load Balancing. INFOCOM 2022: 450-459 - [c63]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Coding Size of Traffic Partition in Switch Memories. ISIT 2022: 1590-1595 - [c62]Alon Rashelbach, Ori Rottenstreich, Mark Silberstein:
Scaling Open vSwitch with a Computational Cache. NSDI 2022: 1359-1374 - [i14]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Codes for Load Balancing in TCAMs: Size Analysis. CoRR abs/2212.13256 (2022) - [i13]Avi Mizrahi, Daniella Bar-Lev, Eitan Yaakobi, Ori Rottenstreich:
Invertible Bloom Lookup Tables with Listing Guarantees. CoRR abs/2212.13812 (2022) - 2021
- [j42]Roi Ben Haim, Ori Rottenstreich:
Reliable and Time-Efficient Virtualized Function Placement. IEEE Micro 41(1): 45-53 (2021) - [j41]Ariel Orda, Ori Rottenstreich:
Enforcing Fairness in Blockchain Transaction Ordering. Peer-to-Peer Netw. Appl. 14(6): 3660-3673 (2021) - [j40]László Toka, Márton Zubor, Attila Korösi, George Darzanos, Ori Rottenstreich, Balázs Sonkoly:
Pricing games of NFV infrastructure providers. Telecommun. Syst. 76(2): 219-232 (2021) - [j39]Avi Mizrahi, Ori Rottenstreich:
Blockchain State Sharding With Space-Aware Representations. IEEE Trans. Netw. Serv. Manag. 18(2): 1571-1583 (2021) - [j38]David Yakira, Avi Asayag, Gad Cohen, Ido Grayevsky, Maya Leshkowitz, Ori Rottenstreich, Ronen Tamari:
Helix: A Fair Blockchain Consensus Protocol Resistant to Ordering Manipulation. IEEE Trans. Netw. Serv. Manag. 18(2): 1584-1597 (2021) - [j37]Sándor Z. Kiss, Éva Hosszu, János Tapolcai, Lajos Rónyai, Ori Rottenstreich:
Bloom Filter With a False Positive Free Zone. IEEE Trans. Netw. Serv. Manag. 18(2): 2334-2349 (2021) - [j36]Ori Rottenstreich, Pedro Reviriego, Ely Porat, S. Muthukrishnan:
Avoiding Flow Size Overestimation in Count-Min Sketch With Bloom Filter Constructions. IEEE Trans. Netw. Serv. Manag. 18(3): 3662-3676 (2021) - [j35]Lailong Luo, Deke Guo, Ori Rottenstreich, Richard T. B. Ma, Xueshan Luo, Bangbang Ren:
A Capacity-Elastic Cuckoo Filter Design for Dynamic Set Representation. IEEE Trans. Netw. Serv. Manag. 18(4): 4860-4874 (2021) - [j34]Guilherme de Melo Baptista Domingues, Gabriel Mendonça, Edmundo de Souza e Silva, Rosa M. M. Leão, Daniel S. Menasché, Ori Rottenstreich, Mostafa Dehghan, Don Towsley:
The Role of Hysteresis in Caching Systems. ACM Trans. Model. Perform. Evaluation Comput. Syst. 6(1): 2:1-2:38 (2021) - [j33]Lailong Luo, Deke Guo, Yawei Zhao, Ori Rottenstreich, Richard T. B. Ma, Xueshan Luo:
MCFsyn: A Multi-Party Set Reconciliation Protocol With the Marked Cuckoo Filter. IEEE Trans. Parallel Distributed Syst. 32(11): 2705-2718 (2021) - [c61]Tomer Voronov, Danny Raz, Ori Rottenstreich:
Scalable Blockchain Anomaly Detection with Sketches. Blockchain 2021: 1-10 - [c60]Pedro Reviriego, Ori Rottenstreich, Shanshan Liu, Fabrizio Lombardi:
Analyzing and Assessing Pollution Attacks on Bloom Filters: Some Filters are More Vulnerable than Others. CNSM 2021: 491-499 - [c59]Ori Rottenstreich:
Sketches for Blockchains. COMSNETS 2021: 254-262 - [c58]Julia Khamis, Ori Rottenstreich:
Demand-aware Channel Topologies for Off-chain Payments. COMSNETS 2021: 272-280 - [c57]Avi Mizrahi, Noam Koren, Ori Rottenstreich:
Optimizing Merkle Proof Size for Blockchain Transactions. COMSNETS 2021: 299-307 - [c56]Julia Khamis, Stefan Schmid, Ori Rottenstreich:
Demand Matrix Optimization for Offchain Payments in Blockchain. IEEE ICBC 2021: 1-9 - [c55]Roy Friedman, Or Goaz, Ori Rottenstreich:
Effective Space Saving. ICDCN 2021: 66-75 - [c54]Yuhan Wu, Zirui Liu, Xiang Yu, Jie Gui, Haochen Gan, Yuhao Han, Tao Li, Ori Rottenstreich, Tong Yang:
MapEmbed: Perfect Hashing with High Load Factor and Fast Update. KDD 2021: 1863-1872 - [c53]Dor Harris, Arik Rinberg, Ori Rottenstreich:
Distributed Sketching with Traffic-Aware Summaries. Networking 2021: 1-8 - [c52]Roy Friedman, Or Goaz, Ori Rottenstreich:
Clustreams: Data Plane Clustering. SOSR 2021: 101-107 - [c51]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
How Much TCAM do we Need for Splitting Traffic? SOSR 2021: 169-175 - [i12]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Optimal Weighted Load Balancing in TCAMs. CoRR abs/2112.14732 (2021) - [i11]Julia Khamis, Ori Rottenstreich:
Demand-aware Channel Topologies for Off-chain Blockchain Payments. IACR Cryptol. ePrint Arch. 2021: 9 (2021) - [i10]Ori Rottenstreich:
Sketches for Blockchains. IACR Cryptol. ePrint Arch. 2021: 35 (2021) - 2020
- [j32]Wenjun Li, Tong Yang, Ori Rottenstreich, Xianfeng Li, Gaogang Xie, Hui Li, Balajee Vamanan, Dagang Li, Huiping Lin:
Tuple Space Assisted Packet Classification With High Performance on Both Search and Update. IEEE J. Sel. Areas Commun. 38(7): 1555-1569 (2020) - [j31]Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim:
Clustering in Hypergraphs to Minimize Average Edge Service Time. ACM Trans. Algorithms 16(3): 40:1-40:28 (2020) - [j30]Yaniv Sadeh, Ori Rottenstreich, Arye Barkan, Yossi Kanizo, Haim Kaplan:
Optimal Representations of a Traffic Distribution in Switch Memories. IEEE/ACM Trans. Netw. 28(2): 930-943 (2020) - [j29]Ran Ben Basat, Xiaoqi Chen, Gil Einziger, Ori Rottenstreich:
Designing Heavy-Hitter Detection Algorithms for Programmable Switches. IEEE/ACM Trans. Netw. 28(3): 1172-1185 (2020) - [j28]Muhammad Shahbaz, Lalith Suresh, Jennifer Rexford, Nick Feamster, Ori Rottenstreich, Mukesh Hira:
Elmo: Source Routed Multicast for Public Clouds. IEEE/ACM Trans. Netw. 28(6): 2587-2600 (2020) - [c50]Zaoxing Liu, Samson Zhou, Ori Rottenstreich, Vladimir Braverman, Jennifer Rexford:
Memory-Efficient Performance Monitoring on Programmable Switches with Lean Algorithms. APOCS 2020: 31-44 - [c49]Ori Rottenstreich, Ariel Kulik, Ananya Joshi, Jennifer Rexford, Gábor Rétvári, Daniel S. Menasché:
Cooperative Rule Caching for SDN Switches. CloudNet 2020: 1-7 - [c48]Pedro Reviriego, Ori Rottenstreich:
Pollution Attacks on Counting Bloom Filters for Black Box Adversaries. CNSM 2020: 1-7 - [c47]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Optimal approximations for traffic distribution in bounded switch memories. CoNEXT 2020: 309-322 - [c46]Ori Rottenstreich, Jose Yallouz, Lion Levi:
Isolated Trees in Multi-Tenant Fat Tree Datacenters for In-Network Computing. Hot Interconnects 2020: 55-62 - [c45]Roi Ben Haim, Ori Rottenstreich:
Reliable and Time-efficient Virtualized Function Placement. Hot Interconnects 2020: 71-78 - [c44]Maya Leshkowitz, Olivia Benattasse, Oded Wertheim, Ori Rottenstreich:
Scalable Block Execution via Parallel Validation. IEEE ICBC 2020: 1-9 - [c43]Avi Mizrahi, Ori Rottenstreich:
State Sharding with Space-aware Representations. IEEE ICBC 2020: 1-9 - [c42]Yaakov Sokolik, Ori Rottenstreich:
Age-aware Fairness in Blockchain Transaction Ordering. IWQoS 2020: 1-9 - [c41]Alon Rashelbach, Ori Rottenstreich, Mark Silberstein:
A Computational Approach to Packet Classification. SIGCOMM 2020: 542-556 - [c40]Ori Rottenstreich, Pedro Reviriego, Ely Porat, S. Muthukrishnan:
Constructions and Applications for Accurate Counting of the Bloom Filter False Positive Free Zone. SOSR 2020: 135-145 - [i9]Alon Rashelbach, Ori Rottenstreich, Mark Silberstein:
A Computational Approach to Packet Classification. CoRR abs/2002.07584 (2020)
2010 – 2019
- 2019
- [j27]Lailong Luo, Deke Guo, Richard T. B. Ma, Ori Rottenstreich, Xueshan Luo:
Optimizing Bloom Filter: Challenges, Solutions, and Comparisons. IEEE Commun. Surv. Tutorials 21(2): 1912-1949 (2019) - [j26]Eitan Zahavi, Alexander Shpiner, Ori Rottenstreich, Avinoam Kolodny, Isaac Keslassy:
Links as a Service (LaaS): Guaranteed Tenant Isolation in the Shared Cloud. IEEE J. Sel. Areas Commun. 37(5): 1072-1084 (2019) - [j25]Pedro Reviriego, Shanshan Liu, Ori Rottenstreich, Fabrizio Lombardi:
Two Bit Overlap: A Class of Double Error Correction One Step Majority Logic Decodable Codes. IEEE Trans. Computers 68(5): 798-803 (2019) - [j24]Lailong Luo, Deke Guo, Xiang Zhao, Jie Wu, Ori Rottenstreich, Xueshan Luo:
Near-accurate Multiset Reconciliation. IEEE Trans. Knowl. Data Eng. 31(5): 952-964 (2019) - [j23]Pedro Reviriego, Ori Rottenstreich:
The Tandem Counting Bloom Filter - It Takes Two Counters to Tango. IEEE/ACM Trans. Netw. 27(6): 2252-2265 (2019) - [c39]Lailong Luo, Deke Guo, Ori Rottenstreich, Richard T. B. Ma, Xueshan Luo:
Set Reconciliation with Cuckoo Filters. CIKM 2019: 2465-2468 - [c38]Xiaoqi Chen, Shir Landau Feibish, Yaron Koral, Jennifer Rexford, Ori Rottenstreich, Steven A. Monetti, Tzuu-Yi Wang:
Fine-grained queue measurement in the data plane. CoNEXT 2019: 15-29 - [c37]Ariel Orda, Ori Rottenstreich:
Enforcing Fairness in Blockchain Transaction Ordering. IEEE ICBC 2019: 368-375 - [c36]Lailong Luo, Deke Guo, Xiang Zhao, Jie Wu, Ori Rottenstreich, Xueshan Luo:
Near-Accurate Multiset Reconciliation (Extended Abstract). ICDE 2019: 2153-2154 - [c35]Lailong Luo, Deke Guo, Ori Rottenstreich, Richard T. B. Ma, Xueshan Luo, Bangbang Ren:
The Consistent Cuckoo Filter. INFOCOM 2019: 712-720 - [c34]Yaniv Sadeh, Ori Rottenstreich, Arye Barkan, Yossi Kanizo, Haim Kaplan:
Optimal Representations of a Traffic Distribution in Switch Memories. INFOCOM 2019: 2035-2043 - [c33]Muhammad Shahbaz, Lalith Suresh, Jennifer Rexford, Nick Feamster, Ori Rottenstreich, Mukesh Hira:
Elmo: source routed multicast for public clouds. SIGCOMM 2019: 458-471 - [i8]Zaoxing Liu, Samson Zhou, Ori Rottenstreich, Vladimir Braverman, Jennifer Rexford:
Memory-Efficient Performance Monitoring on Programmable Switches with Lean Algorithms. CoRR abs/1911.06951 (2019) - 2018
- [j22]Ori Rottenstreich, Yossi Kanizo, Haim Kaplan, Jennifer Rexford:
Accurate Traffic Splitting on SDN Switches. IEEE J. Sel. Areas Commun. 36(10): 2190-2201 (2018) - [j21]Jingyuan Fan, Meiling Jiang, Ori Rottenstreich, Yangming Zhao, Tong Guan, Ram Ramesh, Sanjukta Das, Chunming Qiao:
A Framework for Provisioning Availability of NFV in Data Center Networks. IEEE J. Sel. Areas Commun. 36(10): 2246-2259 (2018) - [j20]Yossi Kanizo, Ori Rottenstreich, Itai Segall, Jose Yallouz:
Designing Optimal Middlebox Recovery Schemes With Performance Guarantees. IEEE J. Sel. Areas Commun. 36(10): 2373-2383 (2018) - [j19]Ori Rottenstreich, Yuval Cassuto:
Optimal Compression for Two-Field Entries in Fixed-Width Memories. IEEE Trans. Inf. Theory 64(6): 4309-4322 (2018) - [j18]Jose Yallouz, Ori Rottenstreich, Péter Babarczi, Avi Mendelson, Ariel Orda:
Minimum-Weight Link-Disjoint Node-"Somewhat Disjoint" Paths. IEEE/ACM Trans. Netw. 26(3): 1110-1122 (2018) - [c32]Avi Asayag, Gad Cohen, Ido Grayevsky, Maya Leshkowitz, Ori Rottenstreich, Ronen Tamari, David Yakira:
A Fair Consensus Protocol for Transaction Ordering. ICNP 2018: 55-65 - [c31]Ran Ben-Basat, Xiaoqi Chen, Gil Einziger, Ori Rottenstreich:
Efficient Measurement on Programmable Switches Using Probabilistic Recirculation. ICNP 2018: 313-323 - [c30]Sándor Z. Kiss, Éva Hosszu, János Tapolcai, Lajos Rónyai, Ori Rottenstreich:
Bloom Filter with a False Positive Free Zone. INFOCOM 2018: 1412-1420 - [c29]Yossi Kanizo, Ori Rottenstreich, Itai Segall, Jose Yallouz:
Designing Optimal Middlebox Recovery Schemes with Performance Guarantees. INFOCOM 2018: 2096-2104 - [c28]Xiaoqi Chen, Shir Landau Feibish, Yaron Koral, Jennifer Rexford, Ori Rottenstreich:
Catching the Microburst Culprits with Snappy. SelfDN@SIGCOMM 2018: 22-28 - [c27]Ori Rottenstreich, Yossi Kanizo, Haim Kaplan, Jennifer Rexford:
Accurate Traffic Splitting on Commodity Switches. SPAA 2018: 311-320 - [i7]Muhammad Shahbaz, Lalith Suresh, Nick Feamster, Jen Rexford, Ori Rottenstreich, Mukesh Hira:
Elmo: Source-Routed Multicast for Cloud Services. CoRR abs/1802.09815 (2018) - [i6]Lailong Luo, Deke Guo, Richard T. B. Ma, Ori Rottenstreich, Xueshan Luo:
Optimizing Bloom Filter: Challenges, Solutions, and Comparisons. CoRR abs/1804.04777 (2018) - [i5]Ran Ben-Basat, Xiaoqi Chen, Gil Einziger, Ori Rottenstreich:
Efficient Measurement on Programmable Switches Using Probabilistic Recirculation. CoRR abs/1808.03412 (2018) - [i4]Avi Asayag, Gad Cohen, Ido Grayevsky, Maya Leshkowitz, Ori Rottenstreich, Ronen Tamari, David Yakira:
Helix: A Scalable and Fair Consensus Algorithm Resistant to Ordering Manipulation. IACR Cryptol. ePrint Arch. 2018: 863 (2018) - 2017
- [j17]Tal Mizrahi, Ori Rottenstreich, Yoram Moses:
TimeFlip: Using Timestamp-Based TCAM Ranges to Accurately Schedule Network Updates. IEEE/ACM Trans. Netw. 25(2): 849-863 (2017) - [j16]Ori Rottenstreich, János Tapolcai:
Optimal Rule Caching and Lossy Compression for Longest Prefix Matching. IEEE/ACM Trans. Netw. 25(2): 864-878 (2017) - [j15]Lailong Luo, Deke Guo, Jie Wu, Ori Rottenstreich, Qian He, Yudong Qin, Xueshan Luo:
Efficient Multiset Synchronization. IEEE/ACM Trans. Netw. 25(2): 1190-1205 (2017) - [j14]Ori Rottenstreich, Mario Di Francesco, Yoram Revah:
Perfectly Periodic Scheduling of Collective Data Streams. IEEE/ACM Trans. Netw. 25(3): 1332-1346 (2017) - [j13]Nanxi Kang, Ori Rottenstreich, Sanjay G. Rao, Jennifer Rexford:
Alpaca: Compact Network Policies With Attribute-Encoded Addresses. IEEE/ACM Trans. Netw. 25(3): 1846-1860 (2017) - [j12]Yossi Kanizo, Ori Rottenstreich, Itai Segall, Jose Yallouz:
Optimizing Virtual Backup Allocation for Middleboxes. IEEE/ACM Trans. Netw. 25(5): 2759-2772 (2017) - [j11]Kirill Kogan, Sergey I. Nikolenko, Patrick Eugster, Alexander Shalimov, Ori Rottenstreich:
Efficient FIB Representations on Distributed Platforms. IEEE/ACM Trans. Netw. 25(6): 3309-3322 (2017) - [j10]Ori Rottenstreich, Isaac Keslassy, Yoram Revah, Aviran Kadosh:
Minimizing Delay in Network Function Virtualization with Shared Pipelines. IEEE Trans. Parallel Distributed Syst. 28(1): 156-169 (2017) - [c26]Rohan Gandhi, Ori Rottenstreich, Xin Jin:
Catalyst: Unlocking the Power of Choice to Speed up Network Updates. CoNEXT 2017: 276-282 - [c25]Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim:
Clustering in Hypergraphs to Minimize Average Edge Service Time. ESA 2017: 64:1-64:14 - [c24]Ori Rottenstreich, Yuval Cassuto:
Optimal compression of element pairs in fixed-width memories. ITW 2017: 156-160 - [c23]Robert MacDavid, Rüdiger Birkner, Ori Rottenstreich, Arpit Gupta, Nick Feamster, Jennifer Rexford:
Concise Encoding of Flow Attributes in SDN Switches. SOSR 2017: 48-60 - [c22]Vibhaalakshmi Sivaraman, Srinivas Narayana, Ori Rottenstreich, S. Muthukrishnan, Jennifer Rexford:
Heavy-Hitter Detection Entirely in the Data Plane. SOSR 2017: 164-176 - [i3]Ori Rottenstreich, Yuval Cassuto:
Optimal Compression for Two-Field Entries in Fixed-Width Memories. CoRR abs/1701.02900 (2017) - 2016
- [j9]Ori Rottenstreich, Isaac Keslassy, Avinatan Hassidim, Haim Kaplan, Ely Porat:
Optimal In/Out TCAM Encodings of Ranges. IEEE/ACM Trans. Netw. 24(1): 555-568 (2016) - [j8]Kirill Kogan, Sergey I. Nikolenko, Ori Rottenstreich, William Culhane, Patrick Eugster:
Exploiting Order Independence for Scalable and Expressive Packet Classification. IEEE/ACM Trans. Netw. 24(2): 1251-1264 (2016) - [j7]Jose Yallouz, Ori Rottenstreich, Ariel Orda:
Tunable Survivable Spanning Trees. IEEE/ACM Trans. Netw. 24(3): 1853-1866 (2016) - [c21]Eitan Zahavi, Alexander Shpiner, Ori Rottenstreich, Avinoam Kolodny, Isaac Keslassy:
Links as a Service (LaaS): Guaranteed Tenant Isolation in the Shared Cloud. ANCS 2016: 87-98 - [c20]Yossi Kanizo, Ori Rottenstreich, Itai Segall, Jose Yallouz:
Optimizing virtual backup allocation for middleboxes. ICNP 2016: 1-10 - [c19]Kirill Kogan, Sergey I. Nikolenko, Patrick Eugster, Alexander Shalimov, Ori Rottenstreich:
FIB efficiency in distributed platforms. ICNP 2016: 1-10 - [c18]Jose Yallouz, Ori Rottenstreich, Péter Babarczi, Avi Mendelson, Ariel Orda:
Optimal link-disjoint node-"somewhat disjoint" paths. ICNP 2016: 1-10 - [i2]Vibhaalakshmi Sivaraman, Srinivas Narayana, Ori Rottenstreich, S. Muthukrishnan, Jennifer Rexford:
Smoking Out the Heavy-Hitter Flows with HashPipe. CoRR abs/1611.04825 (2016) - 2015
- [j6]Ori Rottenstreich, Isaac Keslassy:
The Bloom Paradox: When Not to Use a Bloom Filter. IEEE/ACM Trans. Netw. 23(3): 703-716 (2015) - [c17]Ori Rottenstreich, János Tapolcai:
Lossy Compression of Packet Classifiers. ANCS 2015: 39-50 - [c16]Nanxi Kang, Ori Rottenstreich, Sanjay G. Rao, Jennifer Rexford:
Alpaca: compact network policies with attribute-carrying addresses. CoNEXT 2015: 7:1-7:13 - [c15]Tal Mizrahi, Ori Rottenstreich, Yoram Moses:
TimeFlip: Scheduling network updates with timestamp-based TCAM ranges. INFOCOM 2015: 2551-2559 - [i1]Eitan Zahavi, Alexander Shpiner, Ori Rottenstreich, Avinoam Kolodny, Isaac Keslassy:
Links as a Service (LaaS): Feeling Alone in the Shared Cloud. CoRR abs/1509.07395 (2015) - 2014
- [j5]Ori Rottenstreich, Marat Radan, Yuval Cassuto, Isaac Keslassy, Carmi Arad, Tal Mizrahi, Yoram Revah, Avinatan Hassidim:
Compressing Forwarding Tables for Datacenter Scalability. IEEE J. Sel. Areas Commun. 32(1): 138-151 (2014) - [j4]Ori Rottenstreich, Pu Li, Inbal Horev, Isaac Keslassy, Shivkumar Kalyanaraman:
The Switch Reordering Contagion: Preventing a Few Late Packets from Ruining the Whole Party. IEEE Trans. Computers 63(5): 1262-1276 (2014) - [j3]Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy:
The Variable-Increment Counting Bloom Filter. IEEE/ACM Trans. Netw. 22(4): 1092-1105 (2014) - [c14]Alexander Shpiner, Eitan Zahavi, Ori Rottenstreich:
The Buffer Size vs Link Bandwidth Tradeoff in Lossless Networks. Hot Interconnects 2014: 33-40 - [c13]Ori Rottenstreich, Yoram Revah:
Weighted periodic scheduling of a shared resource. HPSR 2014: 106-113 - [c12]Kirill Kogan, Sergey I. Nikolenko, Ori Rottenstreich, William Culhane, Patrick Eugster:
SAX-PAC (Scalable And eXpressive PAcket Classification). SIGCOMM 2014: 15-26 - [c11]Jose Yallouz, Ori Rottenstreich, Ariel Orda:
Tunable survivable spanning trees. SIGMETRICS 2014: 315-327 - 2013
- [j2]Ori Rottenstreich, Rami Cohen, Danny Raz, Isaac Keslassy:
Exact Worst Case TCAM Rule Expansion. IEEE Trans. Computers 62(6): 1127-1140 (2013) - [c10]Ori Rottenstreich, Isaac Keslassy, Yoram Revah, Aviran Kadosh:
Minimizing Delay in Shared Pipelines. Hot Interconnects 2013: 9-16 - [c9]Ori Rottenstreich, Marat Radan, Yuval Cassuto, Isaac Keslassy, Carmi Arad, Tal Mizrahi, Yoram Revah, Avinatan Hassidim:
Compressing forwarding tables. INFOCOM 2013: 1231-1239 - [c8]Ori Rottenstreich, Isaac Keslassy, Avinatan Hassidim, Haim Kaplan, Ely Porat:
On finding an optimal TCAM encoding scheme for packet classification. INFOCOM 2013: 2049-2057 - [c7]Ori Rottenstreich, Amit Berman, Yuval Cassuto, Isaac Keslassy:
Compression for fixed-width memories. ISIT 2013: 2379-2383 - 2012
- [c6]Amit Berman, Yitzhak Birk, Ori Rottenstreich:
Probabilistic performance of write-once memory with Linear Wom codes - Analysis and insights. Allerton Conference 2012: 1141-1149 - [c5]Ori Rottenstreich, Isaac Keslassy:
The Bloom paradox: When not to use a Bloom filter? INFOCOM 2012: 1638-1646 - [c4]Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy:
The Variable-Increment Counting Bloom Filter. INFOCOM 2012: 1880-1888 - 2010
- [j1]Itamar Cohen, Ori Rottenstreich, Isaac Keslassy:
Statistical Approach to Networks-on-Chip. IEEE Trans. Computers 59(6): 748-761 (2010) - [c3]Ori Rottenstreich, Isaac Keslassy:
Worst-Case TCAM Rule Expansion. INFOCOM 2010: 456-460 - [c2]Ori Rottenstreich, Isaac Keslassy:
On the code length of TCAM coding schemes. ISIT 2010: 1908-1912
2000 – 2009
- 2008
- [c1]Itamar Cohen, Ori Rottenstreich, Isaac Keslassy:
Statistical Approach to NoC Design. NOCS 2008: 171-180
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
