Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/LCOMM.2012.120612.122235 | IEEE Communications Letters |
Keywords | Field | DocType |
Vectors,Linear programming,Pareto optimization,Resource management,Educational institutions | Mathematical optimization,Scheduling (computing),Computer science,Scalar (physics),Generalized gradient,Resource allocation,Cellular network,Directional derivative,Telecommunications link,Special case | Journal |
Volume | Issue | ISSN |
17 | 1 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hee-jin Joung | 1 | 16 | 2.66 |
| Han-Shin Jo | 2 | 1205 | 75.15 |
| Cheol Mun | 3 | 292 | 27.01 |
| Jong-Gwan Yook | 4 | 326 | 41.15 |