English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 91913/122132 (75%)
Visitors : 25826588      Online Users : 193
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 應用數學系 > 期刊論文 >  Item 140.119/39434
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/39434

    Title: Network Dimensioning Problems of Applying Achievement Functions
    Authors: 陸行
    Contributors: 國立政治大學應用數學系
    Keywords: multiple criteria optimization;achievement function;proportional fairness
    Date: 2006.08
    Issue Date: 2010-05-21 16:58:32 (UTC+8)
    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.
    Relation: Lecture Notes in Operations Research,35-59
    Data Type: article
    Appears in Collections:[應用數學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    35-59.pdf532KbAdobe PDF423View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback