MétaCan
Menu
Back to cohort

eBPF-Driven ATS Scheduler: An Advanced Stream Processing Approach for Industry 5.0

2025· article· W7139130731 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicNetwork Time Synchronization Technologies
Canadian institutionsUniversité du Québec à Trois-Rivières
Fundersnot available
KeywordsScheduling (production processes)Asynchronous communicationSoftwareNetwork packetDataflowQueueing theoryFilter (signal processing)Queue

Abstract

fetched live from OpenAlex

In this paper, we present a programmable data plane design that implements IEEE 802.1Qcr’s Asynchronous Traffic Shaper (ATS) purely in software using Extended Berkeley Packet Filter (eBPF), eliminating specialized hardware requirements for industrial Time-Sensitive Networking (TSN) deployments. Unlike hardware-bound TSN solutions, our approach dynamically decouples and reprograms functions like filtering, metering, and queuing through in-kernel eBPF hooks, enabling adaptive priority management for concurrent streams within shared priority queues. The design explicitly models the ATS scheduler to parameterize per-stream eligibility times in TSN bridges while maintaining deterministic operation. This software-defined method provides a vendor-agnostic path for integrating ATS capabilities into existing industrial networks, particularly for Industry 5.0’s distributed control scenarios requiring flexible traffic multiplexing. The results confirm correct enforcement of ATS scheduling semantics under heterogeneous workloads.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.934
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

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

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.019
GPT teacher head0.290
Teacher spread0.271 · 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