Generalized Gradient Scheduling for Vector Network Utility Maximization
- Authors
- Joung, Heejin; Jo, Han-Shin; Mun, Cheol; Yook, Jong-Gwan
- Issue Date
- Jan-2013
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Network utility maximization; gradient scheduling; vector utility function; uplink channels
- Citation
- IEEE COMMUNICATIONS LETTERS, v.17, pp.111 - 114
- Indexed
- SCIE
- Journal Title
- IEEE COMMUNICATIONS LETTERS
- Volume
- 17
- Start Page
- 111
- End Page
- 114
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/192888
- DOI
- 10.1109/LCOMM.2012.120612.122235
- ISSN
- 1089-7798
- Abstract
- Generalized network utility maximization (NUM), which has a multiple-variable vector utility function, is a key framework in network resource allocation that supports multi-class services with a different efficiency and fairness. We propose a generalized gradient scheduling (GS) that easily finds a solution to the generalized NUM problem by simplifying its objective function. The properties of the argument of the maximum and the directional derivative are applied to the simplification process. Achieving a generalized GS is a necessary condition for achieving a generalized NUM, and for a special case with scalar utility functions, the generalized GS and generalized NUM are equivalent problems. A practical application of the findings to uplink cellular networks is also presented in this paper.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 미래자동차공학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/192888)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.