Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/39434
DC FieldValueLanguage
dc.contributor國立政治大學應用數學系en_US
dc.creator陸行zh_TW
dc.creatorLuh,Hsing-
dc.creatorWang,Chia-Hungen_US
dc.date2006.08en_US
dc.date.accessioned2010-05-21T08:58:32Z-
dc.date.available2010-05-21T08:58:32Z-
dc.date.issued2010-05-21T08:58:32Z-
dc.identifier.urihttp://nccur.lib.nccu.edu.tw/handle/140.119/39434-
dc.description.abstractIn this paper, we focus on approaches in network dimensioning where it allocates bandwidths and attempts to provide a proportionally fair treatment of all the competing classes. We willshow that an achievement function can map different criteria onto a normalized scale subject to varous utilities. The achievement function can be coped with the Ordered Weighted Averaging method.Moreover, it may be interpreted as a measure of QoS on All-IP networks. Using the achievement function, one can find a Pareto optimal allocation of bandwidths on the network under the available budget, which provides the so-called proportional fairness to each class. Consequently, this results in the similar satisfaction level to every connection in all classes.-
dc.languageen-USen_US
dc.language.isoen_US-
dc.relationLecture Notes in Operations Research,35-59en_US
dc.subjectmultiple criteria optimization; achievement function; proportional fairness-
dc.titleNetwork Dimensioning Problems of Applying Achievement Functionsen_US
dc.typearticleen
item.languageiso639-1en_US-
item.fulltextWith Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextopen-
item.openairetypearticle-
item.cerifentitytypePublications-
Appears in Collections:期刊論文
Files in This Item:
File Description SizeFormat
35-59.pdf532.84 kBAdobe PDF2View/Open
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.