Metraipolis › archive › dc_9ffd38ee2eab

Delay and Throughput Analysis of Computation Offloading in Mobile Edge Computing: A Queueing Network Approach — arXiv:2609.06021

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.06021
License (as archived): CC0-1.0
Archived: 2026-10-16T14:09:21.238Z
SHA-256 of the archived text: 5ef512fe829cbebbdd8ceca2ed9447a243ca5100403b66cc8a08c38ee69f1c06
Stable URL of this page: https://metraipolis.com/documento/dc_9ffd38ee2eab

How to cite

Delay and Throughput Analysis of Computation Offloading in Mobile Edge Computing: A Queueing Network Approach — arXiv:2609.06021 — arXiv (en), https://arxiv.org/abs/2609.06021 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9ffd38ee2eab (Metraipolis archive dc_9ffd38ee2eab, sha256 5ef512fe829cbebbdd8ceca2ed9447a243ca5100403b66cc8a08c38ee69f1c06)

BibTeX

@misc{dc9ffd38ee2eab,
  title = {Delay and Throughput Analysis of Computation Offloading in Mobile Edge Computing: A Queueing Network Approach — arXiv:2609.06021},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.06021},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9ffd38ee2eab; sha256 5ef512fe829cbebbdd8ceca2ed9447a243ca5100403b66cc8a08c38ee69f1c06},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06021. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Mobile edge computing (MEC) enables mobile devices to offload computation to nearby edge servers and to the cloud in order to reduce end-to-end delay for applications such as AR/VR, real-time inference, and sensor-driven analytics. In this paper, we study static computation offloading when each task consists of multiple dependent subtasks represented by a rooted directed tree. We develop a product-form queueing-network (PFQN) model with an approximation to capture the computation and communication dynamics of tree-structured task execution in a multi-tier MEC system. Based on this model, we derive closed-form expressions for effective server utilizations and waiting times, and then construct a recursive algorithm for evaluating the average delay of general tree-structured tasks. We formulate the static offloading design problem as the minimization of the rate-weighted average task delay over the routing probabilities, and solve it through a differentiable optimization framework based on softmax parameterization, log-sum-exp smoothing, and a stability barrier on server utilizations. Numerical results show that the proposed PFQN approximation provides accurate delay estimates and that the delay-optimized static policy consistently outperforms the considered baseline algorithms in terms of both average task delay and empirical maximum stable throughput.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-09 in cs.NI).
Categorie arXiv: Networking and Internet Architecture (cs.NI).
Pagina del lavoro: https://arxiv.org/abs/2609.06021 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T13:58:54.222Z dalla pagina https://arxiv.org/catchup/cs.NI/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).