Proxy ARP at XDP: Answering and Dropping ARP Before skb Allocation

Proxy ARP is usually implemented after the network stack has already paid for the packet: whether the logic lives in a kernel module or a userspace daemon, every ARP request has been received into an skb before anyone decides to answer, forward or discard it. An eBPF program attached at the XDP hook runs on the driver's receive buffer before any skb exists. Using BPF hash maps as binding tables and as sets, it can answer known requests in place with XDP_TX, drop unwanted ones with XDP_DROP, and pass only the remainder to the stack. This paper describes that design vendor-neutrally: the conventional implementations and their per-packet cost, the XDP datapath, the drop policy built from sets and maps, operational failure modes, and how to evaluate the result. It also states the main limit plainly: the skb saving requires native (driver-mode) XDP.

Authors

Publication Details

Journal
International Journal of Scientific Research and Modern Technology.
Published
2026-11-02
DOI
https://doi.org/10.38124/ijsrmt.v5i10.1737
Primary Topic
Network Packet Processing and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Proxy ARP at XDP: Answering and Dropping ARP Before skb Allocation

Anil Kumar Reddy, Azif Abdul Salam Kolisam beevi
International Journal of Scientific Research and Modern Technology.
Network Packet Processing and Optimization
article

Proxy ARP at XDP: Answering and Dropping ARP Before skb Allocation

Anil Kumar Reddy, Azif Abdul Salam Kolisam beevi
article en

Abstract

Proxy ARP is usually implemented after the network stack has already paid for the packet: whether the logic lives in a kernel module or a userspace daemon, every ARP request has been received into an skb before anyone decides to answer, forward or discard it. An eBPF program attached at the XDP hook runs on the driver's receive buffer before any skb exists. Using BPF hash maps as binding tables and as sets, it can answer known requests in place with XDP_TX, drop unwanted ones with XDP_DROP, and pass only the remainder to the stack. This paper describes that design vendor-neutrally: the conventional implementations and their per-packet cost, the XDP datapath, the drop policy built from sets and maps, operational failure modes, and how to evaluate the result. It also states the main limit plainly: the skb saving requires native (driver-mode) XDP.

International Journal of Scientific Research and Modern Technology.Vol. 5(10)
Openalex Percentile: Top 11%
Network Packet Processing and Optimization
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.

Laika access coming soon