An Inertial Split Feasibility Framework for Bandwidth Allocation Problems in Communication Networks

In this paper, we study bandwidth allocation problems arising in communication networks, where multiple traffic flows compete for limited network resources under route-capacity and link-capacity constraints. The considered bandwidth allocation model incorporates flow-population structures together with route-capacity restrictions and network-link capacity constraints. The model is reformulated as a split feasibility problem in real Hilbert spaces. This reformulation enables the use of projection-type iterative techniques for generating feasible network allocations satisfying both local route constraints and global network-capacity constraints simultaneously. Motivated by this framework, we introduce a new inertial iterative algorithm for solving split feasibility problems associated with bandwidth allocation models. The proposed method incorporates inertial extrapolation into a projection-based iterative structure, and its strong convergence is established under suitable assumptions. Several direct consequences of the main theorem are also derived, including non-inertial and reduced feasibility frameworks. Finally, numerical examples and a communication-network application are presented to illustrate the numerical behavior and feasibility properties of the proposed iterative framework for bandwidth allocation problems involving multiple routes, shared communication links, and flow-population constraints.