MétaCan
Menu
Back to cohort

Fail-Forward IIoT Routing via eBPF Packet Filters + Go Runtime

2025· preprint· W4416776321 on OpenAlexaff
Michael C. Chen, Daniel Hughes

Bibliographic record

VenuePreprints.org · 2025
Typepreprint
Language
FieldComputer Science
TopicSoftware-Defined Networks and 5G
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsNetwork packetRouting (electronic design automation)Packet lossInterruptSimple (philosophy)Enhanced Data Rates for GSM EvolutionFactory (object-oriented programming)Field (mathematics)Packet switching

Abstract

fetched live from OpenAlex

Fast fault handling is important for industrial IoT networks because short link breaks can interrupt sensors, robots, and shop-floor control. This work adds eBPF packet filters to a Go runtime so that routing can change on the device when a link fails. We tested several failure cases with mixed traffic. The setup switched routes in about 9.4 ms, while an SDN controller needed 22.8 ms. Packet loss during short breaks fell by 38%, and control traffic dropped by 27%. The design also lets users load simple rule updates to fit different field protocols without changing main code. These results show that placing fast reaction logic on edge devices can improve service stability in factory networks. The method fits small and mid-size systems, though wider field trials and long-term checks are still needed.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.019

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.000
Science and technology studies0.0010.001
Scholarly communication0.0020.002
Open science0.0020.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0060.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.079
GPT teacher head0.318
Teacher spread0.240 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venuePreprints.orgSame topicSoftware-Defined Networks and 5GFrench-language works237,207