Enhancing and Comparing Fast Reroute Algorithms with eBPF

We introduce a framework for comparing the performance of fast failover algorithms, with a particular focus on implementations using Extended Berkeley Packet Filter (eBPF) and eXpress Data Path within the Linux kernel. The study addresses the limitations of traditional failover methods, which often result in suboptimal routing and increased latency, by proposing an eBPF- and Netfilter-based solution that offers finer control and faster recovery from network failures.

Authors

Institutions

Publication Details

Published
2025-09-08
DOI
https://doi.org/10.1145/3744969.3748408
Primary Topic
Software-Defined Networks and 5G
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhancing and Comparing Fast Reroute Algorithms with eBPF

Stephanie Althoff, Klaus-Tycho Foerster, Marvin Weiler
1 links
Software-Defined Networks and 5G
article

Enhancing and Comparing Fast Reroute Algorithms with eBPF

Stephanie Althoff, Klaus-Tycho Foerster, Marvin Weiler
article en

Abstract

We introduce a framework for comparing the performance of fast failover algorithms, with a particular focus on implementations using Extended Berkeley Packet Filter (eBPF) and eXpress Data Path within the Linux kernel. The study addresses the limitations of traditional failover methods, which often result in suboptimal routing and increased latency, by proposing an eBPF- and Netfilter-based solution that offers finer control and faster recovery from network failures.

TU Dortmund University (DE)
Openalex Percentile: Top 72%
Software-Defined Networks and 5G
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.