Joint user association and content placement for Cache-enabled wireless access 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
This paper considers the optimal placement of content in cache-enabled base-stations (BSs) for reducing backhaul traffic in a densely deployed wireless access network. By caching popular files, users requesting these files can be served directly by their associated BSs without needing to fetch content from the core network. This paper makes an observation that a real network consists of distinct classes of users with different file preferences, so jointly optimizing cache placement and user-BS association can result in significant benefit. This paper considers such a joint optimization problem for achieving an optimized tradeoff between load balancing and backhaul saving, while accounting for both the physical layer wireless propagation characteristics and the finite cache size at the BSs. By proposing a numerical algorithm that iteratively optimizes the content placement policy for fixed user-association and optimizes the user association policy for fixed content placement, with a goal of maximizing a backhaul-aware proportional fairness network utility, this paper shows that placing similar content at strategically located BSs can result in significant backhaul saving without sacrificing as much in user access rates.
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.001 |
| 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