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 continu-ous utility functions.Because of the avoidance of iterative procedure,this...

Full description

Saved in:
Bibliographic Details
Published inTongxin Xuebao pp. 25 - 30
Main Authors XU Tong, LIAO Jian-xin
Format Journal Article
LanguageChinese
Published Editorial Department of Journal on Communications 01.01.2006
Subjects
Online AccessGet full text
ISSN1000-436X

Cover

Abstract 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 continu-ous utility functions.Because of the avoidance of iterative procedure,this algorithm was less complex than water-filling,another UMM fair algorithm.And its simplified version had the same complexity as the narrow-sense UMM fair algo-rithm based on piecewise linear function.This algorithm can be applied in various problems of resource allocation in the field of computer and communication.
AbstractList 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 continu-ous utility functions.Because of the avoidance of iterative procedure,this algorithm was less complex than water-filling,another UMM fair algorithm.And its simplified version had the same complexity as the narrow-sense UMM fair algo-rithm based on piecewise linear function.This algorithm can be applied in various problems of resource allocation in the field of computer and communication.
Author LIAO Jian-xin
XU Tong
Author_xml – sequence: 1
  fullname: XU Tong
– sequence: 2
  fullname: LIAO Jian-xin
BookMark eNqtj8FKAzEURbOoYLX9h_cDA0lmOm3XRdGtuHAj4SV5M_Mkk5QkRevXO4if4OrC5Z4D906sYoq0EmslpWy6tn-7FdtS2Mqdave9bNVavL9QIcxughShTgQjRcoY-Js8XCoHrleY8auZOcKAnAHDmDLXaQaLZRkt3JnJ0ScXgsBxscFwia5yihtxM2AotP3Le_H8-PB6emp8wg9zzjxjvpqEbH6LlEeDubILZHadVdp3qKzWnR2OR3R-rw_a99rRcqj9T9cPa4xgNA
ContentType Journal Article
DBID DOA
DatabaseName DOAJ Directory of Open Access Journals
DatabaseTitleList
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
EndPage 30
ExternalDocumentID oai_doaj_org_article_54b12d4a1b224bf99acd7282d62ce100
GroupedDBID -0Y
ALMA_UNASSIGNED_HOLDINGS
CCEZO
CUBFJ
GROUPED_DOAJ
ID FETCH-doaj_primary_oai_doaj_org_article_54b12d4a1b224bf99acd7282d62ce1003
IEDL.DBID DOA
ISSN 1000-436X
IngestDate Tue Oct 14 19:03:10 EDT 2025
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Language Chinese
LinkModel DirectLink
MergedId FETCHMERGED-doaj_primary_oai_doaj_org_article_54b12d4a1b224bf99acd7282d62ce1003
OpenAccessLink https://doaj.org/article/54b12d4a1b224bf99acd7282d62ce100
ParticipantIDs doaj_primary_oai_doaj_org_article_54b12d4a1b224bf99acd7282d62ce100
PublicationCentury 2000
PublicationDate 2006-01-01
PublicationDateYYYYMMDD 2006-01-01
PublicationDate_xml – month: 01
  year: 2006
  text: 2006-01-01
  day: 01
PublicationDecade 2000
PublicationTitle Tongxin Xuebao
PublicationYear 2006
Publisher Editorial Department of Journal on Communications
Publisher_xml – name: Editorial Department of Journal on Communications
SSID ssib051376031
ssj0002912165
ssib001102965
ssib023646527
ssib023168036
ssib036439991
ssib050281523
ssib000968473
Score 3.4419928
Snippet A generalized utility max-min(UMM) fair algorithm of resource allocation based on piecewise linear function was provided,which supported the upper/lower...
SourceID doaj
SourceType Open Website
StartPage 25
SubjectTerms utility;max-min fairness;resource allocation algorithm;piecewise linear function
Title Research on the generalized utility max-min fair algorithm based on piecewise linear function
URI https://doaj.org/article/54b12d4a1b224bf99acd7282d62ce100
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV09T8MwELVQJxYEAsS3PLBaOP5qPQKiKkgwgdQFRXbstJFoWpVWoP567pLQlIkBsjlSnORs-b3znd8Rchkym8fYM8wZ3mXgbyjmAbeZBHDSPtGZ53g4-fHJDF7Uw1APN0p9YU5YLQ9cG-5KK5-IoFziAWx8bq3LQhf8hGBEFhNeeeu8ZzecqYaYw7K7eWKUC9vG8wSWa-LStG2jjBZrIJaI07ZVkdGAwgB06_50grkkTfwM13xhE5FUdStxv5wpaYY_igBUaNXfJTsNzaTX9e_tka3VeJ-8fqfZ0WlJgfjRUa05XaxioDABkZHTiftkk6KkGOih7m00nReL8YQi2gV8blbELH4U75EiQXVzisiIo3tA7vt3z7cDht-TzmoVixR1pasbYO20sXb6m7XlIemU0zIeEZorJ3mulHLAQmwubITLB6ODkMp25TG5-fv7Tv6jk1Oy3W6cnJHOYr6M50AlFv6imjVfG_zCsQ
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Research+on+the+generalized+utility+max-min+fair+algorithm+based+on+piecewise+linear+function&rft.jtitle=Tongxin+Xuebao&rft.au=XU+Tong&rft.au=LIAO+Jian-xin&rft.date=2006-01-01&rft.pub=Editorial+Department+of+Journal+on+Communications&rft.issn=1000-436X&rft.spage=25&rft.epage=30&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_54b12d4a1b224bf99acd7282d62ce100
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1000-436X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1000-436X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1000-436X&client=summon