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


    Title: 預算法全IP核心網路服務品質管理之路徑規劃
    Authors: 李宗勳
    Contributors: 連耀南
    李宗勳
    Keywords: QoS
    BBQ
    Path Planning
    Date: 2003
    Issue Date: 2009-09-17 13:53:42 (UTC+8)
    Abstract: 面對通訊與資訊科技的大幅進步、網際網路的蓬勃發展、以及電信自由化帶來的激烈競爭,通訊網路正在進行一個巨大的變革,企圖將原有Circuit Switching 與 Packet Switching 網路整合成一個單一整合型網路-All-IP網路以支援所有的應用服務。All-IP網路受限於封包交換網路原有的特性,有服務品質問題(QoS)有待克服,因此有必要在All-IP網路上提供服務品質管理機制以實現整合型網路的目標。而要提供適當的QoS 管理,其成功之關鍵主要在於是否能提供一個簡單易行之架構。本論文先提出BBQ(Budget-Based QoS)採用以預算為基礎之服務品質管理,BBQ提供一個高適用性的管理架構和相關的管理工具,可適用於不同的下層網路架構和不同營運目標的網管政策。
    而在本文中提出以路徑規劃(Path Planning)的方式作為此架構的路由方法。路徑規劃係以過去的歷史訊務資料為基礎,為未來可能進入網路中的訊務規劃出一組具有品質要求的路徑,而在系統運作時,只需根據訊務的需求,指定一條符合其品質要求的路徑即可。此方法不但可以給予進入網路的訊務絕對的服務品質保證,而且事前的運算可以免除在系統運作時大量的計算負擔。在本論文中,我們設計了一套路徑規劃的演算法,來驗證我們的方法之效能。而經過反覆的模擬測試,發現本路徑規劃方法的確較傳統OSPF演算法擁有較佳的網路效能,且可以提供進入網路的訊務較佳的服務品質保證。
    The advance in information technology and impact of telecommunications liberalization cause a revolution in commucation world. It attempt to merge circuit-switching and packet-switching network into one standlone perform. All-IP is one of those candidates. But All-IP also inherits the characteristics of packet-switching network, the problem of transmission quality. So, we need some management system of quality on All-IP network to achieve the ambition of converged network. In this thesis, we propose BBQ management system. BBQ offers a highly adaptive management architecture and some management tools for operators. Those tools can be used in different underly network layer and can be tuned by different network policy.
    We propose the path planning as routing approach in BBQ architecture. Path-planning is doing path calculation for the traffic may happen in future using the historic traffic statistic. In run-time, admission control component will assign a planned path that satisfy the requirements of admitted traffic. In this method, absolute transmission quality is guaranteed to admitted traffic. And pre-planning can reduce heavy calculation overhead in run-time. In this thesis, we design a path-planning algorithm, the GPPA algorithm, which takes pre-defined profit as its maximize objective under bandwidth and quality constraints. Through an performance evaluation using simulation method, we demonstrate that the path-planning might outperform the traditional OSPF algorithm.
    Reference: [1]3rd Generation Partnership Project, ``Technical Specification Group Services and Systems Aspects: Architecture for an All IP network'', 3GPP TR 23.922 version 1.0.0., October 1999.
    [2]Xiao, X., L. -M. Ni, ``Internet QoS: A Big Picture", IEEE Network, 13(2):8-18, March-April 1999.
    [3]Miras, D., ``Network QoS Needs of Advanced Internet Applications", Internet2 - QoS Working Group, November 2002.
    [4]Pascal Lorenz, ``Quality of service and new architectures for future telecommunications networks", MILCOM 2000 - IEEE Military Communications Conference, no.1, October 2000 pp.695-698.
    [5]D. Goderis, S. Van den Bosch, Y. T'Joens, P. Georgatsos, D. Griffin, G. Pavlou, P. Trimintzios, G. Memenios, E. Mykoniati, C. Jacquenet, ``A service-centric IP quality of service architecture for next generation networks", NOMS 2002 - IEEE/IFIP Network Operations and Management Symposium, no.1, April 2002 pp. 139-154.
    [6]Mahbubul Alam, Ramjee Prasad, John R. Farserotu, ``Quality of service among IP-based heterogeneous networks", IEEE Personal Communications, no.6, December 2001 pp.18-24.
    [7]Vijay K. Garg, Oliver T. W. Yu, "Integrated QoS support in 3G UMTS networks", WCNC 2000 - IEEE Wireless Communications and Networking Conference, no.1, September 2000 pp.1187-1192.
    [8]E. Crawley, Editor, L. Berger, S. Berson, ``A Framework for Integrated Services and RSVP over ATM",RFC 2382, August 1998.
    [9]D. Black, M. Carlson, E. Davies, Z. Wang, ``An Architecture for Differentiated Services", RFC 2475, December 1998.
    [10]Christian Huitema, ``Routing in the Internet", Prentice Hall PTR, 2000, pp.356.
    [11]Spiridon Bakiras and Victor O.K. Li, ``Efficient Resource Management for End-to-End QoS Guarantees in DiffServ Networks", IEEE International Conference on Communications, 2002.
    [12]Jacobson, V., K. Nichols, K. Poduri, ``An Expedited Forwarding PHB", RFC 2598, June 1999.
    [13]Heinanen, J., F. Baker, W. Weiss, and J. Wroclawski, ``Assured Forwarding PHB Group", RFC 2597, June 1999.
    [14]Clark, D., W. Fang, ``Explicit Allocation of Best Effort packet Delivery Service", IEEE/ACM Transactions on Networking, 6(4):364-373, August 1998.
    [15]P. Trimintzios et al., ``A Management and Control Architecture for Providing IP Differentiated Services in MPLS-based Networks," IEEE Commun. Mag., vol. 39, no. 5, May 2001, pp. 80-88.
    [16]P. Trimintzios et al., ``A Policy-Based Quality of Service Management System for IP DiffServ Networks," IEEE Network., vol. 16, no. 2, Mar 2002, pp. 50-56.
    [17]Eleni Mykoniati et al., ``Admission Control for Providing QoS in DiffServ IP Networks: The TEQUILA Approach, `` IEEE Commun. Mag. Jan 2003, pp. 38-44.
    [18]G. Feng, K. Makki, N. Pissinou, C. Douligeris, "An efficient heuristic for delay-cost-constrained QoS routing, `` IEEE International Conference on Communications, 2001, ICC 2001, vol. 8, pp. 2603-2607.
    [19]Q. Ma and P. Steenkiste, ``On path selection for traffic with bandwidth guarantees," In Proceedings of IEEE International Conference on Network Protocols, Atlanta, GA, October 1997.
    [20]Turgay Korkmaz, and Marwan Krunz, ``Multi-Constrained Optimal Path Selection," IEEE INFOCOM 2001, pp. 834-843.
    [21]S. Floyd, and V. Jacobson, ``Random Early Detection Gateways for Congestion Avoidance'', IEEE/ACM Transactions on Networking, vol. 1, no. 4, August 1993, pp. 397-413.
    [22]Nicolas Christin and Jörg Liebeherr, ``A QoS Architecture for Quantitative Service Differentiation '', IEEE Communications Magazine, June 2003.
    [23]A. Demers, S. Keshav and S. Shenker, ``Design and Analysis of a Fair Queueing Algorithm'', Proc. SIGCOMM'89, ACM, September 1989, pp. 1-12.
    [24]D. Awduche, J. Malcolm, J. Agogbua, M. O'Dell and J. McManus, ``Requirements for Traffic Engineering Over MPLS'', RFC 2702, September 1999.
    [25]D. Ooms, B. Sales, W. Livens, A. Acharya, F. Griffoul and F. Ansari, ``Overview of IP Multicast in a Multi-Protocol Label Switching (MPLS) Environment'', RFC 3553, August 2002.
    [26]E. Rosen and Y. Rekhter, ``BGP/MPLS VPN'', RFC 2547, March 1999.
    [27]A. S. Tanenbaum, ``Computer Networks, Third Edition'', Prentice Hall, March 1996, pp. 345-366.
    [28]Dijkstra, E.W., ``A Note on Two Problems in Connection with Graphs'', Numerische Math, vol. 1, March 1959, pp. 269-271.
    [29]C. Hedrick, ``Routing Information Protocol'', RFC 1058, June 1988.
    [30]J. Moy, ``OSPF version 2'', RFC 1583, March 1994.
    [31]Christophe Beaujean, ``Delay-Based Routing Issues in IP Networks'', contact GRADIENT CR/98/148, May 2000.
    [32]Douglas S.Reeves and Hussein F. Salama, ``A Distributed Algorithm for Delay-Constrained Unicast Routing'', IEEE Transaction on Network, April 2000.
    [33]R. Braden, L. Zhang, S. Berson, S. Herzog and S. Jamin, ``Resource Reservation Protocol (RSVP) – Version 1 Functional Specification'', RFC 2205, September 1997.
    [34]K. Chan, R. Sahita, S. Hahn and K. McCloghrie, ``Differentiated Services Quality of Service Policy Information Base '', RFC 3317, March 2003.
    [35]Bill Goodman, ``Internet Telephony and Modem Delay'', IEEE Network, May 1999, pp. 8-16.
    [36]J. Garcia-Luna-Aceves and J. Behrens, ``Distributed scalable routing based on vectors of link states'', IEEE J. Select on Communication, October 1995.
    [37]Jon Postel, ``Internet Protocol'', RFC 791, September 1981.
    [38]Mark A. Sportack, ``IP Routing Fundamentals'', Cisco ISBN: I-57870-071-x, May 1999.
    [39]R. Wideyono, ``The Design and Evaluation of Routing Algorithms for Real-Time Channels'', International Computer Science Institute, Univ. of California at Berkeley, Tech Rep. ISCI TR-94-024, June 1994.
    [40]S. Rampal and D. Reeves, ``An evaluation of routing and admission control algorithms for multimedia traffic'', Proc. of the 5th IFIP Conf. on High Performance Networks, October 1995.
    [41]S. Lavenberg, ``Mean Value Analysis of Closed Multichain Queuing Networks'', Journal of the Association for Computing Machinery, vol. 27, no. 2, April 1980, pp. 313-322.
    [42]Z. Wang and J. Crowcroft, ``Quality of Service Routing for Supporting Multimedia Applications'', IEEE Select on Communication, September 1996.
    Description: 碩士
    國立政治大學
    資訊科學學系
    90753026
    92
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0090753026
    Data Type: thesis
    Appears in Collections:[資訊科學系] 學位論文

    Files in This Item:

    File Description SizeFormat
    75302601.pdf72KbAdobe PDF748View/Open
    75302602.pdf111KbAdobe PDF768View/Open
    75302603.pdf114KbAdobe PDF884View/Open
    75302604.pdf326KbAdobe PDF1014View/Open
    75302605.pdf286KbAdobe PDF1733View/Open
    75302606.pdf3516KbAdobe PDF873View/Open
    75302607.pdf569KbAdobe PDF1490View/Open
    75302608.pdf320KbAdobe PDF2068View/Open
    75302609.pdf93KbAdobe PDF764View/Open
    75302610.pdf107KbAdobe PDF748View/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