Resource reservation in backhaul and radio access network with uncertain user demands

作     者：Reyhanian, Navid Farmanbar, Hamid Luo, Zhi-Quan 

作者机构：Department of Electrical and Computer Engineering University of Minnesota MinneapolisMN55455 United States Huawei Canada Research Center Ottawa Canada Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen China 

出 版 物：《arXiv》 (arXiv)

年 卷 期：2021年

核心收录：

主　　题：Optimization 

摘      要：Resource reservation is an essential step to enable wireless data networks to support a wide range of user demands. In this paper, we consider the problem of joint resource reservation in the backhaul and Radio Access Network (RAN) based on the statistics of user demands and channel states, and also network availability. The goal is to maximize the sum of expected traffic flow rates, subject to link and access point budget constraints, while minimizing the expected outage of downlinks. The formulated problem turns out to be non-convex and difficult to solve to global optimality. We propose an efficient Block Coordinate Descent (BCD) algorithm to approximately solve the problem. The proposed BCD algorithm optimizes the link capacity reservation in the backhaul using a novel multi-path routing algorithm that decomposes the problem down to link-level and parallelizes the computation across backhaul links, while the reservation of transmission resources in RAN is carried out via a novel scalable and distributed algorithm based on Block Successive Upper-bound Minimization (BSUM). We prove that the proposed BCD algorithm converges to a Karush–Kuhn–Tucker (KKT) solution. Simulation results verify the efficiency and the efficacy of our BCD approach against two heuristic algorithms. © 2021, CC BY.