Meta-DAMS: Delay-Aware Multipath Scheduler using Hybrid Meta Reinforcement Learning
Bibliographic record
Abstract
The deployment of multipath transport protocols in the mobile environment can enhance the performance of delay-sensitive applications by enabling the simultaneous use of several network paths, resulting in faster data transmission. However, due to the heterogeneity of network paths, packets may not arrive on time or in order, affecting the performance of delay-sensitive applications. Therefore, a well-designed multipath scheduler is important to distribute data packets efficiently to guarantee the per-packet delay requirement. In this paper, we propose Meta-DAMS, a delay-aware learning-based multipath scheduler, aiming to ensure that end-to-end delay is below a predefined threshold for delay-sensitive applications. We introduce a hybrid meta reinforcement learning (meta-RL) architecture for Meta-DAMS in which offline meta-RL and online meta-RL are used to learn the optimal scheduling policy quickly and accurately in response to highly dynamic network conditions. Based on trace-driven emulation experiments, we demonstrate that Meta-DAMS surpasses state-of-the-art MP schedulers, ensuring a delay of 50 ms or less for 98% of packets after sufficient operational episodes, compared to the 83% achieved by existing MP schedulers. Even in initial operational episodes, Meta-DAMS maintains its superiority, guaranteeing 94% of packets with a delay of 50 ms or less, while the performance of the DQN-based MPQUIC scheduler drops to 72%. Meta-DAMS exhibits nearly triple the efficiency in terms of runtime compared to the DQN-based MPQUIC scheduler across varying episode numbers.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".