Low-latency partial resource offloading in cloud-edge elastic optical 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
In the context of the rapid deployment of IoT, 5G, and cloud computing, numerous emerging applications demand efficient networked computing capacity for task offloading from mobile and IoT users. This paper focuses on the optimization of network resource allocation and reduction of end-to-end (E2E) latency through the strategic decision of whether and where to offload user requests in a cloud-edge elastic optical network (CE-EON). To address this problem, we first formulate the problem into an integer linear programming (ILP) model as an initial solution. Additionally, we introduce several heuristic approaches that leverage the concept of partial resource offloading, specifically based on proportional segmentation (PRO_PS), partial resource offloading based on average segmentation (PRO_AS), all resource offloading (ARO), and all local processing (ALP). Furthermore, we implement a collaborative cloud-edge (CCE) offloading approach as a baseline for comparison. Our results demonstrate that the PRO_PS approach closely approximates the optimal solutions obtained from the ILP model in static scenarios. Moreover, the PRO_PS approach achieves the lowest E2E latency, blocking probability, and optimized network resource allocation in dynamic scenarios. This highlights the effectiveness of the proposed approach in improving system performance and addressing the challenges of CE-EONs.
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.002 | 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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| 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