Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 57 min ago
Peer-reviewedCC BY 4.0Mathematics

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

  • Atid Kangtunyakarn1
  • Araya Kheawborisut2
  • Kanchana Kumnungkit1
  1. 1Department of Mathematics, Faculty of Science, King Mongkut’s Institute of Technology Ladkrabang, Bangkok 10520, Thailand
  2. 2Department of Mathematics and Computer Science, Faculty of Science and Technology, Rajamangala University of Technology Thanyaburi, Pathumthani 12110, Thailand
Open at sourceDOICite

Abstract

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.

Related

  1. Latency-Aware Uplink NOMA-MEC with PASS: A Feasibility-First Resource Allocation Framework
    Sepehr Abolhasani, Saba Asaad, S. Mohammad Razavizadeh +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  2. Graph Neural Networks for Resource Allocation in Integrated Sensing and Communication
    Junyu Liao, Lili Chen, Tian Han +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  3. A Token/KV-Cache Communication Media Selection and Resource Allocation Strategy for Multi-Agent Collaboration
    Lipeng Dai, Luping Xiang, Kun Yang
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  4. TAVRUM: Feasibility-First Contract Matching for Fragmentation-Aware Resource Allocation in IoT–Fog Networks
    Deafallah Alsadie
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  5. CRB-Guided Sensing and Resource Allocation for Human Pose Prediction in Integrated Sensing, Communication, and Computation Systems
    Zhonghao Liu, Yahao Ding, Jiaxiang Wang +3
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@article{kangtunyakarn2026inertial,
  title = {{An Inertial Split Feasibility Framework for Bandwidth Allocation Problems in Communication Networks}},
  author = {Atid Kangtunyakarn and Araya Kheawborisut and Kanchana Kumnungkit},
  journal = {Mathematics},
  year = {2026},
  month = nov,
  doi = {10.3390/math14214068},
  url = {https://www.mdpi.com/2227-7390/14/21/4068},
  note = {CC BY 4.0},
}
RIS
TY  - JOUR
TI  - An Inertial Split Feasibility Framework for Bandwidth Allocation Problems in Communication Networks
AU  - Atid Kangtunyakarn
AU  - Araya Kheawborisut
AU  - Kanchana Kumnungkit
PY  - 2026
DA  - 2026/11/06
JO  - Mathematics
DO  - 10.3390/math14214068
UR  - https://www.mdpi.com/2227-7390/14/21/4068
AB  - 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.
SN  - 2227-7390
ER  -