Generalized gradient scheduling for vector network utility maximization

Heejin Joung, Han Shin Jo, Cheol Mun, Jong Gwan Yook

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

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.

Original languageEnglish
Article number6397542
Pages (from-to)111-114
Number of pages4
JournalIEEE Communications Letters
Volume17
Issue number1
DOIs
Publication statusPublished - 2013

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Generalized gradient scheduling for vector network utility maximization'. Together they form a unique fingerprint.

Cite this