.png){kind=icon}
.png){kind=icon}
Return
Online Network Utility Maximization: Algorithm, Competitive Analysis, and Applications
.png){kind=icon}
OA
AI
DOI：10.1109/TCNS.2022.3199221.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this article, we consider an online version of the well-studied network utility maximization problem, where users arrive one by one and a network operator makes irrevocable rate allocation decisions for each user without knowing the details of future arrivals. We propose a threshold-based algorithm and analyze its worst-case performance. We prove that the competitive ratio of the proposed algorithm is logarithmic in the maximum number of links requested by a user. Extensive simulations are conducted to demonstrate the performance advantage of our proposed algorithm in comparison with two state-of-the-art algorithms. In addition, we devise an adaptive implementation of our algorithm with online learning.
Keywords:
Resource management
Routing
Benchmark testing
Streaming media
Network systems
Costs
Control systems
Adaptive control
communication networks
networked control systems
online algorithms
Journal
IF:
5
Papers:
1.6K
Citations:
5.8K
Organization
No organization information available