TY - JOUR
T1 - Necessary and sufficient condition for non-concave network utility maximisation
AU - Wang, Jingyao
AU - Guo, Jinghua
AU - Wang, Qishao
AU - Duan, Zhisheng
AU - Chen, Guanrong
N1 - Publisher Copyright:
© 2019, © 2019 Informa UK Limited, trading as Taylor & Francis Group.
PY - 2020/2/1
Y1 - 2020/2/1
N2 - As the popularity of intellectual-property video services growing, users have raised their expectations on better quality of services. However, the existing traffic engineering solutions are not adequate to provide such desired quality to users. This paper aims to develop the distributed, user-utility-aware and optimisation-based traffic allocation mechanisms for real applications with non-concave utility functions, and then provide a solution to the problem. We formulate the traffic allocation problem as a network utility maximisation problem with link capacity constraints. This optimisation problem is challenging because of the non-concavity of the utility functions and the lack of global information. We overcome the difficulty by designing a class of fully distributed traffic allocation control laws, which requires a minimum communication workload. Moreover, we present a necessary and sufficient condition under which the proposed control laws converge to the globally optimal solution. Finally, we present numerical simulations to illustrate the theoretical results.
AB - As the popularity of intellectual-property video services growing, users have raised their expectations on better quality of services. However, the existing traffic engineering solutions are not adequate to provide such desired quality to users. This paper aims to develop the distributed, user-utility-aware and optimisation-based traffic allocation mechanisms for real applications with non-concave utility functions, and then provide a solution to the problem. We formulate the traffic allocation problem as a network utility maximisation problem with link capacity constraints. This optimisation problem is challenging because of the non-concavity of the utility functions and the lack of global information. We overcome the difficulty by designing a class of fully distributed traffic allocation control laws, which requires a minimum communication workload. Moreover, we present a necessary and sufficient condition under which the proposed control laws converge to the globally optimal solution. Finally, we present numerical simulations to illustrate the theoretical results.
KW - Internet congestion control
KW - fluid-flow model
KW - non-concave optimisation
KW - traffic allocation control
KW - utility maximisation
UR - https://www.scopus.com/pages/publications/85063661673
U2 - 10.1080/00207179.2019.1599419
DO - 10.1080/00207179.2019.1599419
M3 - 文章
AN - SCOPUS:85063661673
SN - 0020-7179
VL - 93
SP - 319
EP - 327
JO - International Journal of Control
JF - International Journal of Control
IS - 2
ER -