한국정보과학회:학술대회논문집 (Proceedings of the Korean Information Science Society Conference)
- 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(D)
- /
- Pages.219-221
- /
- 2012
- /
- 1598-5164(pISSN)
The Network Utility Maximization Problem with Multiclass Traffic
- Vo, Phuong Luu (Department of Computer Engineering, Kyung Hee University) ;
- Hong, Choong-Seon (Department of Computer Engineering, Kyung Hee University)
- 발행 : 2012.06.22
초록
The concave utility in the Network Utility Maximization (NUM) problem is only suitable for elastic flows. In networks with multiclass traffic, the utility can be concave, linear, step or sigmoidal. Hence, the basic NUM becomes a nonconvex optimization problem. The current approach utilizes the standard dual-based decomposition method. It does not converge in case of scarce resource. In this paper, we propose an algorithm that always converges to a local optimal solution to the nonconvex NUM after solving a series of convex approximation problems. Our techniques can be applied to any log-concave utilities.
키워드