Papers › Lightweight Implementation of Per-packet Service Protection in eBPF/XDP
Lightweight Implementation of Per-packet Service Protection in eBPF/XDP
Ferenc Fejes, Ferenc Orosi, Balázs Varga, János Farkas
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Deterministic communication means reliable packet forwarding with close to zero packet loss and bounded latency. Packet loss or delay above a threshold caused by, e.g., equipment failure or malfunction could be catastrophic for applications that require deterministic communication. To meet loss related targets, per-packet service protection has been introduced by deterministic communications standards; it is provided by Frame Replication and Elimination for Reliability (FRER) for Layer 2 Ethernet networks and by Packet Replication, Elimination, and Ordering Functions (PREOF) for Layer 3 IP/MPLS networks. We have implemented FRER with two conceptually different methods: (1) in eBPF/XDP as a lightweight software implementation; and (2) in userspace. We evaluate our XDP FRER via an experimental analysis and compare the two FRER implementations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections