Uplink Load Balancing over Multipath Heterogeneous Wireless Networks
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 rapidly growing traffic demand on mobile networks and the new services offered by service providers requires effective strategies for handling network resources. One such strategy is the ability of mobile devices to be attached to multiple radio nodes simultaneously. By this strategy the average data rate, that a mobile terminal can transmit/receive, increases and improves the reliability. This new strategy enables the use of dynamic load balancing among radio nodes, which in turn protects mobile networks from congestion caused by sudden load increase or poor channel conditions. Nevertheless load balancing requires techniques for efficiently splitting traffic without increasing the delay or causing packet reordering. In this paper we focus our study to the uplink load balancing case. We propose QBALAN, a new load balancing algorithm that uses two main strategies: long-term strategy splits traffic that remains on the system for long periods of time, and the short-term strategy splits traffic such that packet reordering is minimized. Numerical results show that our algorithm reduces the splitting error while reducing packet reordering.
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.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it