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

Vahab Jabrayilov

dblp:377/6693 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2026
0000-0001-9182-3085ORCID · corroborated

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

Systems, architecture and hardware · 3 · 3 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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 architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 61% Cloud and datacenter computing · 39%
Computer networks
1 paper
Internet architecture and protocols · 100%

Topics — the 9 heaviest of 10, 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
Distributed systems
consensus
0.912025
HoliPaxos: Towards More Predictable Performance in State Machine Replication · Proc. VLDB Endow. 2025
Distributed systems › fault tolerance
failure detection
0.912025
HoliPaxos: Towards More Predictable Performance in State Machine Replication · Proc. VLDB Endow. 2025
Distributed systems
fault tolerance
0.912025
HoliPaxos: Towards More Predictable Performance in State Machine Replication · Proc. VLDB Endow. 2025
Distributed systems › consensus › paxos
paxos-based replication
0.912025
HoliPaxos: Towards More Predictable Performance in State Machine Replication · Proc. VLDB Endow. 2025
Distributed systems › replication
state machine replication
0.912025
HoliPaxos: Towards More Predictable Performance in State Machine Replication · Proc. VLDB Endow. 2025

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

userspace networking · 2.0microkernel architecture · 2.0log pruning · 0.9failure detector integration · 0.9
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)2
2025 Practical Considerations for Implementing State Machine Replication in the Cloud
abstract
State Machine Replication (SMR) protocols form the backbone of many distributed systems. Enterprises and startups increasingly build their distributed systems on the cloud due to its many advantages, such as scalability and cost-effectiveness. Due to their prevalence in systems, the practical aspects of SMR algorithms, such as efficiency and performance, become hugely important. These practical considerations can impact capacity planning, deployment strategies, and, ultimately, the cost of running stateful systems in the cloud. In this paper, we consider various practical choices that impact the performance and efficiency of state machine replication in the cloud. To that order, we design a language-agnostic Multi-Paxos-based state machine architecture and implement it in several languages popular for cloud deployment. In the process, we investigate the impact of threading, communication, and memory management models on replicated state machines’ performance and resource efficiency. We also examine the high-level implications of virtualization on the performance of SMR implementations in various languages. We present our findings as a collection of practical lessons backed by our experimental data and analysis.
Zhiying Liang, Vahab Jabrayilov, Abutalib Aghayev, Aleksey Charapko
ICDCS2
2025 HoliPaxos: Towards More Predictable Performance in State Machine Replication
abstract
State machine replication (SMR) algorithms ensure redundancy in critical systems and, as a result, underpin fault-tolerant distributed databases. Good SMR protocol performance is essential for capacity planning and meeting desired performance objectives. However, many implementations of popular SMR algorithms, such as MultiPaxos and Raft, have issues that make their performance unpredictable. This unpredictability often arises from certain "bolt-on" additions to core protocols, such as external failure detectors and replication log compaction. In this paper, we argue that tighter integration of such traditionally ad-hoc mechanisms with the core replication protocols can stabilize performance, making the solutions more reliable and more accessible to accurate capacity planning. Moreover, we show that these integrations can be non-disruptive for the underlying consensus algorithm, resulting in systems that preserve the simplicity and safety of traditional single-leader consensus-based SMR. To that order, we integrate the failure and slowdown detectors inside the SMR and achieve better performance and faster fail-over under various network partitions and node slowdown events. We also illustrate that tight integration of replication log management, pruning, and snapshotting can reduce memory and CPU usage while avoiding performance fluctuations associated with traditional log compaction and cleanup approaches.
Zhiying Liang, Vahab Jabrayilov, Abutalib Aghayev, Aleksey Charapko
Proc. VLDB Endow.2
2024 Rethinking the Networking Stack for Serverless Environments: A Sidecar Approach
abstract
Serverless platforms rely on legacy networking stacks for communication and data movement. We quantitatively analyze the performance of these stacks and show their mismatch with highly consolidated, virtualized modern serverless environments, focusing on Firecracker, the most common serverless virtualization framework. As serverless applications grow in complexity and interaction, the resulting network bottleneck is a prime source of user-perceived, end-to-end latency. In this paper, we present a detailed vision of a new, sidecar-based networking stack for serverless environments. Our primary design goal is to provide low-overhead networking while maintaining existing security guarantees. We outline the research challenges in both the control and the data plane that the community needs to tackle before such a sidecar architecture can be used in practice.
Vishwanath Seshagiri, Vahab Jabrayilov, Avani Wildani, Kostis Kaffes
SoCC3