English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 91280/121421 (75%)
Visitors : 25417853      Online Users : 119
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/32606
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/32606


    Title: 數位網路上多重目標規劃的數學模式
    Mathematical Models of Pareto Optimal Path Selection on All-IP Networks
    Authors: 王嘉宏
    Wang, Chia-Hung
    Contributors: 陸行
    Hsing Luh
    王嘉宏
    Wang, Chia-Hung
    Keywords: 多重目標規劃問題
    達成度函數
    比例性公平
    柏雷托最適
    公平的頻寬配置
    有序的加權平均法
    選徑
    延遲
    multiple-objective problems
    achievement function
    proportional fairness
    Pareto optimal
    fair bandwidth allocation
    ordered weighted averaging method
    routing
    delay
    Date: 2003
    Issue Date: 2009-09-17 13:50:12 (UTC+8)
    Abstract: 面對通訊與資訊科技的大幅進步,通訊網路正在進行一個巨大的變革,要將電信網路與數據網路整合成一個單一的All-IP網路以支援所有網路應用服務。欲達到整合型網路的理想,仍有許多困難尚待克服,而服務品質問題是其中最關鍵的問題之一。因為受限於封包交換網路之原有的特性,All-IP網路有影響服務品質的三項因素:過長的延遲時間、抖動以及封包遺失。首先,我們利用了達成度函數(achievement function)來處理單位的轉換,使得能夠同時考量此三項不同單位的因素。接著,本文中提出一套方法來解決All-IP網路上端對端(end-to-end)的資源配置及路徑規劃問題。在分配資源時,我們企圖提供一種成比例的公平性給各個不同等級。此公平性的精神是要使得所有網路使用者的滿足程度相當,而非各個不同等級的使用者分配到相同的資源。我們將以預算方式控制端對端品質管理以追求使用者之整體最大滿意程度。
    本論文的規劃概念是將網路規劃分成兩個階段。第一階段是在一筆給定的總預算底下,以成比例的方式去分配資源給各個不同等級,並建置網路上的頻寬,使各等級能依其需求拿到適當的頻寬,確保滿足程度相當。
    接下來第二階段則是在第一部份已完成的規劃基礎下,做路徑規劃,指派新進入的使用者到一條較好的路徑,在滿足此使用者的延遲時間要求下,使此系統的壅塞程度越小越好。路徑規劃的概念為如何挑選最佳網路路徑,以規劃具服務品質之端對端路徑,並可達到資源之最有效利用。網路營運者將可運用此套方法來調校自身所營運的網路以追求使用者最高滿意度。
    We present an approach for the fair resource allocation problem
    and QoS routing in All-IP networks that offer multiple services to users. The objective of the optimization problem is to determine the amount of required bandwidth for each link and each class to maximize the sum of the users' utility. In this work, we focus on approaches that, while allocating bandwidth, attempt to provide a proportionally fair treatment of all the competing classes. First, we will show that an achievement function can map different criteria subject to various utility onto a normalized scale. It may be interpreted as a measure of QoS (Quality of Service) on All-IP networks. Using the bandwidth allocation model, we can find a Pareto optimal allocation of bandwidth on the network under a limited available budget. This allocation can provide the so-called proportional fairness to every class, that is, this allocation can provide the similar satisfaction to each user. Next, we present a routing scheme under consideration of the delay. Such an optimal path provides the end-to-end QoS guarantees to each user. Finally, a numerical example is given to illustrate how to solve the fair resource allocation problem and how to modify the nonlinear parts.
    Reference: ``Enabling UMTS/Third Generation Services and Applications", UMTS Forun Report No.11, Oct., 2000.
    A. W. Berger, and Y. Kogan, ``Dimensioning Bandwidth for Elastic Traffic in High-Speed Data Networks", IEEE/ACM Transactions on Networking, Vol. 8, No. 5, Oct. 2000.
    R. Boutaba, W. Szeto, and Y. Iraqi, ``DORA: Efficient Routing for MPLS Traffic Engineering", Journal of Network and Systems Management, Vol. 10, No. 3, September 2002.
    C. T. Chen, ``Budget-Based End-to-End QoS Management for All-IP Networks", Master thesis, Department of Computer Science, National Chengchi University, 2003.
    M. C. Chen, ``Distributed Resource Management and Admission Control in Budget-Based QoS Management for All-IP Core Networks", Master thesis, Department of Computer Science, National Chengchi University, 2003.
    A. L. Erera, C. F. Daganzo, and D. J. Lovell, ``The Access-Control Problem on Capacitated FIFO Networks with Unique O-D Paths is Hard", Operations Research, Vol. 50, No. 4, pp. 736-743, July-August 2002.
    B. Fortz, J. Rexford, and M. Thorup, ``Traffic Engineering with Traditional IP Routing Protocols", IEEE Communications Magazine, October 2002.
    R. J. Gibbens, S. K. Sargood, C. V. Eijl, F. P. Kelly, H. Azmoodeh, R. N. Macfadyen, N. W. Macfadyen, ``Fixed-Point Models for the End-to-End Performance Analysis of IP Networks", 13th ITC Specialist Seminar: IP Traffic Measurement, Modeling and Management, Monterey, California, Sep. 2000.
    K. Gopalan and T. Chiueh, ``Delay Budget Allocation for Delay-Guaranteed Network Paths", Technical Report TR-113, Experimental Computer Systems Labs, Dept. of Computer Science, State University of New York, Stony Brook, NY, June 2002.
    J. Gozdecki, A. Jajszczyk, and R. Stankiewicz, ``Quality of Service Terminology in IP Networks", IEEE Communications Magazine, no. 3, pp. 153-159, Mar. 2003.
    D. Granot, J. Kuipers, and S. Chopra, ``Cost allocation for a tree network with heterogeneous cutomers", Mathematics of Operations Research, Vol. 27, Iss. 4, pp. 647-661, Nov. 2002.
    R. A. Guerin and A. Orda, ``QoS Routing in Networks with Inaccurate Information: Theory and Algorithms", IEEE/ACM TRANSACTIONS ON NETWORKING, Vol. 7, No. 3, June 1999.
    P. V. Hentenryck, ILOG OPL Studio 3.5: The Optimization Language, Massachusetts Institute of Technology, April 2001.
    R. Johari and D. K. H. Tan, ``End-to-End Congestion Control for the Internet: Delays and Stability", IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 9, NO. 6, pp. 818-832, Dec. 2001.
    F. P. Kelly, ``Charging and Rate Control for Elastic Traffic", European Transactions on Telecommunications, volume 8, pages 33-37, 1997.
    F. P. Kelly, A. K. Maulloo and D. K. H. Tan, ``Rate Control for Communication Networks: Shadow Prices, Proportional Fairness and Stability", Journal of the Operational Research Society, Vol. 49, 237-252, 1998.
    F. P. Kelly, ``Mathematical modelling of the Internet", Mathematics Unlimited - 2001 and Beyond, Springer-Verlag, Berlin, pp. 685-702, 2001.
    F. P. Kelly, ``Fairness and Stability of End-to-End Congestion Control", European Journal of Control, vol. 9, pp. 159-176, 2003.
    T. H. Li, ``Path Planning in Budget-Based QoS Management for All-IP Core Networks", Master thesis, Department of Computer Science, National Chengchi University, 2003.
    Y. N. Lien, H. C. Jang, T. C. Tsai, and H. Luh, ``BBQ: A QoS Management Infrastructure for All-IP Networks", Communications of Institute of Information and Computing Machinery: Mobile Communications and Wireless Networks, Vol.7, No. 1, pp. 89-115, Mar. 2004.
    A. W. Marshall, I. Olkin, Inequalties: Theory of Majorization and Its Applications, New York: Academic Press, 1979.
    A. Muller, D. Stoyan, Comparison Methods for Stochastic Models and Risks, Wiley, Chichester, 2002.
    M. Minoux, Mathematical Programming: Theory and Algorithms, Wiley, Chichester, 1986.
    G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, New York : Wiley, 1988.
    W. Ogryczak, T. Sliwinski and A. Wierzbicki, ``Fair Resource Allocation Schemes and Network Dimensioning Problems", Journal of Telecommunications and Information Technology, pp. 34-42, 3/2003.
    A. Orda, ``Routing with End-to-End QoS Guarantees in Broadband Networks", IEEE/ACM Transactions on Networking, Vol. 7, No. 3, June 1999.
    M. Pioro, G. Malicsko, and G. Fodor, ``Optimal Link Capacity Dimensioning in Proportionally Fair Networks", NETWORKING 2002, LNCS 2345, pp.277-288, 2002.
    R. L. Rardin, Optimization in Operations Research, Prentice-Hall, 1998.
    R. E., Steuer, Multiple Criteria Optimization : Theory, Computation, and Application, New York, Wiley, 1986.
    A. C. Stockman, Introduction to Economics, 2nd ed., the Dryden Press, 1999.
    P. Thomas, D. Teneketzis, J. K. Mackie-Mason, ``A Market-Based Approach to Optimal Resource Allocation in Integrated-Services Connection-Oriented Networks", Operations Research, Vol. 50, No. 4, pp. 603-616, July-August, 2002.
    S. T. Waller, A. K. Ziliaskopoulos, ``A Dynamic and Stochastic Approach to Network Design", Journal of the Transportation Research Board, No. 1771, pp. 106-114, 2001.
    P. Whittle, Optimization Under Constraints, Wiley, Chichester, 1971.
    W. Willinger and V. Paxson, ``Where Mathematics meets the Internet", Notices of the American Mathematical Society, pp. 961-970, Sep. 1998.
    W. L. Winston, Operations Research: Applications and Algorithms, 3rd ed., Duxbury, 1994.
    X. Xiao and L. M. Ni, ``Internet QoS: A Big Picture", IEEE Network, March/April, 1999.
    R. R. Yager, ``On Ordered Weighted Averaging Aggregation Operators in Multicriteria Decision Making", IEEE Transactions on Systems, Man and Cybernetics, vol. 18, No. 1, pp. 183-190, 1988.
    R. R. Yager, ``On the analytic representation of the Leximin ordering and its application to flexible constraint propagation", European Journal of Operational Research, vol. 102, pp. 176-192, 1997.
    Description: 碩士
    國立政治大學
    應用數學研究所
    91751008
    92
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0917510081
    Data Type: thesis
    Appears in Collections:[應用數學系] 學位論文

    Files in This Item:

    File Description SizeFormat
    51008101.pdf72KbAdobe PDF646View/Open
    51008102.pdf166KbAdobe PDF701View/Open
    51008103.pdf56KbAdobe PDF685View/Open
    51008104.pdf56KbAdobe PDF660View/Open
    51008105.pdf72KbAdobe PDF685View/Open
    51008106.pdf76KbAdobe PDF683View/Open
    51008107.pdf92KbAdobe PDF776View/Open
    51008108.pdf56KbAdobe PDF645View/Open
    51008109.pdf132KbAdobe PDF766View/Open
    51008110.pdf120KbAdobe PDF786View/Open
    51008111.pdf211KbAdobe PDF762View/Open
    51008112.pdf298KbAdobe PDF771View/Open
    51008113.pdf214KbAdobe PDF830View/Open
    51008114.pdf121KbAdobe PDF701View/Open
    51008115.pdf89KbAdobe PDF848View/Open


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


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback