Integration of Networking, Caching, and Computing in Wireless Systems: A Survey, Some Research Issues, and Challenges
Bibliographic record
Abstract
Since the recently emerging mobile applications have posed significant demands not only on high data rate but also on high caching and computing capabilities, the growth in communication capability alone is no longer sustainable for wireless networks. The integration of networking, caching, and computing functionalities into one system can provide not only native support for highly scalable and efficient content retrieval, but also powerful capability of data processing, hence reducing duplicate content transmissions and enabling swift executions of computationally intensive tasks. Despite the prospect of integrated networking, caching, and computing systems, a number of significant research challenges remain to be addressed prior to widespread deployment of integrated networking, caching, and computing systems, including latency requirement, interfaces, mobility management, resource and architecture tradeoffs, convergence, etc. In this paper, we provide a brief survey on some of the works that have been done to enable the integrated networking, caching, and computing system, and discuss several research challenges. We identify a number of important aspects of the integration of networking, caching, and computing: motivations, frameworks, performance metrics, enabling technologies, and challenges. At last, some broader perspectives are explored.
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.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.009 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.004 | 0.009 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".