74 citations · 172 across the 17 of their papers we have counts for
18 papers
Network Topologies for QKD Networks
Ori Rottenstreich, Ran Hasson Ruso, Eliahu Cohen
Quantum key distribution (QKD) is a method for distributing cryptographic keys between remote endpoints, enjoying security based on quantum physics. This paper makes a first step t…
Decoding-Level Taboo: A Diagnostic Stress Test for LLM Robustness
Tadanobu Chuyo Kamijo, Ori Rottenstreich, Javier Conde +2
Large language model evaluations typically focus on performance under nominal conditions, creating an illusion of capability where models comfortably walk a narrow, highly optimize…
Learning Filters with Certainty
Yuval Banoun, Daniel Sadoc Menasche, Ori Rottenstreich
Hash-based data structures such as Bloom filters are widely used in network systems for tasks including caching, anomaly detection, and machine learning pipelines. They typically p…
CertainSync: Rateless Set Reconciliation with Certainty
Tomer Keniagin, Eitan Yaakobi, Ori Rottenstreich
Set reconciliation is a fundamental task in distributed systems, particularly in blockchain networks, where it enables synchronization of transaction pools among peers and facilita…
Nucleotide String Indexing using Range Matching
Alon Rashelbach, Ori Rottensterich, Mark Silberstien
The two most common data-structures for genome indexing, FM-indices and hash-tables, exhibit a fundamental trade-off between memory footprint and performance. We present Ranger, a…
Allowing Blockchain Loans with Low Collateral
Tom Azoulay, Uri Carl, Ori Rottenstreich
Collateral is an item of value serving as security for the repayment of a loan. In blockchain-based loans, cryptocurrencies serve as the collateral. The high volatility of cryptocu…
Coding for IBLTs with Listing Guarantees
Daniella Bar-Lev, Avi Mizrahi, Tuvi Etzion +2
The Invertible Bloom Lookup Table (IBLT) is a probabilistic data structure for set representation, with applications in network and traffic monitoring. It is known for its ability…
Invertible Bloom Lookup Tables with Listing Guarantees
Avi Mizrahi, Daniella Bar-Lev, Eitan Yaakobi +1
The Invertible Bloom Lookup Table (IBLT) is a probabilistic concise data structure for set representation that supports a listing operation as the recovery of the elements in the r…
Codes for Load Balancing in TCAMs: Size Analysis
Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
Traffic splitting is a required functionality in networks, for example for load balancing over paths or servers, or by the source's access restrictions. The capacities of the serve…
Optimal Weighted Load Balancing in TCAMs
Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
Traffic splitting is a required functionality in networks, for example for load balancing over multiple paths or among different servers. The capacities of the servers determine th…
A Computational Approach to Packet Classification
Alon Rashelbach, Ori Rottenstreich, Mark Silberstein
Multi-field packet classification is a crucial component in modern software-defined data center networks. To achieve high throughput and low latency, state-of-the-art algorithms st…
Memory-Efficient Performance Monitoring on Programmable Switches with Lean Algorithms
Zaoxing Liu, Samson Zhou, Ori Rottenstreich +2
Network performance problems are notoriously difficult to diagnose. Prior profiling systems collect performance statistics by keeping information about each network flow, but maint…
Efficient Measurement on Programmable Switches Using Probabilistic Recirculation
Ran Ben Basat, Xiaoqi Chen, Gil Einziger +1
Programmable network switches promise flexibility and high throughput, enabling applications such as load balancing and traffic engineering. Network measurement is a fundamental bu…
Optimizing Bloom Filter: Challenges, Solutions, and Comparisons
Lailong Luo, Deke Guo, Richard T. B. Ma +2
Bloom filter (BF) has been widely used to support membership query, i.e., to judge whether a given element x is a member of a given set S or not. Recent years have seen a flourish…
Elmo: Source-Routed Multicast for Cloud Services
Muhammad Shahbaz, Lalith Suresh, Jen Rexford +3
We present Elmo, a system that addresses the multicast scalability problem in multi-tenant data centers. Modern cloud applications frequently exhibit one-to-many communication patt…
Optimal Compression for Two-Field Entries in Fixed-Width Memories
Ori Rottenstreich, Yuval Cassuto
Data compression is a well-studied (and well-solved) problem in the setup of long coding blocks. But important emerging applications need to compress data to memory words of small…
Heavy-Hitter Detection Entirely in the Data Plane
Vibhaalakshmi Sivaraman, Srinivas Narayana, Ori Rottenstreich +2
Identifying the "heavy hitter" flows or flows with large traffic volumes in the data plane is important for several applications e.g., flow-size aware routing, DoS detection, and t…
Links as a Service (LaaS): Feeling Alone in the Shared Cloud
Eitan Zahavi, Alex Shpiner, Ori Rottenstreich +2
The most demanding tenants of shared clouds require complete isolation from their neighbors, in order to guarantee that their application performance is not affected by other tenan…