Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
