Scheduling Real-time Traffic over Hybrid Channels
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.
Bibliographic record
Abstract
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.
Full frame distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.001 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.007 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it