Utility Maximization in Wireless Backhaul Networks with Service Guarantees

2026-01-04

arXiv.org

AI Summary

This work addresses the problem of utility maximization in wireless backhaul networks under stringent service-level agreement (SLA) constraints, including end-to-end delay and instantaneous throughput requirements. The network is modeled as a tree topology, and a novel pinwheel scheduling algorithm is proposed, substantially expanding the set of feasible schedules solvable in polynomial time. Building upon this, the authors jointly optimize admission control and link scheduling, devising a scalable distributed solution whose computational complexity grows linearly with the tree depth. Theoretical analysis demonstrates that round-robin scheduling is optimal for symmetric tree topologies, while the proposed method efficiently achieves utility maximization under SLA guarantees in general network configurations.

Technology Category

• Planning, Routing, and Scheduling: Scheduling under Uncertainty
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Search and Optimization: Distributed Search

Application Category

• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
• Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphs
• Systems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deployments

Abstract

We consider the problem of maximizing utility in wireless backhaul networks, where utility is a function of satisfied service level agreements (SLAs), defined in terms of end-to-end packet delays and instantaneous throughput. We model backhaul networks as a tree topology and show that SLAs can be satisfied by constructing link schedules with bounded inter-scheduling times, an NP-complete problem known as pinwheel scheduling. For symmetric tree topologies, we show that simple round-robin schedules can be optimal under certain conditions. In the general case, we develop a mixed-integer program that optimizes over the set of admission decisions and pinwheel schedules. We develop a novel pinwheel scheduling algorithm, which significantly expands the set of schedules that can be found in polynomial time over the state of the art. Using conditions from this algorithm, we develop a scalable, distributed approach to solve the utility-maximization problem, with complexity that is linear in the depth of the tree.

Problem

• utility maximization
• wireless backhaul networks
• service level agreements
• pinwheel scheduling
• end-to-end delay

Innovation

• pinwheel scheduling
• utility maximization
• wireless backhaul networks
• service level agreements
• distributed optimization