Gil Einziger

CoRR, 2024

Beyond matchings: Dynamic multi-hop topology for demand-aware datacenters.

[BibT_eX]

[DOI]

Chen Griner

Chen Avin

Comput. Networks, 2024

Accelerating Federated Learning with Quick Distributed Mean Estimation.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023

High Throughput VMs Placement With Constrained Communication Overhead and Provable Guarantees.

[BibT_eX]

[DOI]

IEEE Trans. Netw. Serv. Manag., September, 2023

Go-to-Controller is Better: Efficient and Optimal LPM Caching with Splicing.

[BibT_eX]

[DOI]

Proc. ACM Meas. Anal. Comput. Syst., March, 2023

Boosting Cache Performance by Access Time Measurements.

[BibT_eX]

[DOI]

Omri Himelbrand

ACM Trans. Storage, February, 2023

Virtual Service Embedding With Time-Varying Load and Provable Guarantees.

[BibT_eX]

[DOI]

IEEE Trans. Cloud Comput., 2023

Uncertainty Estimation based on Geometric Separation.

[BibT_eX]

[DOI]

CoRR, 2023

On Latency Awareness with Delayed Hits.

[BibT_eX]

[DOI]

Nadav Keren

Proceedings of the 16th ACM International Conference on Systems and Storage, 2023

Optimizing DNS Resolvers for High Loads.

[BibT_eX]

[DOI]

Itay Alayoff

Proceedings of the IFIP Networking Conference, 2023

Characterization and Prediction of QUIC's Performance Under Different Network Conditions.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2023

2022

Lightweight Robust Size Aware Cache Management.

[BibT_eX]

[DOI]

ACM Trans. Storage, 2022

False Negative Awareness in Indicator-Based Caching Systems.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2022

Memento: Making Sliding Windows Efficient for Heavy Hitters.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2022

SQUID: Faster Analytics via Sampled Quantiles Data-structure.

[BibT_eX]

[DOI]

CoRR, 2022

QUIC-FL: Quick Unbiased Compression for Federated Learning.

[BibT_eX]

[DOI]

CoRR, 2022

Parallel Virtual Machines Placement with Provable Guarantees.

[BibT_eX]

[DOI]

CoRR, 2022

Self-Adjusting Ego-Trees Topology for Reconfigurable Datacenter Networks.

[BibT_eX]

[DOI]

Chen Griner

Chen Avin

CoRR, 2022

A geometric method for improved uncertainty estimation in real-time.

[BibT_eX]

[DOI]

Proceedings of the Uncertainty in Artificial Intelligence, 2022

Botnet Mapping Based on Intersections of Traces.

[BibT_eX]

[DOI]

Erez Alfasi

Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022

Limited Associativity Makes Concurrent Software Caches a Breeze.

[BibT_eX]

[DOI]

Dolev Adas

Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022

2021

Access Strategies for Network Caching.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2021

Routing-Oblivious Network-Wide Measurements.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2021

Parallel VM Deployment with Provable Guarantees.

[BibT_eX]

[DOI]

Proceedings of the IFIP Networking Conference, 2021

Self-adjusting Advertisement of Cache Indicators with Bandwidth Constraints.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE Conference on Computer Communications, 2021

SALSA: Self-Adjusting Lean Streaming Analytics.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

On the Power of False Negative Awareness in Indicator-based Caching Systems.

[BibT_eX]

[DOI]

Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

2020

Designing Heavy-Hitter Detection Algorithms for Programmable Switches.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2020

Cost Effective Troubleshooting of NFV Infrastructure.

[BibT_eX]

[DOI]

Proceedings of the 2020 IFIP Networking Conference, 2020

Routing Oblivious Measurement Analytics.

[BibT_eX]

[DOI]

Proceedings of the 2020 IFIP Networking Conference, 2020

Poster Abstract: Parallel VM Placement with Provable Guarantees.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE Conference on Computer Communications, 2020

Near Optimal Network-wide Per-Flow Measurement.

[BibT_eX]

[DOI]

Bilal Tayh

Proceedings of the 39th IEEE Conference on Computer Communications, 2020

Faster and More Accurate Measurement through Additive-Error Counters.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE Conference on Computer Communications, 2020

Cooperative Network-wide Flow Selection.

[BibT_eX]

[DOI]

Bilal Tayh

Proceedings of the 28th IEEE International Conference on Network Protocols, 2020

A faster and more efficient <i>q</i>-MAX algorithm.

[BibT_eX]

[DOI]

Bilal Tayh

Proceedings of the CoNEXT '20: The 16th International Conference on emerging Networking EXperiments and Technologies, 2020

2019

Reducing Service Deployment Cost Through VNF Sharing.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2019

Randomized Admission Policy for Efficient Top-k, Frequency, and Volume Estimation.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2019

Give me some slack: Efficient network measurements.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

I Know What You Did Last Summer: Network Monitoring using Interval Queries.

[BibT_eX]

[DOI]

Proc. ACM Meas. Anal. Comput. Syst., 2019

Succinct Summing over Sliding Windows.

[BibT_eX]

[DOI]

Algorithmica, 2019

Counting With Tinytable: Every Bit Counts!

[BibT_eX]

[DOI]

IEEE Access, 2019

Detecting traffic anomalies with adaptive sampling.

[BibT_eX]

[DOI]

Proceedings of the 12th ACM International Conference on Systems and Storage, 2019

Nitrosketch: robust and general sketch-based monitoring in software switches.

[BibT_eX]

[DOI]

Proceedings of the ACM Special Interest Group on Data Communication, 2019

Attack Time Localization using Interval Queries.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGCOMM 2019 Conference Posters and Demos, 2019

A Black-box Method for Accelerating Measurement Algorithms with Accuracy Guarantees.

[BibT_eX]

[DOI]

Proceedings of the 2019 IFIP Networking Conference, 2019

Faster Placement of Virtual Machines through Adaptive Caching.

[BibT_eX]

[DOI]

Maayan Goldstein

Yaniv Sa'ar

Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

q-MAX: A Unified Way to Improve Network Measurement Throughput.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2019, 2019

q-MAX: A Unified Scheme for Improving Network Measurement Throughput.

[BibT_eX]

[DOI]

Proceedings of the Internet Measurement Conference, 2019

Verifying Robustness of Gradient Boosted Models.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

ICE Buckets: Improved Counter Estimation for Network Measurement.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2018

Scheduling Advertisement Delivery in Vehicular Networks.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2018

Fast flow volume estimation.

[BibT_eX]

[DOI]

Pervasive Mob. Comput., 2018

Space Efficient Elephant Flow Detection.

[BibT_eX]

[DOI]

Proceedings of the 11th ACM International Systems and Storage Conference, 2018

Adaptive Software Cache Management.

[BibT_eX]

[DOI]

Proceedings of the 19th International Middleware Conference, 2018

Volumetric Hierarchical Heavy Hitters.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Symposium on Modeling, 2018

Line speed heavy hitters on sliding windows.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2018, 2018

Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

Efficient Measurement on Programmable Switches Using Probabilistic Recirculation.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE 26th International Conference on Network Protocols, 2018

Brief Announcement: Give Me Some Slack: Efficient Network Measurements.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Network-wide routing-oblivious heavy hitters.

[BibT_eX]

[DOI]

Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems, 2018

2017

TinyLFU: A Highly Efficient Cache Admission Policy.

[BibT_eX]

[DOI]

Ben Manes

ACM Trans. Storage, 2017

TinySet - An Access Efficient Self Adjusting Bloom Filter Construction.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2017

Efficient Network Measurements through Approximated Windows.

[BibT_eX]

[DOI]

CoRR, 2017

Counting distinct elements over sliding windows.

[BibT_eX]

[DOI]

Proceedings of the 10th ACM International Systems and Storage Conference, 2017

Constant Time Updates in Hierarchical Heavy Hitters.

[BibT_eX]

[DOI]

Proceedings of the Conference of the ACM Special Interest Group on Data Communication, 2017

Poster abstract: A sliding counting bloom filter.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications Workshops, 2017

Optimal elephant flow detection.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Randomized admission policy for efficient top-k and frequency estimation.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Constant Time Weighted Frequency Estimation for Virtual Network Functionalities.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Computer Communication and Networks, 2017

TinyCache - An Effective Cache Admission Filter.

[BibT_eX]

[DOI]

Dolev Adas

Proceedings of the 2017 IEEE Global Communications Conference, 2017

2016

Shades: Expediting Kademlia's lookup process.

[BibT_eX]

[DOI]

Yoav Kantor

Comput. Networks, 2016

Efficient Summing over Sliding Windows.

[BibT_eX]

[DOI]

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Effective Selection of Targeted Advertisements for Vehicular Users.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM International Conference on Modeling, 2016

Heavy hitters in streams and sliding windows.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

2015

Approximate compact data structures and applications.

[BibT_eX]

[DOI]

PhD thesis, 2015

Independent counter estimation buckets.

[BibT_eX]

[DOI]

Benny Fellman

Yaron Kassner

Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

A formal analysis of conservative update based approximate counting.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computing, Networking and Communications, 2015

2014

Postman: An Elastic Highly Resilient Publish/Subscribe Framework for Self Sustained Service Independent P2P Networks.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

TinyLFU: A Highly Efficient Cache Admission Policy.

[BibT_eX]

[DOI]

Proceedings of the 22nd Euromicro International Conference on Parallel, 2014

2013

Kaleidoscope: Adding colors to Kademlia.

[BibT_eX]

[DOI]