Loading...
|
Please use this identifier to cite or link to this item:
https://nccur.lib.nccu.edu.tw/handle/140.119/32625
|
| Title: | 全IP網路中以預算為基礎之端對端服務品質管理
Budget-Based End-to-End QoS Management for All-IP Networks |
| Authors: | 陳建同
Chien-Tung Chen |
| Contributors: | 連耀南
Yao-Nan Lien
陳建同
Chien-Tung Chen |
| Keywords: | 服務品質保證
全IP網路
路由
QoS
All-IP Network
Routing |
| Date: | 2003 |
| Issue Date: | 2009-09-17 13:53:00 (UTC+8) |
| Abstract: | 面對通訊與資訊科技的大幅進步、網際網路的蓬勃發展、以及電信自由化帶來的激烈競爭，通訊網路正在進行一個巨大的變革，企圖將原有Circuit Switching 與 Packet Switching 網路整合成一個單一整合型網路－All-IP網路以支援所有的應用服務。All-IP網路受限於封包交換網路原有的特性，有服務品質問題（QoS）有待克服，因此有必要在All-IP網路上提供服務品質管理機制以實現整合型網路的目標。而要提供適當的QoS 管理，其成功之關鍵主要在於是否能提供一個簡單易行之架構。本論文先提出BBQ(Budget-Based QoS)採用以預算為基礎之服務品質管理，以簡化管理、追求效率，不增加管理複雜度為原則。BBQ提供一個高適用性的管理架構和相關的管理工具，可適用於不同的下層網路架構和不同營運目標的網管政策。
本論文為提出在BBQ管理系統中之端對端服務品質解決方案。透過承載服務的概念，端對端之服務由接取網路和骨幹網路之承載服務提供支援。本論文依據分層負責的精神提出一系列的資源規劃及路徑建構方式，提高網路資源運用效率，並可快速的以即時方式建構具服務品質保證的端對端路徑給使用者。骨幹網路由許多核心網路相連而成，各個核心網路各自獨立規劃內部路徑而端對端的路徑規劃只需選擇所欲通過的核心網路即可，計算量可大幅降低，因此可適用即時的路徑建構。路徑規劃之研究重心為如何挑選最佳核心網路路徑，以規劃具服務品質之端對端路徑並可達到資源之最有效利用。
The advance in communication and information technology and impact of telecommunication liberalization cause a revolution in telecommunication world. It attempt to merge circuit-switching and packet-switching network into one standalone perform. All-IP is one of those candidates. But All-IP also inherit 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 underlying network layer and can tune network by different network policy.
We propose an End-to-End QoS solution in BBQ management system. By the concept of bearer services, we separate the End-to-End service into Backbone and Stub Network bearer services. According to the hierarchical management, we propose an approach for resource and path planning in order to enhance network efficiency and provide End-to-End path with QoS in real time. Because Backbone Network is connected by Core Networks and each Core Network plans its internal path independently, End-to-End path planning is to choose Core Networks to pass through. This scheme could reduce the enormous computation and fit for real time path setup. The key point of path planning is how to choose the better Core Network path to compose End-to-End path with QoS and reach efficient resource utilization. |
| Reference: | 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】 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.
【3】 A. Demers, S. Keshav and S. Shenker, ""Design and Analysis of a Fair Queueing Algorithm``, Proc. SIGCOMM`89, ACM, September 1989, pp. 1-12.
【4】 International Communication Union, ""Coding of Speech at 8kb/s Using Conjugate-Structure Algebraic-code-Excited Linear-Prediction (CS-ACELP)``, ITU-T. G.729.1, March 1996.
【5】 D. Awduche, J. Malcolm, J. Agogbua, M. O`Dell and J. McManus, ""Requirements for Traffic Engineering Over MPLS``, RFC 2702, September 1999.
【6】 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.
【7】 E. Rosen and Y. Rekhter, ""BGP/MPLS VPN``, RFC 2547, March 1999.
【8】 A. S. Tanenbaum, ""Computer Networks, Third Edition``, Prentice Hall, March 1996, pp. 345-366.
【9】 Dijkstra, E.W., ""A Note on Two Problems in Connection with Graphs``, Numerische Math, vol. 1, March 1959, pp. 269-271.
【10】 C. Hedrick, ""Routing Information Protocol``, RFC 1058, June 1988.
【11】 J. Moy, ""OSPF version 2``, RFC 1583, March 1994.
【12】 Christophe Beaujean, ""Delay-Based Routing Issues in IP Networks``, contact GRADIENT CR/98/148, May 2000.
【13】 Douglas S.Reeves and Hussein F. Salama, ""A Distributed Algorithm for Delay-Constrained Unicast Routing``, IEEE Transaction on Network, April 2000.
【14】 R. Braden, L. Zhang, S. Berson, S. Herzog and S. Jamin, ""Resource Reservation Protocol (RSVP) – Version 1 Functional Specification``, RFC 2205, September 1997.
【15】 K. Chan, R. Sahita, S. Hahn and K. McCloghrie, ""Differentiated Services Quality of Service Policy Information Base ``, RFC 3317, March 2003.
【16】 Bill Goodman, ""Internet Telephony and Modem Delay``, IEEE Network, May 1999, pp. 8-16.
【17】 J. Garcia-Luna-Aceves and J. Behrens, ""Distributed scalable routing based on vectors of link states``, IEEE J. Select on Communication, October 1995.
【18】 Jon Postel, ""Internet Protocol``, RFC 791, September 1981.
【19】 Mark A. Sportack, ""IP Routing Fundamentals``, Cisco ISBN: I-57870-071-x, May 1999.
【20】 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.
【21】 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.
【22】 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.
【23】 Z. Wang and J. Crowcroft, ""Quality of Service Routing for Supporting Multimedia Applications``, IEEE Select on Communication, September 1996. |
| Description: | 碩士
國立政治大學
資訊科學學系
90753015
92 |
| Source URI: | http://thesis.lib.nccu.edu.tw/record/#G0090753015 |
| Data Type: | thesis |
| Appears in Collections: | [資訊科學系] 學位論文
|
All items in 政大典藏 are protected by copyright, with all rights reserved.
|
