MétaCan
Menu
Back to cohort
Record W7015431277

Scheduling Real-time Traffic over Hybrid Channels

2024· dissertation· en· W7015431277 on OpenAlexaff

Bibliographic record

VenueQSpace (Queen's University Library) · 2024
Typedissertation
Languageen
FieldComputer Science
TopicAge of Information Optimization
Canadian institutionsQueen's University
Fundersnot available
KeywordsScheduling (production processes)Reinforcement learningMarkov decision processDynamic priority schedulingQueueWireless networkChannel (broadcasting)Round-robin scheduling
DOInot available

Abstract

fetched live from OpenAlex

The emergence of 5G networks has heightened the need for real-time traffic management to ensure timely throughput and meet strict deadlines, maintaining the relevance and effectiveness of transmitted data. Delayed information often loses its practical value, while steady and timely data flow is essential to support high-demand scenarios and meet modern expectations for low-latency, high-reliability communication. Hybrid channel models, combining high-speed but less reliable channels with slower, highly reliable ones, offer a promising approach to enhance network reliability. However, effectively balancing these channels under strict scheduling constraints remains a challenge, as does maintaining the freshness of transmitted data, often measured by the age-of-information (AoI). AoI prioritizes updates to keep data relevant for real-time decision-making, adding complexity to scheduling tasks. Reinforcement learning (RL) provides a powerful method to address these challenges. By learning from dynamic conditions, RL-based approaches can develop adaptive scheduling policies that meet deadlines, ensure steady throughput, and maintain data relevance. This work focuses on leveraging hybrid channels and RL to address the stringent requirements of modern wireless networks. The first study examines scheduling algorithms for deadline-constrained traffic over hybrid channels. Two cases are considered: with and without access to Channel State Information (CSI). For each, the User Selection First (USF) and Channel Selection First (CSF) algorithms are developed, stabilizing virtual queues and enhancing throughput under varying conditions. The second study addresses scheduling real-time traffic with general patterns, aiming to improve both AoI and timely throughput. Formulated as a Markov Decision Process (MDP), an RL-based algorithm, RL-ART, is introduced. Built on a Double Deep Q-Network (DDQN), RL-ART adapts scheduling decisions to network dynamics, achieving notable gains in AoI and timely throughput across diverse conditions. Extensive experiments demonstrate that USF and CSF effectively fulfill stringent throughput requirements, reduce packet-dropping rates, and stabilize virtual queues. RL-ART further enhances AoI and sustains high throughput under varying simulated scenarios, addressing key challenges in hybrid channel scheduling and aligning with the performance demands of 5G and future wireless networks.

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.004
GPT teacher head0.185
Teacher spread0.181 · 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
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueQSpace (Queen's University Library)Same topicAge of Information OptimizationFrench-language works237,207