arrow
返回

Learning-NUM: Network Utility Maximization With Unknown Utility Functions and Queueing Delay

delete2022-12-01
delete4
delete
OA
AI
X
Xinzhe Fu *
E
Eytan Modiano
DOI:10.1109/TNET.2022.3182890delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Network Utility Maximization (NUM) studies the problems of allocating traffic rates to network users in order to maximize the users' total utility subject to network resource constraints. In this paper, we propose a new NUM framework, Learning-NUM, where the users' utility functions are unknown apriori and the utility function values of the traffic rates can be observed only after the corresponding traffic is delivered to the destination, which means that the utility feedback experiences queueing delay. The goal is to design a policy that gradually learns the utility functions and makes rate allocation and network scheduling/routing decisions so as to maximize the total utility obtained over a finite time horizon T. In addition to unknown utility functions and stochastic constraints, a central challenge of our problem lies in the queueing delay of the observations, which may be unbounded and depends on the decisions of the policy. We first show that the expected total utility obtained by the best dynamic policy is upper bounded by the solution to a static optimization problem. Without the presence of feedback delay, we design an algorithm based on the ideas of gradient estimation and Max-Weight scheduling. To handle the feedback delay, we embed the algorithm in a parallel-instance paradigm to form a policy that achieves (O) over tilde (T-3/4)-regret, i.e., the difference between the expected utility obtained by the best dynamic policy and our policy is in (O) over tilde (T-3/4). Furthermore, we extend our policy to deal with the case where the utility observations are noisy and show that it achieves (O) over tilde (T-7/8)-regret. Finally, to demonstrate the practical applicability of the Learning-NUM framework, we apply it to three application scenarios including database query, job scheduling and video streaming. We further conduct simulations on the job scheduling application to evaluate the empirical performance of our policy.
Keyword:
Optimization methods
queueing analysis

期刊

I
IEEE-ACM Transactions on Networking
IF:
3.6
论文数:
4.4K
被引数:
9.5K

机构

暂无机构信息
引用论文

引用论文

The 2013Mw6.2 Khaki‐Shonbe (Iran) Earthquake: Insights into seismic and aseismic shortening of the Zagros sedimentary cover
err2015-11-20
err0
errOAAI
errJ. R. Elliott; E. A. Bergman; A. C. Copley; A. R. Ghods; E. K. Nissen; B. Oveisi; M. Tatar; R. J. Walters; F. Yamini‐Fard
err分享
err收藏
Adaptive Video Streaming for Wireless Networks With Multiple Users and Helpers
err2014-01-01
err97
errOAAI
errBethanabhotla, Dilip; Caire, Giuseppe; Neely, Michael J.
err分享
err收藏
Chaining Sequence/Structure Seeds for Computing RNA Similarity
err2015-03-01
err0
errOAAI
errLaetitia Bourgeade; Cédric Chauve; Julien Allali
err分享
err收藏
Die Bierbrauerei
err
IF0
err2009-10-27
err0
PREAI
errLudwig Narziß; Werner Back
err分享
err收藏
The Acquisition of Finiteness
err
IF0
err2008-10-20
err0
PREAI
errElma Blom
err分享
err收藏
Smart manufacturing systems for Industry 4.0: Conceptual framework, scenarios, and future perspectives
err2018-01-23
err0
PREAI
errPai Zheng; Honghui wang; Zhiqian Sang; Ray Y. Zhong; Yongkui Liu; Chao Liu; Khamdi Mubarok; Shiqiang Yu; Xun Xu
err分享
err收藏
Fairness and optimal Stochastic control for heterogeneous networks
err2008-04-01
err288
PREAI
errNeely, Michael J.; Modiano, Eytan; Li, Chih-Ping
err分享
err收藏
学者 查看更多内容