Metraipolis › archive › dc_7efe9098b17f

Prediction-Robust Service Deployment with Capacity-Aware Edge Admission — arXiv:2609.00877

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.00877
License (as archived)
CC0-1.0
Archived
2026-10-17T06:41:58.490Z
SHA-256 of the archived text
e37dc7da15397d2300c8ff771fa0c53bc3fd9915e0062f7e7cc4a6a6662ac8a2
Stable URL of this page
https://metraipolis.com/documento/dc_7efe9098b17f

How to cite

Prediction-Robust Service Deployment with Capacity-Aware Edge Admission — arXiv:2609.00877 — arXiv (en), https://arxiv.org/abs/2609.00877 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7efe9098b17f (Metraipolis archive dc_7efe9098b17f, sha256 e37dc7da15397d2300c8ff771fa0c53bc3fd9915e0062f7e7cc4a6a6662ac8a2)
BibTeX
@misc{dc7efe9098b17f,
  title = {Prediction-Robust Service Deployment with Capacity-Aware Edge Admission — arXiv:2609.00877},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.00877},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7efe9098b17f; sha256 e37dc7da15397d2300c8ff771fa0c53bc3fd9915e0062f7e7cc4a6a6662ac8a2},
  year = {2026}
}

Archived text

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

Edge platforms instantiate executable services close to users to reduce request-serving cost, but each instance incurs a one-time deployment cost and remains useful only for a finite time-to-live (TTL). The resulting online decision is both prediction-sensitive and capacity-coupled: an optimistic forecast can waste deployment cost, whereas a delayed decision misses the burst it is intended to serve. We study this problem under a common TTL cost model and propose CAPSUM, a capacity-aware admission policy with an elastic specialization, CAPSUM-E. In the local elastic setting, every node-service trace is exactly a variable-price Bahncard instance. This reduction lets CAPSUM-E inherit PFSUM's tight prediction-error-dependent ratio, including $2/(1+\beta)$ consistency and $1/\beta$ robustness for $\beta>0$. A redirect-aware variant preserves the same local deployment schedule. For finite-capacity nodes, CAPSUM combines size-scaled break-even tests, a utilization-dependent shadow price, and evidence-density eviction; we prove capacity feasibility, scale invariance, and exact agreement with CAPSUM-E under an elastic configuration. We implement an exact local offline dynamic program and compare against direct common-model baselines and documented source-derived adapters for EDP-A, OREO, and uEDC-L. Experiments cover controlled prediction error, three synthetic demand regimes, a causal predictor on a public Globus Compute trace, and joint scaling to 1,024 nodes and 10,000 services. Under the common model, CAPSUM reduces normalized cost by 33.7-42.9% relative to the best source-derived adapter across the synthetic regimes and by 45.5% on the sampled trace.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-02 in cs.DC).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2609.00877 — 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-17T06:34:26.609Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).