Robust Task Offloading and Resource Allocation in Mobile Edge Computing With Uncertain Distribution of Computation Burden
Bibliographic record
Abstract
In mobile edge computing (MEC) supporting multiple mobile users (MUs), it is essential to optimize the offloading policy and communication and computation resource allocation. A main challenge is that the computation burden of a computation task may be random and even with uncertain probabilistic distribution. To address this challenge, we investigate a multiple-MU MEC system with random computation burden. For the random computation burden of an MU, only the mean and variance are known, but its distribution is unknown. Robustness is provided such that computation outage probabilities (due to uncertain distribution of computation burden) are bounded by a predefined threshold. We minimize the weighted sum of the MUs’ energy consumption. The formulated optimization problem is non-deterministic and non-convex, and thus, is hard to solve. To deal with the challenge, we transform the formulated problem into a deterministic and convex problem by applying the Chebyshev-Cantelli inequality and some mathematical manipulations. We further decompose the convex problem to a lower-level and an upper-level problem. Low-complexity algorithms are developed for the lower-level and upper-level problems. The overall complexity of our proposed method is linear with the number of MUs.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.001 | 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".