Time aware cyclic queuing forwarding traffic scheduling algorithm considering reallocation and priority sorting (RPS-TACQF).

Yuanxun Shen, Xinjie Chen, Xuelian Ma

Abstract read

In one paragraph

Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it

0cells of the map it votes in

0citing papers in PubMed

–field-weighted citation impact

1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Yuanxun ShenSchool of Computer and Communication Engineering, Northeastern University, Qinghuangdao, 066004, Hebei, China. ShenYuanxun2018@126.com.

Xinjie ChenSchool of Computer and Communication Engineering, Northeastern University, Qinghuangdao, 066004, Hebei, China.

Xuelian MaSchool of Computer and Communication Engineering, Northeastern University, Qinghuangdao, 066004, Hebei, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

To meet the mixed traffic scheduling requirements of time-triggered (TT) streams and audio video bridging (AVB) streams in the industrial Internet, this paper proposes a time aware cyclic queuing forwarding traffic scheduling algorithm considering reallocation and priority sorting (RPS-TACQF) method. Combining time aware shaper (TAS) and cyclic queuing and forwarding (CQF) mechanisms, it dynamically adjusts the queue resource allocation and traffic forwarding order, and uses the dead time of CQF odd and even queue switching to schedule TAS, optimize the frame injection time slot and routing, while meeting their respective end-to-end delay and jitter requirements. The experimental results show that the RPS-TACQF algorithm significantly improves the scheduling success rate in scenarios with 50 TT data streams and 100-1000 AVB data streams, especially under high load conditions, where the scheduling success rate of AVB data streams is about 36.5% higher than other algorithms; The bandwidth utilization rate increased by about 36.5% under high load, and the algorithm execution time still saved about 31.4% compared to the TAMCQF-ILP solver algorithm under high load networks.

Indexed as

Circular queuing forwardingIndustrial InternetMixed traffic schedulingPriority schedulingScheduling success rateTime aware shaper

Identifiers

PMID41932977

DOI10.1038/s41598-026-45136-6

PMCPMC13199525

What OpenQuestion holds

Textmetadata

LicenceCC BY-NC-ND

Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.