Resource Reservation in Backhaul and Radio Access Network with Uncertain User Demands

摘要

We consider the problem of joint resource reservation in the backhaul and Radio Access Network (RAN) based on the user demand statistics and network availability. The goal is to maximize the sum of expected traffic flow rates, subject to link and radio node budget constraints, while minimizing the expected outage of wireless channels. 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. To optimize with respect to each block of variables, a distributed decomposition approach is proposed. Simulation results verify the efficiency and the efficacy of our proposed approach against two heuristic algorithms.