Research on the generalized utility max-min fair algorithm based on piecewise linear function

A generalized utility max-min (UMM) fair algorithm of resource allocation based on piecewise linear function was provided, which supported the upper/lower bounds of resource allocation as well as strictly increasing and continuous utility functions. Because of the avoidance of iterative procedure, t...

Full description

Saved in:
Bibliographic Details
Published inTongxin Xuebao Vol. 27; no. 10; pp. 25 - 30
Main Authors Xu, Tong, Liao, Jian-Xin
Format Journal Article
LanguageChinese
Published Editorial Department of Journal on Communications 01.10.2006
Subjects
Online AccessGet full text
ISSN1000-436X

Cover

More Information
Summary:A generalized utility max-min (UMM) fair algorithm of resource allocation based on piecewise linear function was provided, which supported the upper/lower bounds of resource allocation as well as strictly increasing and continuous utility functions. Because of the avoidance of iterative procedure, this algorithm was less complex than water-filling, another UMMfair algorithm. And its simplified version hadthe same complexity as the narrow-sense UMM fair algorithm based on piecewise linear function. This algorithm can be applied in various problems of resource allocation in the field of computer and communication.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1000-436X