Lior Zeno

dblp:176/9173 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
4since 2021 · last 2026
0009-0006-6217-8973ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 5 · 4 first-author · 4 since 2021Systems, architecture and hardware · 2
YearPublicationVenuePosition
2026 In Link We Trust: BFT at the Speed of CFT using Switches
Lior Zeno, Naama Ben-David, Mark Silberstein
NSDI1
2025 Finding Global Top-K Flows in the Data Plane
Shir Landau Feibish, Eitan Stein, Lior Zeno
Networking3
2024 In-Network Address Caching for Virtual Networks
abstract
Packet routing in virtual networks requires virtual-to-physical address translation. The address mappings are updated by a single party, i.e., the network administrator, but they are read by multiple devices across the network when routing tenant packets. Existing approaches face an inherent read-write performance tradeoff: they either store these mappings in dedicated gateways for fast updates at the cost of slower forwarding or replicate them at end-hosts and suffer from slow updates.
Lior Zeno, Ang Chen 0001, Mark Silberstein
SIGCOMM1
2022 SwiSh: Distributed Shared State Abstractions for Programmable Switches
Lior Zeno, Dan R. K. Ports, Jacob Nelson 0001, Daehyeok Kim, Shir Landau Feibish, Idit Keidar, Arik Rinberg, Alon Rashelbach, Igor Lima de Paula, Mark Silberstein
NSDI1
2020 SwiShmem: Distributed Shared State Abstractions for Programmable Switches
abstract
Programmable switches provide an appealing platform for running network functions (NFs), such as NATs, firewalls, and DDoS detectors, entirely in data plane, at staggering multi-Tbps processing rates. However, to be used in real deployments with a complex multi-switch topology, one NF instance must be deployed on each switch, which together act as a single logical NF. This requirement poses significant challenges in particular for stateful NFs, due to the need to manage distributed shared NF state among the switches. While considered a solved problem in classical distributed systems, data-plane state sharing requires addressing several unique challenges: high data rate, limited switch memory, and packet loss.
Lior Zeno, Dan R. K. Ports, Jacob Nelson 0001, Mark Silberstein
HotNets1
2019 Design Patterns for Code Reuse in HLS Packet Processing Pipelines
abstract
High-level synthesis (HLS) allows developers to be more productive in designing FPGA circuits thanks to familiar programming languages and high-level abstractions. In order to create high-performance circuits, HLS tools, such as Xilinx Vivado HLS, require following specific design patterns and techniques. Unfortunately, when applied to network packet processing tasks, these techniques limit code reuse and modularity, requiring developers to use deprecated programming conventions. We propose a methodology for developing high-speed networking applications using Vivado HLS for C++, focusing on reusability, code simplicity, and overall performance. Following this methodology, we implement a class library (ntl) with several building blocks that can be used in a wide spectrum of networking applications. We evaluate the methodology by implementing two applications: a UDP stateless firewall and a key-value store cache designed for FPGA-based SmartNICs, both processing packets at 40Gbps line-rate.
Haggai Eran, Lior Zeno, Zsolt István, Mark Silberstein
FCCM2
2019 NICA: An Infrastructure for Inline Acceleration of Network Applications
Haggai Eran, Lior Zeno, Maroun Tork, Gabi Malka, Mark Silberstein
USENIX ATC2