Hierarchical Soft Slicing to Meet Multi-Dimensional QoS Demand in Cache-Enabled Vehicular 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
Vehicular networks are expected to support diverse content applications with multi-dimensional quality of service (QoS) requirements, which cannot be realized by the conventional one-fit-all network management method. In this paper, a service-oriented hierarchical soft slicing framework is proposed for the cache-enabled vehicular networks, where each slice supports one service and the resources are logically isolated but opportunistically reused to exploit the multiplexing gain. The performance of the proposed framework is studied in an analytical way considering two typical on-road content services, i.e., the time-critical driving related context information service (CIS) and the bandwidth-consuming infotainment service (IS). Two network slices are constructed to support the CIS and IS, respectively, where the resource is opportunistic reused at both intra- and inter-slice levels. Specifically, the throughput of the IS slice, the content freshness (i.e., age of information) and delay performances of the CIS slice are analyzed theoretically, whereby the multiplexing gain of soft slicing is obtained. Extensive simulations are conducted on the OMNeT++ and MATLAB platforms to validate the analytical results. Numerical results show that the proposed soft slicing method can enhance the IS throughput by 30% while guaranteeing the same level of CIS content freshness and service delay.
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.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.002 | 0.000 |
| 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 it