Resource Reservation in Backhaul and Radio Access Network with Uncertain User Demands
Navid Reyhanian, Hamid Farmanbar, Zhi-Quan Luo

TL;DR
This paper addresses joint resource reservation in wireless networks by proposing an efficient algorithm that optimizes backhaul and RAN resource allocation based on demand and channel statistics, improving network performance.
Contribution
It introduces a novel BCD algorithm with multipath routing and BSUM-based distributed resource reservation for joint backhaul and RAN optimization.
Findings
The BCD algorithm converges to a KKT point.
Simulation shows the approach outperforms heuristic algorithms.
The method effectively manages uncertain user demands.
Abstract
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 multipath routing algorithm that decomposes the problem down to link-level and parallelizes the computation across…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced MIMO Systems Optimization · Advanced Wireless Network Optimization · Network Traffic and Congestion Control
