Benny Rubin

dblp:356/8121 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
0009-0004-6404-2522ORCID · corroborated

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

Computer networks · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Network management and operations · 46% Software-defined and programmable networks · 46% Cellular and mobile networks · 7%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 67% Electronic design automation · 33%

Topics — the 6 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test › fault diagnosis
fault isolation
0.812024
Fast & Safe IO Memory Protection · SOSP 2024
Memory systems › memory management › memory management unit
IOMMU
0.812024
Fast & Safe IO Memory Protection · SOSP 2024
Memory systems
memory protection
0.812024
Fast & Safe IO Memory Protection · SOSP 2024
Network management and operations
network verification
0.712023
Hydra: Effective Runtime Network Verification · SIGCOMM 2023
Software-defined and programmable networks › programmable data plane
p4
0.712023
Hydra: Effective Runtime Network Verification · SIGCOMM 2023
Software-defined and programmable networks
programmable data plane
0.712023
Hydra: Effective Runtime Network Verification · SIGCOMM 2023

Methods — techniques the papers use, named apart from their topics

IOTLB caching · 0.8runtime verification · 0.7domain-specific language · 0.7
YearPublicationVenuePosition
2024 Fast & Safe IO Memory Protection
abstract
IO Memory protection mechanisms prevent malicious and/or buggy IO devices from executing errant transfers into memory. Modern servers achieve this using an IOMMU---IO devices operate on virtual addresses, and IOMMU translates virtual addresses to physical addresses (potentially speeding up translations using a cache called IOTLB) before executing memory transfers. Despite their importance, design of memory protection mechanisms that can provide strong safety properties while achieving high performance has remained elusive. Indeed, recent studies from production datacenters demonstrate that inefficiencies within state-of-the-art memory protection mechanisms result in significant throughput degradation, orders-of-magnitude tail latency inflation, and violation of isolation guarantees.
Benny Rubin, Saksham Agarwal, Qizhe Cai, Rachit Agarwal 0001
SOSP1
2023 Hydra: Effective Runtime Network Verification
abstract
It is notoriously difficult to verify that a network is behaving as intended, especially at scale. This paper presents Hydra, a system that uses ideas from runtime verification to check that every packet is correctly processed with respect to a specification in real time. We propose a domain-specific language for writing properties, called Indus, and we develop a compiler that turns properties thus specified into executable P4 code that runs alongside the forwarding code at line rate. To evaluate our approach, we used Indus to model a range of properties, showing that it is expressive enough to capture examples studied in prior work. We also deployed Hydra checkers for validating paths in source routing and for enforcing slice isolation in Aether, an open-source cellular platform. We confirmed a subtle bug in Aether's 5G mobile core that would have been hard to detect using static techniques. We also evaluated the overheads of Hydra on hardware, finding that it does not significantly increase latency and often does not require additional pipeline stages.
Sundararajan Renganathan, Benny Rubin, Hyojoon Kim, Pier Luigi Ventre, Carmelo Cascone, Daniele Moro, Charles Chan, Nick McKeown, Nate Foster
SIGCOMM2