Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Farbod Shahinfar

dblp:308/2450 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
5since 2021 · last 2026
0000-0002-5784-4592ORCID · corroborated

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

Computer networks · 3 · 2 first-author · 3 since 2021Software engineering, systems software and programming languages · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 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
3 papers
Software-defined and programmable networks · 50% Internet architecture and protocols · 32% Datacenter networks · 18%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › network architecture design › layered architecture › protocol layering
network stack
1.012026
Enabling Fast Networking in the Public Cloud · ASPLOS (2) 2026
Cloud and datacenter computing
cloud networking
1.012026
Enabling Fast Networking in the Public Cloud · ASPLOS (2) 2026
Cloud and datacenter computing
userspace networking
1.012026
Enabling Fast Networking in the Public Cloud · ASPLOS (2) 2026
Cloud and datacenter computing › virtualization
virtual machine networking
1.012026
Enabling Fast Networking in the Public Cloud · ASPLOS (2) 2026
Datacenter networks
lossless network
0.612022
Backdraft: a Lossless Virtual Switch that Prevents the Slow Receiver Problem · NSDI 2022
Software-defined and programmable networks › software switch
virtual switch
0.612022
Backdraft: a Lossless Virtual Switch that Prevents the Slow Receiver Problem · NSDI 2022
Software-defined and programmable networks
programmable data plane
0.512021
The case for network functions decomposition · CoNEXT 2021

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

userspace networking · 2.0microkernel architecture · 2.0eBPF · 0.5
YearPublicationVenuePosition
2026 Enabling Fast Networking in the Public Cloud
abstract
Despite a decade of research, most high-performance userspace network stacks remain impractical for public cloud tenants developing their applications atop Virtual Machines (VMs). We identify two root causes: (1) reliance on specialized NIC features (e.g., flow steering, deep buffers) absent in commodity cloud vNICs, and (2) rigid execution models ill-suited to diverse application needs. We present Machnet, a highperformance and flexible userspace network stack designed for public cloud VMs. Machnet uses only a minimal set of vNIC features that any major cloud provider supports. It also relies on a microkernel architecture to enable flexible application execution. We evaluate Machnet across three major public clouds and on production-grade applications, including a key-value store, an HTTP server, and a statemachine replication system. We release Machnet at https: //github.com/microsoft/machnet.
Alireza Sanaee, Vahab Jabrayilov, Ilias Marinos, Farbod Shahinfar, Divyanshu Saxena, Gianni Antichi, Kostis Kaffes
ASPLOS (2)4
2026 Don't Stall Me Now: Hiding Memory Latency in eBPF
abstract
eBPF has emerged as a popular platform for building high-performance I/O programs. However, eBPF's programming model limits the use of commonly used performance optimizations, leaving programs vulnerable to cache-miss-induced performance overheads. Specifically, the programming model restricts the choice of data structures used by a program, thus limiting the programmers' ability to improve data locality. Furthermore, it also makes it hard for programmers to overlap computation with data movement.
Farbod Shahinfar, Marco Molè, Aurojit Panda, Gianni Antichi
SIGCOMM1
2023 Automatic Kernel Offload Using BPF
abstract
BPF support in Linux has made kernel extensions easier. Recent efforts have shown that using BPF to offload portions of server applications, e.g., memcached and service proxies, can improve application performance and efficiency. However, thus far, the community has not looked at the question of what parts of an application should be offloaded? This paper first shows that blindly offloading application functionality to the kernel is neither beneficial nor desirable, and care must be taken when deciding what to offload. Furthermore, when deciding what to offload, developers must consider not just the application, but also the workload being handled, and the kernel being targetted, Therefore, we advocate automating this decision process in a compiler, that can analyze application code, and produce two executables, a kernel offload and a userspace program, that jointly implement the application's functionality. This paper discusses the challenges that must be addressed to build such a compiler, and why they can be feasibly addressed.
Farbod Shahinfar, Sebastiano Miano, Giuseppe Siracusano, Roberto Bifulco, Aurojit Panda, Gianni Antichi
HotOS1
2022 Backdraft: a Lossless Virtual Switch that Prevents the Slow Receiver Problem
Alireza Sanaee, Farbod Shahinfar, Gianni Antichi, Brent E. Stephens
NSDI2
2021 The case for network functions decomposition
abstract
This paper makes a case for writing unrestricted eBPF network functions which then get automatically decomposed between kernel and user-space.
Farbod Shahinfar, Sebastiano Miano, Alireza Sanaee, Giuseppe Siracusano, Roberto Bifulco, Gianni Antichi
CoNEXT1