Reliability-Optimized User Admission Control for URLLC Traffic: A Neural Contextual Bandit Approach

• URL: http://arxiv.org/abs/2401.03059v1
• Date: Fri, 5 Jan 2024 20:26:08 GMT
• Title: Reliability-Optimized User Admission Control for URLLC Traffic: A Neural Contextual Bandit Approach
• Authors: Omid Semiari, Hosein Nikopour, Shilpa Talwar
• Abstract summary: Ultra-reliable low-latency communication (URLLC) is the cornerstone for a broad range of emerging services in next-generation wireless networks. URLLC relies on the network's ability to proactively determine whether sufficient resources are available to support the URLLC traffic. New machine learning based method is proposed that builds on (deep) neural contextual bandits.
• Score: 4.958511942948984
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Ultra-reliable low-latency communication (URLLC) is the cornerstone for a broad range of emerging services in next-generation wireless networks. URLLC fundamentally relies on the network's ability to proactively determine whether sufficient resources are available to support the URLLC traffic, and thus, prevent so-called cell overloads. Nonetheless, achieving accurate quality-of-service (QoS) predictions for URLLC user equipment (UEs) and preventing cell overloads are very challenging tasks. This is due to dependency of the QoS metrics (latency and reliability) on traffic and channel statistics, users' mobility, and interdependent performance across UEs. In this paper, a new QoS-aware UE admission control approach is developed to proactively estimate QoS for URLLC UEs, prior to associating them with a cell, and accordingly, admit only a subset of UEs that do not lead to a cell overload. To this end, an optimization problem is formulated to find an efficient UE admission control policy, cognizant of UEs' QoS requirements and cell-level load dynamics. To solve this problem, a new machine learning based method is proposed that builds on (deep) neural contextual bandits, a suitable framework for dealing with nonlinear bandit problems. In fact, the UE admission controller is treated as a bandit agent that observes a set of network measurements (context) and makes admission control decisions based on context-dependent QoS (reward) predictions. The simulation results show that the proposed scheme can achieve near-optimal performance and yield substantial gains in terms of cell-level service reliability and efficient resource utilization.

Related papers

• Adaptive User-Centric Entanglement Routing in Quantum Data Networks [5.421492821020181]
  Distributed quantum computing (DQC) holds immense promise in harnessing the potential of quantum computing by interconnecting multiple small quantum computers (QCs) through a quantum data network (QDN) establishing long-distance quantum entanglement between two QCs for quantum teleportation within the QDN is a critical aspect, and it involves entanglement routing. Existing approaches have mainly focused on optimizing entanglement performance for current entanglement connection (EC) requests. We present a novel user-centric entanglement routing problem that spans an extended period to maximize entanglement success rate while adhering to the user's budget constraint.
  arXiv  Detail & Related papers  (2024-04-13T17:20:00Z)
• Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing [73.7522199491117]
  Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources. The fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. We propose a resource allocation model to provision quantum computing and networking resources.
  arXiv  Detail & Related papers  (2023-07-25T00:38:46Z)
• Guaranteed Dynamic Scheduling of Ultra-Reliable Low-Latency Traffic via Conformal Prediction [72.59079526765487]
  The dynamic scheduling of ultra-reliable and low-latency traffic (URLLC) in the uplink can significantly enhance the efficiency of coexisting services. The main challenge is posed by the uncertainty in the process of URLLC packet generation. We introduce a novel scheduler for URLLC packets that provides formal guarantees on reliability and latency irrespective of the quality of the URLLC traffic predictor.
  arXiv  Detail & Related papers  (2023-02-15T14:09:55Z)
• Device Selection for the Coexistence of URLLC and Distributed Learning Services [12.093278114651524]
  We investigate a mixed service scenario where distributed AI workflow and ultra-reliable low latency communication (URLLC) services run concurrently over a network. We propose a risk-based formulation for device selection to minimize the AI training delays during its convergence period. We transform it into a deep reinforcement learning problem and address it via a framework based on soft actor-critic algorithm.
  arXiv  Detail & Related papers  (2022-12-22T15:36:15Z)
• Age of Semantics in Cooperative Communications: To Expedite Simulation Towards Real via Offline Reinforcement Learning [53.18060442931179]
  We propose the age of semantics (AoS) for measuring semantics freshness of status updates in a cooperative relay communication system. We derive an online deep actor-critic (DAC) learning scheme under the on-policy temporal difference learning framework. We then put forward a novel offline DAC scheme, which estimates the optimal control policy from a previously collected dataset.
  arXiv  Detail & Related papers  (2022-09-19T11:55:28Z)
• Artificial Intelligence Empowered Multiple Access for Ultra Reliable and Low Latency THz Wireless Networks [76.89730672544216]
  Terahertz (THz) wireless networks are expected to catalyze the beyond fifth generation (B5G) era. To satisfy the ultra-reliability and low-latency demands of several B5G applications, novel mobility management approaches are required. This article presents a holistic MAC layer approach that enables intelligent user association and resource allocation, as well as flexible and adaptive mobility management.
  arXiv  Detail & Related papers  (2022-08-17T03:00:24Z)
• AI-aided Traffic Control Scheme for M2M Communications in the Internet of Vehicles [61.21359293642559]
  The dynamics of traffic and the heterogeneous requirements of different IoV applications are not considered in most existing studies. We consider a hybrid traffic control scheme and use proximal policy optimization (PPO) method to tackle it.
  arXiv  Detail & Related papers  (2022-03-05T10:54:05Z)
• Networked Online Learning for Control of Safety-Critical Resource-Constrained Systems based on Gaussian Processes [9.544146562919792]
  We propose a novel networked online learning approach based on Gaussian process regression. We propose an effective data transmission scheme between the local system and the cloud taking bandwidth limitations and time delay of the transmission channel into account.
  arXiv  Detail & Related papers  (2022-02-23T13:12:12Z)
• Deep Reinforcement Learning for Wireless Scheduling in Distributed Networked Control [56.77877237894372]
  This work considers a fully distributed WNCS with distributed plants, sensors, actuators and a controller, sharing a limited number of frequency channels. We formulate the optimal transmission scheduling problem into a decision process problem and develop a deep-reinforcement-learning algorithm for solving it.
  arXiv  Detail & Related papers  (2021-09-26T11:27:12Z)
• Quantized Federated Learning under Transmission Delay and Outage Constraints [30.892724364965005]
  Federated learning is a viable distributed learning paradigm which trains a machine learning model collaboratively with massive mobile devices in the wireless edge. In practical systems with limited radio resources, transmission of a large number of model parameters inevitably suffers from quantization errors (QE) and transmission outage (TO) We propose a robust FL scheme, named FedTOE, which performs joint allocation of wireless resources and quantization bits across the clients to minimize the QE while making the clients have the same TO probability.
  arXiv  Detail & Related papers  (2021-06-17T11:29:12Z)

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.