Joint Long-Term Cache Allocation and Short-Term Content Delivery in Green Cloud Small Cell Networks
Bibliographic record
Abstract
Recent years have witnessed an exponential growth of mobile data traffic, which may lead to a serious traffic burn on the wireless networks and considerable power consumption. Network densification and edge caching are effective approaches to addressing these challenges. In this study, we investigate joint long-term cache allocation and short-term content delivery in cloud small cell networks (C-SCNs), where multiple smallcell BSs (SBSs) are connected to the central processor via fronthaul and can store popular contents so as to reduce the duplicated transmissions in networks. Accordingly, a long-term power minimization problem is formulated by jointly optimizing multicast beamforming, BS clustering, and cache allocation under quality of service (QoS) and storage constraints. The resultant mixed timescale design problem is an anticausal problem because the optimal cache allocation depends on the future file requests. To handle it, a two-stage optimization scheme is proposed by utilizing historical knowledge of users' requests and channel state information. Specifically, the online content delivery design is tackled with a penalty-based approach, and the periodic cache updating is optimized with a distributed alternating method. Simulation results indicate that the proposed scheme significantly outperforms conventional schemes and performs extremely close to a genie-aided lower bound in the low caching region.
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 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.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.000 | 0.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".