Service Placement in Small Cell Networks Using Distributed Best Arm Identification in Linear Bandits

• URL: http://arxiv.org/abs/2506.22480v1
• Date: Sun, 22 Jun 2025 12:45:01 GMT
• Title: Service Placement in Small Cell Networks Using Distributed Best Arm Identification in Linear Bandits
• Authors: Mariam Yahya, Aydin Sezgin, Setareh Maghsudi,
• Abstract summary: Small base stations (SBSs) serve as edge servers to enable low-latency service delivery.<n>limited edge capacity makes it challenging to decide which services to deploy locally versus in the cloud.<n>We propose a distributed and adaptive multi-agent best-arm identification (BAI) algorithm under a fixed-confidence setting.
• Score: 11.92409456846963
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As users in small cell networks increasingly rely on computation-intensive services, cloud-based access often results in high latency. Multi-access edge computing (MEC) mitigates this by bringing computational resources closer to end users, with small base stations (SBSs) serving as edge servers to enable low-latency service delivery. However, limited edge capacity makes it challenging to decide which services to deploy locally versus in the cloud, especially under unknown service demand and dynamic network conditions. To tackle this problem, we model service demand as a linear function of service attributes and formulate the service placement task as a linear bandit problem, where SBSs act as agents and services as arms. The goal is to identify the service that, when placed at the edge, offers the greatest reduction in total user delay compared to cloud deployment. We propose a distributed and adaptive multi-agent best-arm identification (BAI) algorithm under a fixed-confidence setting, where SBSs collaborate to accelerate learning. Simulations show that our algorithm identifies the optimal service with the desired confidence and achieves near-optimal speedup, as the number of learning rounds decreases proportionally with the number of SBSs. We also provide theoretical analysis of the algorithm's sample complexity and communication overhead.

Related papers

• Microservice Deployment in Space Computing Power Networks via Robust Reinforcement Learning [43.96374556275842]
  It is important to provide reliable real-time remote sensing inference services to meet the low-latency requirements.<n>This paper presents a remote sensing artificial intelligence applications deployment framework designed for Low Earth Orbit satellite constellations.
  arXiv  Detail & Related papers  (2025-01-08T16:55:04Z)
• SafeTail: Efficient Tail Latency Optimization in Edge Service Scheduling via Computational Redundancy Management [2.707215971599082]
  Emerging applications, such as augmented reality, require low-latency computing services with high reliability on user devices. We introduce SafeTail, a framework that meets both median and tail response time targets, with tail latency defined as latency beyond the 90th percentile threshold.
  arXiv  Detail & Related papers  (2024-08-30T10:17:37Z)
• Communication Efficient ConFederated Learning: An Event-Triggered SAGA Approach [67.27031215756121]
  Federated learning (FL) is a machine learning paradigm that targets model training without gathering the local data over various data sources. Standard FL, which employs a single server, can only support a limited number of users, leading to degraded learning capability. In this work, we consider a multi-server FL framework, referred to as emphConfederated Learning (CFL) in order to accommodate a larger number of users.
  arXiv  Detail & Related papers  (2024-02-28T03:27:10Z)
• On the Role of Server Momentum in Federated Learning [85.54616432098706]
  We propose a general framework for server momentum, that (a) covers a large class of momentum schemes that are unexplored in federated learning (FL) We provide rigorous convergence analysis for the proposed framework.
  arXiv  Detail & Related papers  (2023-12-19T23:56:49Z)
• QoS-Aware Service Prediction and Orchestration in Cloud-Network Integrated Beyond 5G [11.864695986880347]
  We present a non-linear programming model that formulates the optimization problem with the aiming objective of minimizing overall cost while enhancing latency. We introduce a DDQL-based technique using RNNs to predict user behavior, empowered by a water-filling-based algorithm for service placement.
  arXiv  Detail & Related papers  (2023-09-18T22:24:42Z)
• DeepScaler: Holistic Autoscaling for Microservices Based on Spatiotemporal GNN with Adaptive Graph Learning [4.128665560397244]
  This paper presents DeepScaler, a deep learning-based holistic autoscaling approach. It focuses on coping with service dependencies to optimize service-level agreements (SLA) assurance and cost efficiency. Experimental results demonstrate that our method implements a more effective autoscaling mechanism for microservice.
  arXiv  Detail & Related papers  (2023-09-02T08:22:21Z)
• Efficient Parallel Split Learning over Resource-constrained Wireless Edge Networks [44.37047471448793]
  In this paper, we advocate the integration of edge computing paradigm and parallel split learning (PSL) We propose an innovative PSL framework, namely, efficient parallel split learning (EPSL) to accelerate model training. We show that the proposed EPSL framework significantly decreases the training latency needed to achieve a target accuracy.
  arXiv  Detail & Related papers  (2023-03-26T16:09:48Z)
• Time-sensitive Learning for Heterogeneous Federated Edge Intelligence [52.83633954857744]
  We investigate real-time machine learning in a federated edge intelligence (FEI) system. FEI systems exhibit heterogenous communication and computational resource distribution. We propose a time-sensitive federated learning (TS-FL) framework to minimize the overall run-time for collaboratively training a shared ML model.
  arXiv  Detail & Related papers  (2023-01-26T08:13:22Z)
• BSAC-CoEx: Coexistence of URLLC and Distributed Learning Services via Device Selection [46.59702442756128]
  High-priority ultra-reliable low latency communication (URLLC) and low-priority distributed learning services run concurrently over a network.<n>We formulate this problem as a Markov decision process and address it via BSAC-CoEx, a framework based on the branching soft actor-critic (BSAC) algorithm.<n>Our solution can significantly decrease the training delays of the distributed learning service while keeping the URLLC availability above its required threshold.
  arXiv  Detail & Related papers  (2022-12-22T15:36:15Z)
• FIRE: A Failure-Adaptive Reinforcement Learning Framework for Edge Computing Migrations [52.85536740465277]
  FIRE is a framework that adapts to rare events by training a RL policy in an edge computing digital twin environment. We propose ImRE, an importance sampling-based Q-learning algorithm, which samples rare events proportionally to their impact on the value function. We show that FIRE reduces costs compared to vanilla RL and the greedy baseline in the event of failures.
  arXiv  Detail & Related papers  (2022-09-28T19:49:39Z)
• Receptive Field-based Segmentation for Distributed CNN Inference Acceleration in Collaborative Edge Computing [93.67044879636093]
  We study inference acceleration using distributed convolutional neural networks (CNNs) in collaborative edge computing network. We propose a novel collaborative edge computing using fused-layer parallelization to partition a CNN model into multiple blocks of convolutional layers.
  arXiv  Detail & Related papers  (2022-07-22T18:38:11Z)
• Hierarchical Quantized Federated Learning: Convergence Analysis and System Design [7.481427303081613]
  Federated learning is a collaborative machine to train deep neural networks without clients' private data. Previous works assume one central parameter either at the cloud or at the edge. This paper exploits the advantages of both cloud servers and considers Hierarchical Quantized Federated Learning system.
  arXiv  Detail & Related papers  (2021-03-26T05:48:36Z)
• Multi-Armed Bandit Based Client Scheduling for Federated Learning [91.91224642616882]
  federated learning (FL) features ubiquitous properties such as reduction of communication overhead and preserving data privacy. In each communication round of FL, the clients update local models based on their own data and upload their local updates via wireless channels. This work provides a multi-armed bandit-based framework for online client scheduling (CS) in FL without knowing wireless channel state information and statistical characteristics of clients.
  arXiv  Detail & Related papers  (2020-07-05T12:32:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.