Skip to main navigation Skip to search Skip to main content

Chance-Constrained Task Offloading for Reliability Guarantees in Multi-Tenant Networks

  • L2S, CNRS, Univ Paris-Sud
  • Telecom Sudparis

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We study the problem of task offloading under stochastic delays with reliability guarantees. We introduce the Chance-Constrained Multi-Armed Bandit (CCMAB) framework, where each tenant selects a server to minimize cost while ensuring its experienced delay satisfies a probabilistic latency constraint. We propose the Optimal Chance-Constrained (O2C) algorithm, which learns delay distributions and adapts allocation to meet chance constraints with high probability. We establish its admissibility and derive logarithmic regret bounds, proving strong performance guarantees. Experiments on multi-tenant offloading scenarios show that O2C achieves both reliability guarantees and low cost.

Original languageEnglish
Title of host publicationICC 2026 - IEEE International Conference on Communications, Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9798319542090
DOIs
Publication statusPublished - 1 Jan 2026
Event2026 IEEE International Conference on Communications, ICC 2026 - Glasgow, United Kingdom
Duration: 24 May 2026 → 28 May 2026

Publication series

NameIEEE International Conference on Communications
ISSN (Print)1550-3607

Conference

Conference2026 IEEE International Conference on Communications, ICC 2026
Country/TerritoryUnited Kingdom
CityGlasgow
Period24/05/26 → 28/05/26

Keywords

  • Chance constraints
  • Multiarmed bandits
  • Task offloading

Fingerprint

Dive into the research topics of 'Chance-Constrained Task Offloading for Reliability Guarantees in Multi-Tenant Networks'. Together they form a unique fingerprint.

Cite this