Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/39434
DC Field | Value | Language |
---|---|---|
dc.contributor | 國立政治大學應用數學系 | en_US |
dc.creator | 陸行 | zh_TW |
dc.creator | Luh,Hsing | - |
dc.creator | Wang,Chia-Hung | en_US |
dc.date | 2006.08 | en_US |
dc.date.accessioned | 2010-05-21T08:58:32Z | - |
dc.date.available | 2010-05-21T08:58:32Z | - |
dc.date.issued | 2010-05-21T08:58:32Z | - |
dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/39434 | - |
dc.description.abstract | In 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.language | en-US | en_US |
dc.language.iso | en_US | - |
dc.relation | Lecture Notes in Operations Research,35-59 | en_US |
dc.subject | multiple criteria optimization; achievement function; proportional fairness | - |
dc.title | Network Dimensioning Problems of Applying Achievement Functions | en_US |
dc.type | article | en |
item.languageiso639-1 | en_US | - |
item.fulltext | With Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.grantfulltext | open | - |
item.openairetype | article | - |
item.cerifentitytype | Publications | - |
Appears in Collections: | 期刊論文 |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.