Joint Minimization of Wired and Wireless Traffic for Content Delivery by Multicast Pushing
Bibliographic record
Abstract
As more mobile users become subscribers of content services, their subscribed content can be directly pushed from the content provider into the user equipment after the content is generated. In current and future network paradigms, a joint wired and wireless transmission design for this pushing is needed to guarantee the user experience without the extra deployment of communication infrastructures or consumption of resources. In this paper, we investigate a joint wired and wireless content delivery system that incorporates wired and wireless multicast. The users in the same group are served by wireless multicast from a base station (BS), while the BSs of the same content form a multicast tree in a backbone wired network. The sum of wired and wireless traffic is minimized by a joint design of user grouping, subchannel allocation, wired routing, and wired link usage. Exploiting the monotonicity of wired and wireless traffic with regard to the wired hop count, the original problem is converted for searching the optimal hop count vector that achieves the minimum sum of both types of traffic, which is solved by a monotonic optimization (MO)-based iterative algorithm. Compared with existing schemes and according to the numerical results, a reduction in total traffic of 43% can be achieved by our approach.
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.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.001 | 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 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".