.png){kind=icon}
.png){kind=icon}
Return
Centralized Network Utility Maximization With Accelerated Gradient Method
.png){kind=icon}
PRE
AI
DOI：10.1109/TON.2025.3562283.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Network utility maximization (NUM) is a fundamental problem for network traffic management and resource allocation. Due to the inherent decentralization and complexity of networks, much of the existing research has focused on developing decentralized algorithms for NUM. However, with the rise of Software-Defined Networking (SDN), especially in cloud networks and inter-datacenter networks managed by large enterprises, there has been growing interest in centralized NUM algorithms. To cope with the large and increasing number of flows in such SDN networks, existing studies on centralized NUM focus on the scalability of the algorithm with respect to the number of flows, but the efficiency is ignored. In this paper, we propose a centralized, efficient and scalable algorithm for the NUM problem. By designing smooth utility and penalty functions, we formulate the NUM problem with a smooth objective function, which enables the use of Nesterov's accelerated gradient method (AGM). We prove that the proposed method achieves an $O(d/t<^>{2})$ convergence rate, demonstrating superior convergence speed with respect to the number of iterations t, and our method is scalable with respect to the number of flows d in the network. Our smooth objective NUM formulation and AGM are effective not only in simple network scenarios with non-prioritized flows routed on one simple paths, but also in more complex and practical scenarios involving prioritized flows routed across multiple complex paths. Experiment results confirm that our method obtains accurate solutions with fewer iterations, and achieves close-to-optimal network utility.
Keywords:
Network utility maximization
resource allocation
accelerated gradient method
Journal
I
IF:
0
Papers:
543
Citations:
0