Ori Rottenstreich

Orcid: 0000-0002-4064-1238

Affiliations:
  • Technion, Israel Institute of Technology, Haifa, Israel


According to our database1, Ori Rottenstreich authored at least 129 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Framework for Anomaly Detection in Blockchain Networks With Sketches.
IEEE/ACM Trans. Netw., February, 2024

CFTO: Communication-Aware Fairness in Blockchain Transaction Ordering.
IEEE Trans. Netw. Serv. Manag., February, 2024

Probe-Based Study of Traffic Variability for the Design of Traffic Light Plans.
Proceedings of the 16th International Conference on COMmunication Systems & NETworkS, 2024

Survivable Payment Channel Networks.
Proceedings of the 16th International Conference on COMmunication Systems & NETworkS, 2024

2023
Load Balancing With Minimal Deviation in Switch Memories.
IEEE Trans. Netw. Serv. Manag., December, 2023

Invertible Bloom Lookup Tables with Listing Guarantees.
Proc. ACM Meas. Anal. Comput. Syst., December, 2023

Path Diversity and Survivability for the HyperX Datacenter Topology.
IEEE Trans. Netw. Serv. Manag., September, 2023

Low-Latency and Reliable Virtual Network Function Placement in Edge Clouds.
IEEE Trans. Netw. Serv. Manag., September, 2023

Scaling by Learning: Accelerating Open vSwitch Data Path With Neural Networks.
IEEE/ACM Trans. Netw., June, 2023

Compressing Distributed Network Sketches With Traffic-Aware Summaries.
IEEE Trans. Netw. Serv. Manag., June, 2023

Attacking the Privacy of Approximate Membership Check Filters by Positive Concentration.
IEEE Trans. Computers, May, 2023

Reliability-Aware Flow Distribution Algorithm in SDN-Enabled Fog Computing for Smart Cities.
IEEE Trans. Veh. Technol., 2023

SDTP: Accelerating Wide-Area Data Analytics With Simultaneous Data Transfer and Processing.
IEEE Trans. Cloud Comput., 2023

An Empirical Study of Cross-chain Arbitrage in Decentralized Exchanges.
IACR Cryptol. ePrint Arch., 2023

Allowing Blockchain Loans with Low Collateral.
IACR Cryptol. ePrint Arch., 2023

Neural Networks for Computer Systems.
Proceedings of the 16th ACM International Conference on Systems and Storage, 2023

Coding for IBLTs with Listing Guarantees.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Braess Paradox in Layer-2 Blockchain Payment Networks.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2023

Nucleotide String Indexing using Range Matching.
Proceedings of the 14th ACM International Conference on Bioinformatics, 2023

2022
Guest Editorial: Special Issue on Recent Advances on Blockchain for Network and Service Management.
IEEE Trans. Netw. Serv. Manag., December, 2022

Optimal Weighted Load Balancing in TCAMs.
IEEE/ACM Trans. Netw., 2022

A Computational Approach to Packet Classification.
IEEE/ACM Trans. Netw., 2022

Data Plane Cooperative Caching With Dependencies.
IEEE Trans. Netw. Serv. Manag., 2022

Adaptive One Memory Access Bloom Filters.
IEEE Trans. Netw. Serv. Manag., 2022

Remove Minimum (RM): An Error-Tolerant Scheme for Cardinality Estimate by HyperLogLog.
IEEE Trans. Dependable Secur. Comput., 2022

Codes for Load Balancing in TCAMs: Size Analysis.
CoRR, 2022

Realizing privacy aspects in blockchain networks.
Ann. des Télécommunications, 2022

Scalable blockchain execution via parallel block validation.
Ann. des Télécommunications, 2022

Scaling Open vSwitch with a Computational Cache.
Proceedings of the 19th USENIX Symposium on Networked Systems Design and Implementation, 2022

Coding Size of Traffic Partition in Switch Memories.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Minimal Total Deviation in TCAM Load Balancing.
Proceedings of the IEEE INFOCOM 2022, 2022

Communication-aware Fairness in Blockchain Transaction Ordering.
Proceedings of the 23rd IEEE International Conference on High Performance Switching and Routing, 2022

Survivability via Path Disjointness for HyperX.
Proceedings of the 3rd Symposium on Algorithmic Principles of Computer Systems, 2022

HybridTSS: A Recursive Scheme Combining Coarse- and Fine- Grained Tuples for Packet Classification.
Proceedings of the 6th Asia-Pacific Workshop on Networking, 2022

2021
MCFsyn: A Multi-Party Set Reconciliation Protocol With the Marked Cuckoo Filter.
IEEE Trans. Parallel Distributed Syst., 2021

The Role of Hysteresis in Caching Systems.
ACM Trans. Model. Perform. Evaluation Comput. Syst., 2021

Helix: A Fair Blockchain Consensus Protocol Resistant to Ordering Manipulation.
IEEE Trans. Netw. Serv. Manag., 2021

Avoiding Flow Size Overestimation in Count-Min Sketch With Bloom Filter Constructions.
IEEE Trans. Netw. Serv. Manag., 2021

Blockchain State Sharding With Space-Aware Representations.
IEEE Trans. Netw. Serv. Manag., 2021

A Capacity-Elastic Cuckoo Filter Design for Dynamic Set Representation.
IEEE Trans. Netw. Serv. Manag., 2021

Bloom Filter With a False Positive Free Zone.
IEEE Trans. Netw. Serv. Manag., 2021

Pricing games of NFV infrastructure providers.
Telecommun. Syst., 2021

Enforcing Fairness in Blockchain Transaction Ordering.
Peer-to-Peer Netw. Appl., 2021

Reliable and Time-Efficient Virtualized Function Placement.
IEEE Micro, 2021

Sketches for Blockchains.
IACR Cryptol. ePrint Arch., 2021

Demand-aware Channel Topologies for Off-chain Blockchain Payments.
IACR Cryptol. ePrint Arch., 2021

How Much TCAM do we Need for Splitting Traffic?
Proceedings of the SOSR '21: The ACM SIGCOMM Symposium on SDN Research, Virtual Event, USA, October 11, 2021

Clustreams: Data Plane Clustering.
Proceedings of the SOSR '21: The ACM SIGCOMM Symposium on SDN Research, Virtual Event, USA, October 11, 2021

Distributed Sketching with Traffic-Aware Summaries.
Proceedings of the IFIP Networking Conference, 2021

MapEmbed: Perfect Hashing with High Load Factor and Fast Update.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Effective Space Saving.
Proceedings of the ICDCN '21: International Conference on Distributed Computing and Networking, 2021

Demand Matrix Optimization for Offchain Payments in Blockchain.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2021

Optimizing Merkle Proof Size for Blockchain Transactions.
Proceedings of the 13th International Conference on COMmunication Systems & NETworkS, 2021

Demand-aware Channel Topologies for Off-chain Payments.
Proceedings of the 13th International Conference on COMmunication Systems & NETworkS, 2021

Analyzing and Assessing Pollution Attacks on Bloom Filters: Some Filters are More Vulnerable than Others.
Proceedings of the 17th International Conference on Network and Service Management, 2021

Scalable Blockchain Anomaly Detection with Sketches.
Proceedings of the 2021 IEEE International Conference on Blockchain, 2021

2020
Elmo: Source Routed Multicast for Public Clouds.
IEEE/ACM Trans. Netw., 2020

Optimal Representations of a Traffic Distribution in Switch Memories.
IEEE/ACM Trans. Netw., 2020

Designing Heavy-Hitter Detection Algorithms for Programmable Switches.
IEEE/ACM Trans. Netw., 2020

Clustering in Hypergraphs to Minimize Average Edge Service Time.
ACM Trans. Algorithms, 2020

Tuple Space Assisted Packet Classification With High Performance on Both Search and Update.
IEEE J. Sel. Areas Commun., 2020

Constructions and Applications for Accurate Counting of the Bloom Filter False Positive Free Zone.
Proceedings of the SOSR '20: Symposium on SDN Research, San Jose, CA, USA, March 3, 2020, 2020

Age-aware Fairness in Blockchain Transaction Ordering.
Proceedings of the 28th IEEE/ACM International Symposium on Quality of Service, 2020

State Sharding with Space-aware Representations.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2020

Scalable Block Execution via Parallel Validation.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2020

Isolated Trees in Multi-Tenant Fat Tree Datacenters for In-Network Computing.
Proceedings of the IEEE Symposium on High-Performance Interconnects, 2020

Optimal approximations for traffic distribution in bounded switch memories.
Proceedings of the CoNEXT '20: The 16th International Conference on emerging Networking EXperiments and Technologies, 2020

Pollution Attacks on Counting Bloom Filters for Black Box Adversaries.
Proceedings of the 16th International Conference on Network and Service Management, 2020

Cooperative Rule Caching for SDN Switches.
Proceedings of the 9th IEEE International Conference on Cloud Networking, 2020

Memory-Efficient Performance Monitoring on Programmable Switches with Lean Algorithms.
Proceedings of the 1st Symposium on Algorithmic Principles of Computer Systems, 2020

2019
The Tandem Counting Bloom Filter - It Takes Two Counters to Tango.
IEEE/ACM Trans. Netw., 2019

Near-accurate Multiset Reconciliation.
IEEE Trans. Knowl. Data Eng., 2019

Two Bit Overlap: A Class of Double Error Correction One Step Majority Logic Decodable Codes.
IEEE Trans. Computers, 2019

Links as a Service (LaaS): Guaranteed Tenant Isolation in the Shared Cloud.
IEEE J. Sel. Areas Commun., 2019

Optimizing Bloom Filter: Challenges, Solutions, and Comparisons.
IEEE Commun. Surv. Tutorials, 2019

The Consistent Cuckoo Filter.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

Near-Accurate Multiset Reconciliation (Extended Abstract).
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Fine-grained queue measurement in the data plane.
Proceedings of the 15th International Conference on Emerging Networking Experiments And Technologies, 2019

Set Reconciliation with Cuckoo Filters.
Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

2018
Minimum-Weight Link-Disjoint Node-"Somewhat Disjoint" Paths.
IEEE/ACM Trans. Netw., 2018

Optimal Compression for Two-Field Entries in Fixed-Width Memories.
IEEE Trans. Inf. Theory, 2018

Accurate Traffic Splitting on SDN Switches.
IEEE J. Sel. Areas Commun., 2018

Designing Optimal Middlebox Recovery Schemes With Performance Guarantees.
IEEE J. Sel. Areas Commun., 2018

A Framework for Provisioning Availability of NFV in Data Center Networks.
IEEE J. Sel. Areas Commun., 2018

Helix: A Scalable and Fair Consensus Algorithm Resistant to Ordering Manipulation.
IACR Cryptol. ePrint Arch., 2018

Elmo: Source-Routed Multicast for Cloud Services.
CoRR, 2018

Accurate Traffic Splitting on Commodity Switches.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Catching the Microburst Culprits with Snappy.
Proceedings of the Afternoon Workshop on Self-Driving Networks, 2018

Efficient Measurement on Programmable Switches Using Probabilistic Recirculation.
Proceedings of the 2018 IEEE 26th International Conference on Network Protocols, 2018

A Fair Consensus Protocol for Transaction Ordering.
Proceedings of the 2018 IEEE 26th International Conference on Network Protocols, 2018

2017
Minimizing Delay in Network Function Virtualization with Shared Pipelines.
IEEE Trans. Parallel Distributed Syst., 2017

Optimal Rule Caching and Lossy Compression for Longest Prefix Matching.
IEEE/ACM Trans. Netw., 2017

Perfectly Periodic Scheduling of Collective Data Streams.
IEEE/ACM Trans. Netw., 2017

TimeFlip: Using Timestamp-Based TCAM Ranges to Accurately Schedule Network Updates.
IEEE/ACM Trans. Netw., 2017

Efficient Multiset Synchronization.
IEEE/ACM Trans. Netw., 2017

Efficient FIB Representations on Distributed Platforms.
IEEE/ACM Trans. Netw., 2017

Optimizing Virtual Backup Allocation for Middleboxes.
IEEE/ACM Trans. Netw., 2017

Alpaca: Compact Network Policies With Attribute-Encoded Addresses.
IEEE/ACM Trans. Netw., 2017

Heavy-Hitter Detection Entirely in the Data Plane.
Proceedings of the Symposium on SDN Research, 2017

Concise Encoding of Flow Attributes in SDN Switches.
Proceedings of the Symposium on SDN Research, 2017

Optimal compression of element pairs in fixed-width memories.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Catalyst: Unlocking the Power of Choice to Speed up Network Updates.
Proceedings of the 13th International Conference on emerging Networking EXperiments and Technologies, 2017

2016
Tunable Survivable Spanning Trees.
IEEE/ACM Trans. Netw., 2016

Optimal In/Out TCAM Encodings of Ranges.
IEEE/ACM Trans. Netw., 2016

Exploiting Order Independence for Scalable and Expressive Packet Classification.
IEEE/ACM Trans. Netw., 2016

Smoking Out the Heavy-Hitter Flows with HashPipe.
CoRR, 2016

Optimal link-disjoint node-"somewhat disjoint" paths.
Proceedings of the 24th IEEE International Conference on Network Protocols, 2016

FIB efficiency in distributed platforms.
Proceedings of the 24th IEEE International Conference on Network Protocols, 2016

2015
The Bloom Paradox: When Not to Use a Bloom Filter.
IEEE/ACM Trans. Netw., 2015

Links as a Service (LaaS): Feeling Alone in the Shared Cloud.
CoRR, 2015

TimeFlip: Scheduling network updates with timestamp-based TCAM ranges.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Alpaca: compact network policies with attribute-carrying addresses.
Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies, 2015

Lossy Compression of Packet Classifiers.
Proceedings of the Eleventh ACM/IEEE Symposium on Architectures for networking and communications systems, 2015

2014
The Variable-Increment Counting Bloom Filter.
IEEE/ACM Trans. Netw., 2014

The Switch Reordering Contagion: Preventing a Few Late Packets from Ruining the Whole Party.
IEEE Trans. Computers, 2014

Compressing Forwarding Tables for Datacenter Scalability.
IEEE J. Sel. Areas Commun., 2014

SAX-PAC (Scalable And eXpressive PAcket Classification).
Proceedings of the ACM SIGCOMM 2014 Conference, 2014

Weighted periodic scheduling of a shared resource.
Proceedings of the IEEE 15th International Conference on High Performance Switching and Routing, 2014

The Buffer Size vs Link Bandwidth Tradeoff in Lossless Networks.
Proceedings of the 22nd IEEE Annual Symposium on High-Performance Interconnects, 2014

2013
Exact Worst Case TCAM Rule Expansion.
IEEE Trans. Computers, 2013

Compression for fixed-width memories.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Compressing forwarding tables.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

On finding an optimal TCAM encoding scheme for packet classification.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Minimizing Delay in Shared Pipelines.
Proceedings of the IEEE 21st Annual Symposium on High-Performance Interconnects, 2013

2012
Probabilistic performance of write-once memory with Linear Wom codes - Analysis and insights.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2010
Statistical Approach to Networks-on-Chip.
IEEE Trans. Computers, 2010

On the code length of TCAM coding schemes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Worst-Case TCAM Rule Expansion.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2008
Statistical Approach to NoC Design.
Proceedings of the Second International Symposium on Networks-on-Chips, 2008


  Loading...