Network utility maximisation framework with multiclass traffic

作     者：Vo, Phuong Luu Tran, Nguyen Hoang Hong, Choong Seon Lee, Sungwon 

作者机构：Kyung Hee Univ Dept Comp Engn 1 Seocheon Yongin 446701 Gyeonggi South Korea 

出 版 物：《IET NETWORKS》 

年 卷 期：2013年第2卷第3期

页      面：152-161页

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：MSIP (Ministry of Science  ICT and Future Planning)  Korea in the ICT R D Program 

主　　题：approximation theory convex programming gradient methods radio networks telecommunication traffic network utility maximisation framework multiclass traffic NUM elastic flows inelastic traffic sigmoidal functions nonconcave functions nonconvex optimisation problem approximation problem gradient algorithm multihop wireless network 

摘      要：The concave utilities in the basic network utility maximisation (NUM) problem are only suitable for elastic flows. In networks with both elastic and inelastic traffic, the utilities of inelastic traffic are usually modelled by the sigmoidal functions which are non-concave functions. Hence, the basic NUM problem becomes a non-convex optimisation problem. To address the non-convex NUM, the authors approximate the problem which is equivalent to the original one to a strictly convex problem. The approximation problem is solved efficiently via its dual by the gradient algorithm. After a series of approximations, the sequence of solutions to the approximation problems converges to a local optimal solution satisfying the Karush-Kuhn-Tucker conditions of the original problem. The proposed algorithm converges with any value of link capacity. The authors also extend their work to jointly allocate the rate and the power in a multihop wireless network with elastic and inelastic traffic. Their framework can be used for any log-concave utilities.