| dc.contributor.advisor | 連耀南 | zh_TW |
| dc.contributor.advisor | Lien, Yao-Nan | en_US |
| dc.contributor.author (作者) | 林岳生 | zh_TW |
| dc.contributor.author (作者) | Lin, Yue-Sheng | en_US |
| dc.creator (作者) | 林岳生 | zh_TW |
| dc.creator (作者) | Lin, Yue-Sheng | en_US |
| dc.date (日期) | 2005 | en_US |
| dc.date.accessioned | 11-九月-2009 16:02:58 (UTC+8) | - |
| dc.date.available | 11-九月-2009 16:02:58 (UTC+8) | - |
| dc.date.issued (上傳時間) | 11-九月-2009 16:02:58 (UTC+8) | - |
| dc.identifier (其他 識別碼) | G0092753013 | en_US |
| dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/29678 | - |
| dc.description (描述) | 碩士 | zh_TW |
| dc.description (描述) | 國立政治大學 | zh_TW |
| dc.description (描述) | 資訊科學學系 | zh_TW |
| dc.description (描述) | 92753013 | zh_TW |
| dc.description (描述) | 94 | zh_TW |
| dc.description.abstract (摘要) | 現有大多數的QoS 繞徑演算法，均假設鏈結上的參數是固定的，而依據固定鏈結參數的條件，尋求最佳的繞徑。實際上鏈結上能保證的服務品質與鏈結實際的負載有關。如果鏈結的所承諾提供的服務品質及所承諾之負載，在最大容量維持不變的條件下，可以由繞徑程式自由選擇的話，繞徑程式可能可以做更好的路徑規劃。 本研究在BBQ (Budget-Based QoS)的架構下，期望藉由事先規劃鏈結上的參數設定，以提供較具彈性的路由規劃，提升整體網路的效能，幫助營運者靈活可擴展的管理網路，以到達營運者的營運目標。由於加入參數的調變，使得繞徑問題變的更為複雜，在本文中，我們設計了兩套不同的爬山式搜尋演算法，經反覆的模擬測試，發現本研究的方式的確能提供較佳的網路規劃。 | zh_TW |
| dc.description.abstract (摘要) | Most of current QoS routing algorithms assume fixed network parameters, such as guaranteed service quality and bandwidth capacity. In fact, guaranteed quality of links is load dependent. Assuming that the maximum capacity of each link is limited, if the guaranteed quality and bandwidth capacity can be chosen by a routing algorithm, then the routing algorithm may find better paths. For example, guaranteed quality could be improved by using lower capacity on the link or by using the maximum capacity with poor guarantee quality. Our research is based on BBQ (Budget-Based QoS) management architecture. We preplan the parameters on each link before routing. This method provides flexible routing options thereby increasing the total profit. We tested two different approaches of allocating parameters on each link. After several simulations, we found that these approaches that we developed could result in better network resource utilization and increase profit for the operator. | en_US |
| dc.description.tableofcontents | 第一章 簡介 1 1.1 電信與電腦網路整合的趨勢 1 1.2 封包網路上乘載具時效性應用之問題 2 1.3 網路服務品質管理方法 2 1.4 BBQ架構中的繞徑問題 4 1.5 研究動機與目的 4 第二章 相關研究 6 2.1以預算為基礎之服務品質保證(Budget-Based QoS Management) 6 2.1.1 BBQ的設計理念 6 2.1.1.1 以Class區別的服務策略(Class Based Service Policies) 6 2.1.1.2以預算為基礎之管理(Budget Based QoS Management) 6 2.1.1.3 端對端服務品質保證(End-to-End QoS Management) 7 2.1.2 承載服務架構(Bearer Service Hierarchy) 7 2.1.3 服務品質保證的層級架構(QoS Management Hierarchy) 8 2.1.4預先資源管理與即時資源分配(Pre-Planning vs. On-Demand Managements) 9 2.2 核心網路的服務品質管理(QoS Management for Core Networks) 10 2.2.1 核心網路內路徑規劃運作流程 10 2.2.2 路徑規劃最佳化 11 2.2.3 Greedy Algorithm for Path Planning(GPPA) 11 2.2.4 演算法複雜度分析 11 2.3繞徑問題相關研究 12 2.3.1傳統繞徑方法 12 2.3.1.1廣播式繞徑方法 (Flooding) 12 2.3.1.2 最短路徑演算法 (Shortest Path Routing) 12 2.3.1.3 訊務基礎路徑演算法 (Flow-based Routing) 12 2.3.1.4 距離向量繞徑演算法 (Distance Vector Routing) 13 2.3.1.5 鏈結狀態繞徑方法 (Link State Routing) 13 2.3.2 具服務品質保證之繞徑方法 (Multi-Constrained Path) 13 2.3.3 繞徑方法之評論 14 第三章 核心網路的品質預算之配置及路徑規劃 15 3.1 品質定義 16 3.2 Capacity-Quality Pair 17 3.3 最佳化模型 17 3.4 解決方法 20 第四章 路徑規劃演算法 21 4.1 Hill-Climbing Path Planning Algorithm - Capacity-First 22 4.1.1 以最大容量開始規劃 22 4.1.2 CQ Pair Selection 23 4.1.3 獲利下降 25 4.1.4 HPPA-CF流程 26 4.2 Hill-Climbing Path Planning Algorithm - Capacity-First 29 4.2.1 由選擇最大Quality開始規劃 29 4.2.2 CQ Pair Selection 30 4.2.3 獲利下降 31 4.2.4 HPPA-QF 31 4.3 複雜度分析 34 4.4 小結 34 第五章 效能評估 35 5.1 效能評估指標 35 5.2 實驗設計 36 5.2.1 實驗工具 36 5.2.2 實驗測試組產生方式 36 5.2.3 訊務產生方式 36 5.3 實驗一 : GPPA、HPPA-CF與HPPA-QF的獲利比較 37 5.3.1 實驗目標 37 5.3.2 實驗流程 37 5.3.3 實驗結果分析 40 5.4 實驗二 : 預測誤差對於獲利之影響 50 5.4.1 實驗目標 50 5.4.2 實驗流程 50 5.4.3 實驗結果分析 52 第六章 總結 55 參考文獻(References) 56 | zh_TW |
| dc.language.iso | en_US | - |
| dc.source.uri (資料來源) | http://thesis.lib.nccu.edu.tw/record/#G0092753013 | en_US |
| dc.subject (關鍵詞) | 服務品質保證 | zh_TW |
| dc.subject (關鍵詞) | 資源規劃 | zh_TW |
| dc.subject (關鍵詞) | 繞徑規劃 | zh_TW |
| dc.subject (關鍵詞) | QoS | en_US |
| dc.subject (關鍵詞) | Resource allocation | en_US |
| dc.subject (關鍵詞) | Path Planning | en_US |
| dc.subject (關鍵詞) | Routing | en_US |
| dc.title (題名) | 在All-IP核心網路上的品質預算之配置及路徑規劃 | zh_TW |
| dc.title (題名) | QoS Budget Allocation and Path Planning in All-IP Core Network | en_US |
| dc.type (資料類型) | thesis | en |
| 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., Oct. 1999. | zh_TW |
| dc.relation.reference (參考文獻) | [2] Xiao, X., L. -M. Ni, "Internet QoS: A Big Picture", IEEE Network, vol. 13, no. 2, pp. 8-18, Mar./Apr. 1999. | zh_TW |
| dc.relation.reference (參考文獻) | [3] Miras, D., "Network QoS Needs of Advanced Internet Applications", Internet2 - QoS Working Group, Nov. 2002. | zh_TW |
| dc.relation.reference (參考文獻) | [4] Pascal Lorenz, "Quality of service and new architectures for future telecommunications networks", MILCOM 2000 - IEEE Military Communications Conference, no. 1, pp. 695-698, Oct. 2000. | zh_TW |
| dc.relation.reference (參考文獻) | [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, pp. 139-154, Apr. 2002. | zh_TW |
| dc.relation.reference (參考文獻) | [6] Mahbubul Alam, Ramjee Prasad, John R. Farserotu, "Quality of service among IP-based heterogeneous networks", IEEE Personal Communications, vol. 8, no. 6, pp. 18-24, Dec. 2001. | zh_TW |
| dc.relation.reference (參考文獻) | [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, pp. 1187-1192, Sep. 2000. | zh_TW |
| dc.relation.reference (參考文獻) | [8] E. Crawley, Editor, L. Berger, S. Berson, "A Framework for Integrated Services and RSVP over ATM", IETF RFC 2382, Aug. 1998. | zh_TW |
| dc.relation.reference (參考文獻) | [9] D. Black, M. Carlson, E. Davies, Z. Wang, "An Architecture for Differentiated Services", IETF RFC 2475, Dec. 1998. | zh_TW |
| dc.relation.reference (參考文獻) | [10] Yao-Nan Lien, Hung-Ching Jang, Tsu-Chieh Tsai and Hsing Luh, 2005, "Budget Based QoS Management Infrastructure for All-IP Networks", Proceedings of the IEEE 25th International Conference on Advanced Communication Technology (ICACT2005), NSC 92-2219-E-004-001, Feb. 21-23. 2005. | zh_TW |
| dc.relation.reference (參考文獻) | [11] Yao-Nan Lien, Tsung-Hsung Li, "Path Planning in Budget-Based QoS Management for All-IP Core Networks", NCCU-CS Tech. Report, Sep. 2003. | zh_TW |
| dc.relation.reference (參考文獻) | [12] Q. Ma and P. Steenkiste, "On path selection for traffic with bandwidth guarantees," In Proceedings of IEEE International Conference on Network Protocols, Atlanta, GA, Oct. 1997. | zh_TW |
| dc.relation.reference (參考文獻) | [13] Z. Wang and J. Crowcroft, "Bandwidth-delay based routing algorithms", Proceedings of IEEE GLOBECOM`95, Nov. 1995. | zh_TW |
| dc.relation.reference (參考文獻) | [14] A. S. Tanenbaum, "Computer Networks," 4th edition, Prentice Hall, 2002. | zh_TW |
| dc.relation.reference (參考文獻) | [15] J. J. Garcia-Luna-Aceves, A minimum-hop routing algorithm bases on distributed information, Computer Networks and ISDN Systems, vol. 16 no. 5, pp. 367-382, May 1989. | zh_TW |
| dc.relation.reference (參考文獻) | [16] J.M. Jaffe and F.M. Moss, "A Responsive Routing Algorithm for Computer Networks", IEEE Transactions on Communications, vol. 30, no. 7, pp. 1758-1762, July 1982. | zh_TW |
| dc.relation.reference (參考文獻) | [17] Dijkstra, E. W. "A Note on Two Problems in Connection with Graphs." Numerische Math, vol. 1, pp.269-271, 1959. | zh_TW |
| dc.relation.reference (參考文獻) | [18] J. J. Garcia-Luna-Aceves, "A Unified Approach to Loop-Free Routing Using Distance Vectors or Link States", Symposium proceedings on Communications architectures & protocols, pp.212-223, Sep. 25-27, 1989. | zh_TW |
| dc.relation.reference (參考文獻) | [19] J. McQuillan and D.C Walden, "The ARPANET Design Decisions," Computer Networks, vol. 1, Aug. 1977. | zh_TW |
| dc.relation.reference (參考文獻) | [20] C. Hedrick, "Routing Information Protocol", IETF RFC 1058, June 1988. | zh_TW |
| dc.relation.reference (參考文獻) | [21] J. Moy, "OSPF Version 2", IETF RFC 2328, Apr. 1998 | zh_TW |
| dc.relation.reference (參考文獻) | [22] G. Feng, K. Makki, N. Pissinou, C. Douligeris, "An efficient heuristic for delay-cost-constrained QoS routing", IEEE International Conference on Communications, vol. 8, pp. 2603-2607, 2001. | zh_TW |
| dc.relation.reference (參考文獻) | [23] Q. Ma and P. Steenkiste, "On path selection for traffic with bandwidth guarantees", In Proceedings of IEEE International Conference on Network Protocols, Atlanta, Oct. 1997. | zh_TW |
| dc.relation.reference (參考文獻) | [24] Turgay Korkmaz, and Marwan Krunz, "Multi-Constrained Optimal Path Selection", IEEE INFOCOM 2001, pp. 834-843, 2001. | zh_TW |
| dc.relation.reference (參考文獻) | [25] Yao-Nan Lien and Yu-Sheng Huang, 2004, "Delay Sensitive Routing for High Speed Packet-Switching Networks", Proceedings of the IEEE International Conference Networking, Sensing, and Control, Mar. 2004. | zh_TW |
| dc.relation.reference (參考文獻) | [26] Yao-Nan Lien, Chien-Tung Chen, "Budget-Based End-to-End QoS Management for All-IP Networks", NCCU-CS Tech. Report, Sep. 2003. | zh_TW |
| dc.relation.reference (參考文獻) | [27] Yao-Nan Lien, Ming-Chih Chen, "Distributed Resource Management and Admission Control in Budget-Based QoS Management for All-IP Core Networks ", NCCU-CS Tech. Report, Sep. 2003. | zh_TW |
| dc.relation.reference (參考文獻) | [28] Yao-Nan Lien, Yi-Ming Chen, "Forecasting Error Tolerable Resource Allocation in Budget-Based QoS Management for All-IP Core Networks", NCCU-CS Tech. Report, Sep. 2003. | zh_TW |
| dc.relation.reference (參考文獻) | [29] Ossama Younis and Sonia Fahmy, Purdue University, "Constraint-Based Routing in the nternet: Basic Priciples and Recent Research", IEEE COMMUNICATIONS SURVEYS, vol. 5, no. 1, Third Quarter 2003. | zh_TW |
| dc.relation.reference (參考文獻) | [30] Y. Yang, J. Muppala, S. Chanson. "Quality of Service Routing Algorithms for Bandwidth-Delay Constrained Applications", ICNP, pp. 62, Ninth International Conference on Network Protocols (ICNP`01), 2001. | zh_TW |
| dc.relation.reference (參考文獻) | [31] Turgay Korkmaz,and Marwan Krunz, "Bandwidth-Delay Constrained Path Selection Under Inaccurate State Information", IEEE/ACM TRANSACTIONS ON NETWORKING, vol.11, no. 3, June 2003. | zh_TW |
