學術產出-Theses

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

  • No doi shows Citation Infomation
題名 全IP網路中以預算為基礎之端對端服務品質管理
Budget-Based End-to-End QoS Management for All-IP Networks
作者 陳建同
Chien-Tung Chen
貢獻者 連耀南
Yao-Nan Lien
陳建同
Chien-Tung Chen
關鍵詞 服務品質保證
全IP網路
路由
QoS
All-IP Network
Routing
日期 2003
上傳時間 17-Sep-2009 13:53:00 (UTC+8)
摘要 面對通訊與資訊科技的大幅進步、網際網路的蓬勃發展、以及電信自由化帶來的激烈競爭,通訊網路正在進行一個巨大的變革,企圖將原有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
【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.
描述 碩士
國立政治大學
資訊科學學系
90753015
92
資料來源 http://thesis.lib.nccu.edu.tw/record/#G0090753015
資料類型 thesis
dc.contributor.advisor 連耀南zh_TW
dc.contributor.advisor Yao-Nan Lienen_US
dc.contributor.author (Authors) 陳建同zh_TW
dc.contributor.author (Authors) Chien-Tung Chenen_US
dc.creator (作者) 陳建同zh_TW
dc.creator (作者) Chien-Tung Chenen_US
dc.date (日期) 2003en_US
dc.date.accessioned 17-Sep-2009 13:53:00 (UTC+8)-
dc.date.available 17-Sep-2009 13:53:00 (UTC+8)-
dc.date.issued (上傳時間) 17-Sep-2009 13:53:00 (UTC+8)-
dc.identifier (Other Identifiers) G0090753015en_US
dc.identifier.uri (URI) https://nccur.lib.nccu.edu.tw/handle/140.119/32625-
dc.description (描述) 碩士zh_TW
dc.description (描述) 國立政治大學zh_TW
dc.description (描述) 資訊科學學系zh_TW
dc.description (描述) 90753015zh_TW
dc.description (描述) 92zh_TW
dc.description.abstract (摘要) 面對通訊與資訊科技的大幅進步、網際網路的蓬勃發展、以及電信自由化帶來的激烈競爭,通訊網路正在進行一個巨大的變革,企圖將原有Circuit Switching 與 Packet Switching 網路整合成一個單一整合型網路-All-IP網路以支援所有的應用服務。All-IP網路受限於封包交換網路原有的特性,有服務品質問題(QoS)有待克服,因此有必要在All-IP網路上提供服務品質管理機制以實現整合型網路的目標。而要提供適當的QoS 管理,其成功之關鍵主要在於是否能提供一個簡單易行之架構。本論文先提出BBQ(Budget-Based QoS)採用以預算為基礎之服務品質管理,以簡化管理、追求效率,不增加管理複雜度為原則。BBQ提供一個高適用性的管理架構和相關的管理工具,可適用於不同的下層網路架構和不同營運目標的網管政策。
本論文為提出在BBQ管理系統中之端對端服務品質解決方案。透過承載服務的概念,端對端之服務由接取網路和骨幹網路之承載服務提供支援。本論文依據分層負責的精神提出一系列的資源規劃及路徑建構方式,提高網路資源運用效率,並可快速的以即時方式建構具服務品質保證的端對端路徑給使用者。骨幹網路由許多核心網路相連而成,各個核心網路各自獨立規劃內部路徑而端對端的路徑規劃只需選擇所欲通過的核心網路即可,計算量可大幅降低,因此可適用即時的路徑建構。路徑規劃之研究重心為如何挑選最佳核心網路路徑,以規劃具服務品質之端對端路徑並可達到資源之最有效利用。
zh_TW
dc.description.abstract (摘要) 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.
en_US
dc.description.tableofcontents 目錄

第一章、 簡介(INTRODUCTION) 1
1.1 電信產業的趨勢 1
1.1.1 整合型網路-全IP網路(Network Convergence-All-IP Network) 3
1.1.2 封包網路上承載具時效性應用問題 (Real-time Application on Packet-Switching Networks) 4
1.2 服務品質保證定義(QoS Definitions) 5
1.2.1 分歧的品質保證期望(Diversified QoS Expectations) 6
1.3 全IP網路之服務品質保證(QoS over All-IP Networks) 7
1.4 UMTS服務等級(UMTS QoS Service Class) 7
1.5 QoS管理方法(QoS Management) 9
1.5.1 Integrated Service 10
1.5.2 Differentiated Service 10
1.6 研究動機及目的(Motivation and Research Objective) 11
1.7 解決方案(Solution Approach) 12
1.8 論文組織結構 13
第二章、 相關研究(RELATED WORK) 14
2.1 QoS管理架構(QoS Management Architecture) 14
2.1.1 Integrated Service 14
2.1.2 Differentiated Service 15
2.1.3 TEQUILA 19
2.1.4 分散式管理架構(Victor O.K. Li’s System) 20
2.2 評論(Summary) 22
第三章、 以預算為基礎之服務品質保證(BUDGET-BASED QOS) 24
3.1 BBQ架構(Budget-Based QoS Framework) 25
3.1.1 簡化的All-IP網路架構(A Simplified All-IP Network Architecture) 25
3.1.2 以預算為基礎之管理(Budget-Based Management) 26
3.1.3 路徑定義(Path Definitions) 27
3.1.4 承載服務架構(Bearer Service Architecture) 28
3.1.5 服務品質熵數(Quality Entropy) 29
3.1.6 即時資源分配與預先資源管理(Pre-Planning vs. On Demand Allocation) 31
3.1.7 集中式與分散式資源配置(Centralized vs. Distributed Resource Allocations) 31
3.1.8 需求預測(Traffic Forecast) 33
3.2 管理系統架構(Management System Architecture for BBQ) 34
3.2.1 BBQ管理系統假設(BBQ System Assumptions) 34
3.2.2 分散式分層管理系統(Distributed Management System Hierarchy) 34
3.2.3 管理系統軟體架構(Management System Software Architecture) 35
3.2.4 簡化的端對端服務品質建立流程(A Simplified End-to-End Path Setup Procedure) 37
第四章、 以預算為基礎之端對端服務品質保證(END-TO-END QOS FOR BBQ) 38
4.1 資源保留/分配(Resource Reservation/Allocation) 38
4.1.1 保留時間範圍(Reservation Time Frame) 39
4.1.2 保留等級(Reservation Certainty) 40
4.1.3 資源保留方案(Resource Reservation Scheme) 42
4.1.4 端對端資源保留之計價方案(Charging Scheme) 45
4.1.4.1 符號定義(Notation Definition) 46
4.1.4.2 累進計價(Progressive Charging) 46
4.2 訊務流集合需求預測(Traffic Aggregate Demand Forecast) 49
4.3 服務品質熵數預算分配(Quality Entropy Budget Allocation) 50
4.4 Long Path 規劃(Long Path Planning) 52
4.5 端對端服務品質保證規劃元件,LPPA(End-to-End QoS Component, LPPA) 54
4.5.1 集中式與分散式規劃(Centralized vs. Distributed Plannings) 57
4.5.2 整體規劃LPPA(Global Planning LPPA) 58
4.5.3 本地規劃LPPA(Local Planning LPPA) 60
4.6 端對端服務品質保證規劃元件,Global ACA(End-to-End QoS Component, Global ACA) 62
4.7 端對端服務品質保證工作流程(End-to-End QoS Procedure) 63
4.7.1 Long Term Soft資源保留(Long Term Soft Reservation) 66
4.7.2 Short Term Soft資源保留(Short Term Soft Reservation) 67
4.7.3 即時資源保留(Real-time Hard Reservation) 69
4.8 LPPA最佳化模型(LPPA Optimization Model) 71
4.8.1 問題描述(Problem Statement) 72
4.8.2 最佳化模型(Optimization Model) 73
4.8.3 非線性目標整數規劃(Nonlinear Goal Mixed Integer Programming) 74
第五章、 效能評估(PERFORMANCE EVALUATION) 80
5.1 效能評估指標(Performance Evaluation Metrics) 81
5.1.1 Long Term Soft資源保留階段(Long Term Soft Reservation) 81
5.1.1.1 資源保留成本(Resource Reservation Cost) 81
5.1.1.2 服務達成率(Satisfaction Ratio) 82
5.1.2 Real Time Hard資源保留階段(Real Time Hard Reservation) 83
5.1.2.1 訊務要求拒絕率(Blocking Ratio) 83
5.2 實驗設計(Experiment Design) 83
5.2.1 實驗環境(Experiment Environment) 83
5.2.1.1 BBQ Computational Simulator 84
5.2.2 實驗測試組產生(Test Instance Generation) 84
5.2.2.1 網路拓樸之產生(Network Topology Generation) 84
5.2.2.2 訊務實驗組產生(Traffic Request Generation) 85
5.2.3 實驗(Experiments) 86
5.3 實驗結果(Experiment Results) 87
5.3.1 實驗一 、訊務流集合預測需求量之敏感度測試(Traffic Aggregate Forecast Test) 87
5.3.1.1 對資源保留成本之影響(Sensitivity to Resource Reservation Cost) 88
5.3.1.2 對服務達成率之影響(Sensitivity to Satisfaction Ratio) 90
5.3.2 實驗二、網路連接率之敏感度測試(Network Connectivity Test) 91
5.3.2.1 對資源保留成本之影響(Sensitivity to Resource Reservation Cost) 92
5.3.2.2 對服務達成率之影響(Sensitivity to Satisfaction Ratio) 94
5.3.3 實驗三、預測誤差之敏感度測試(Forecast Error) 95
5.3.3.1 對訊務要求拒絕率之影響(Sensitivity to Blocking Ratio) 98
5.4 實驗總論(Experiment Summary) 101
第六章、 結論(CONCLUSION) 102
6.1 結論(Conclusion) 102
6.2 未來展望(Future Work) 103



圖目錄

圖1. 1:各UMTS服務類別對三大品質指標之容忍度。 8
圖2. 1:DIFFSERV DOMAIN & NON-DIFFSERV DOMAIN。 16
圖2. 2:TEQUILA架構。 19
圖2. 3:分散式管理架構。 21
圖3. 1:簡化的全IP網路架構。 26
圖3. 2:端對端承載服務。 29
圖3. 3:服務品質熵數與品質參數對應。 30
圖3. 4:BBQ管理系統軟體元件架構。 36
圖3. 5:簡化的端對端服務品質建立流程。 37
圖4. 1:保留時間範圍。 39
圖4. 2:保留等級。 41
圖4. 3:SHORT TERM SOFT資源保留頻寬單價。 47
圖4. 4:REAL TIME資源保留頻寬單價。 48
圖4. 5:第一階段之服務品質熵數預算分配。 51
圖4. 6:端對端路徑示意圖。 53
圖4. 7:LPPA規劃能力分類。 57
圖4. 8:總體規劃LPPA。 59
圖4. 9:本地規劃LPPA。 60
圖4. 10:端對端服務品質保證程序。 64
圖4. 11:LONG TERM SOFT資源保留元件互動圖。 66
圖4. 12:SHORT TERM SOFT資源保留元件互動圖。 67
圖4. 13:REAL TIME HARD資源保留元件互動圖。 69
圖4. 14:REAL TIME HARD資源保留流程圖。 70
圖4. 15:REAL TIME HARD資源保留虛擬碼。 71
圖4. 16:骨幹網路示意圖。 73
圖5. 1:訊務流集合需求總量對資源保留成本之影響(1)。 88
圖5. 2:訊務流集合需求總量對資源保留成本之影響(2)。 89
圖5. 3:訊務流集合需求總量對服務達成率之影響(1)。 90
圖5. 4:訊務流集合需求總量對服務達成率之影響(2)。 91
圖5. 5:網路連接率對服務保留成本之影響(1)。 92
圖5. 6:網路連接率對服務保留成本之影響(2)。 93
圖5. 7:網路連接率對服務達成率之影響(1)。 94
圖5. 8:網路連接率對服務達成率之影響(2)。 95
圖5. 9:不同訊務流集合需求變化。 97
圖5. 10:測試組於不同預測誤差之標準差變化。 97
圖5. 11:預測誤差對服務拒絕率之影響(1)。 98
圖5. 12:預測誤差對服務拒絕率之影響(2)。 98
圖5. 13:預測誤差對服務拒絕率之影響(3)。 99
圖5. 14:預測誤差對服務拒絕率之影響(4)。 99
圖5. 15:預測誤差對服務拒絕率之影響(5)。 100


表格目錄

表1. 1:各種新興的網路技術。 2
表1. 2:傳統電信網路,網路網路和整合型網路特性比較表。 3
表1. 3:CIRCUIT-SWITCHING 與 PACKET-SWITCHING 網路特性比較。 5
表1. 4:UMTS 品質分類及與各項特性。 9
表1. 5:UMTS QOS與 DIFFSERV QOS間之服務對應。 9
表2. 1:各種PHB的服務範例。 17
表3. 1:分層之路徑定義。 28
表3. 2:BBQ管理系統層級分工。 35
表4. 1:資源保留方案。 42
表4. 2:各式資源保留方案比較。 45
表4. 3:計價方案符號定義表。 46
表4. 4:LPPA之輸入及輸出參數。 54
表4. 5:LONG PATH 路由表 。 56
表5. 1:實驗數值範圍表。 86
表5. 2:實驗目標表。 87
zh_TW
dc.format.extent 21314 bytes-
dc.format.extent 39783 bytes-
dc.format.extent 95541 bytes-
dc.format.extent 229365 bytes-
dc.format.extent 555018 bytes-
dc.format.extent 1445128 bytes-
dc.format.extent 965248 bytes-
dc.format.extent 29039 bytes-
dc.format.extent 34380 bytes-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.format.mimetype application/pdf-
dc.language.iso en_US-
dc.source.uri (資料來源) http://thesis.lib.nccu.edu.tw/record/#G0090753015en_US
dc.subject (關鍵詞) 服務品質保證zh_TW
dc.subject (關鍵詞) 全IP網路zh_TW
dc.subject (關鍵詞) 路由zh_TW
dc.subject (關鍵詞) QoSen_US
dc.subject (關鍵詞) All-IP Networken_US
dc.subject (關鍵詞) Routingen_US
dc.title (題名) 全IP網路中以預算為基礎之端對端服務品質管理zh_TW
dc.title (題名) Budget-Based End-to-End QoS Management for All-IP Networksen_US
dc.type (資料類型) thesisen
dc.relation.reference (參考文獻) Referencezh_TW
dc.relation.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.zh_TW
dc.relation.reference (參考文獻) 【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.zh_TW
dc.relation.reference (參考文獻) 【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.zh_TW
dc.relation.reference (參考文獻) 【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.zh_TW
dc.relation.reference (參考文獻) 【5】 D. Awduche, J. Malcolm, J. Agogbua, M. O`Dell and J. McManus, ""Requirements for Traffic Engineering Over MPLS``, RFC 2702, September 1999.zh_TW
dc.relation.reference (參考文獻) 【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.zh_TW
dc.relation.reference (參考文獻) 【7】 E. Rosen and Y. Rekhter, ""BGP/MPLS VPN``, RFC 2547, March 1999.zh_TW
dc.relation.reference (參考文獻) 【8】 A. S. Tanenbaum, ""Computer Networks, Third Edition``, Prentice Hall, March 1996, pp. 345-366.zh_TW
dc.relation.reference (參考文獻) 【9】 Dijkstra, E.W., ""A Note on Two Problems in Connection with Graphs``, Numerische Math, vol. 1, March 1959, pp. 269-271.zh_TW
dc.relation.reference (參考文獻) 【10】 C. Hedrick, ""Routing Information Protocol``, RFC 1058, June 1988.zh_TW
dc.relation.reference (參考文獻) 【11】 J. Moy, ""OSPF version 2``, RFC 1583, March 1994.zh_TW
dc.relation.reference (參考文獻) 【12】 Christophe Beaujean, ""Delay-Based Routing Issues in IP Networks``, contact GRADIENT CR/98/148, May 2000.zh_TW
dc.relation.reference (參考文獻) 【13】 Douglas S.Reeves and Hussein F. Salama, ""A Distributed Algorithm for Delay-Constrained Unicast Routing``, IEEE Transaction on Network, April 2000.zh_TW
dc.relation.reference (參考文獻) 【14】 R. Braden, L. Zhang, S. Berson, S. Herzog and S. Jamin, ""Resource Reservation Protocol (RSVP) – Version 1 Functional Specification``, RFC 2205, September 1997.zh_TW
dc.relation.reference (參考文獻) 【15】 K. Chan, R. Sahita, S. Hahn and K. McCloghrie, ""Differentiated Services Quality of Service Policy Information Base ``, RFC 3317, March 2003.zh_TW
dc.relation.reference (參考文獻) 【16】 Bill Goodman, ""Internet Telephony and Modem Delay``, IEEE Network, May 1999, pp. 8-16.zh_TW
dc.relation.reference (參考文獻) 【17】 J. Garcia-Luna-Aceves and J. Behrens, ""Distributed scalable routing based on vectors of link states``, IEEE J. Select on Communication, October 1995.zh_TW
dc.relation.reference (參考文獻) 【18】 Jon Postel, ""Internet Protocol``, RFC 791, September 1981.zh_TW
dc.relation.reference (參考文獻) 【19】 Mark A. Sportack, ""IP Routing Fundamentals``, Cisco ISBN: I-57870-071-x, May 1999.zh_TW
dc.relation.reference (參考文獻) 【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.zh_TW
dc.relation.reference (參考文獻) 【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.zh_TW
dc.relation.reference (參考文獻) 【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.zh_TW
dc.relation.reference (參考文獻) 【23】 Z. Wang and J. Crowcroft, ""Quality of Service Routing for Supporting Multimedia Applications``, IEEE Select on Communication, September 1996.zh_TW