政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/29678

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/29678

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文笔数/总笔数 : 113648/144635 (79%)
造访人次 : 51622676 在线人数 : 538

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

搜寻范围

查询小技巧：

您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果

若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据

进阶搜寻

主页 ‧ 登入 ‧ 上传 ‧ 说明 ‧ 关于政大典藏 ‧ 管理

到手机版

政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 > Item 140.119/29678

请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/29678

题名:	在All-IP核心網路上的品質預算之配置及路徑規劃 QoS Budget Allocation and Path Planning in All-IP Core Network
作者:	林岳生 Lin, Yue-Sheng
贡献者:	連耀南 Lien, Yao-Nan 林岳生 Lin, Yue-Sheng
关键词:	服務品質保證資源規劃繞徑規劃 QoS Resource allocation Path Planning Routing
日期:	2005
上传时间:	2009-09-11 16:02:58 (UTC+8)
摘要:	現有大多數的QoS 繞徑演算法，均假設鏈結上的參數是固定的，而依據固定鏈結參數的條件，尋求最佳的繞徑。實際上鏈結上能保證的服務品質與鏈結實際的負載有關。如果鏈結的所承諾提供的服務品質及所承諾之負載，在最大容量維持不變的條件下，可以由繞徑程式自由選擇的話，繞徑程式可能可以做更好的路徑規劃。本研究在BBQ (Budget-Based QoS)的架構下，期望藉由事先規劃鏈結上的參數設定，以提供較具彈性的路由規劃，提升整體網路的效能，幫助營運者靈活可擴展的管理網路，以到達營運者的營運目標。由於加入參數的調變，使得繞徑問題變的更為複雜，在本文中，我們設計了兩套不同的爬山式搜尋演算法，經反覆的模擬測試，發現本研究的方式的確能提供較佳的網路規劃。 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.
參考文獻:	[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. [2] Xiao, X., L. -M. Ni, "Internet QoS: A Big Picture", IEEE Network, vol. 13, no. 2, pp. 8-18, Mar./Apr. 1999. [3] Miras, D., "Network QoS Needs of Advanced Internet Applications", Internet2 - QoS Working Group, Nov. 2002. [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. [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. [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. [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. [8] E. Crawley, Editor, L. Berger, S. Berson, "A Framework for Integrated Services and RSVP over ATM", IETF RFC 2382, Aug. 1998. [9] D. Black, M. Carlson, E. Davies, Z. Wang, "An Architecture for Differentiated Services", IETF RFC 2475, Dec. 1998. [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. [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. [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. [13] Z. Wang and J. Crowcroft, "Bandwidth-delay based routing algorithms", Proceedings of IEEE GLOBECOM`95, Nov. 1995. [14] A. S. Tanenbaum, "Computer Networks," 4th edition, Prentice Hall, 2002. [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. [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. [17] Dijkstra, E. W. "A Note on Two Problems in Connection with Graphs." Numerische Math, vol. 1, pp.269-271, 1959. [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. [19] J. McQuillan and D.C Walden, "The ARPANET Design Decisions," Computer Networks, vol. 1, Aug. 1977. [20] C. Hedrick, "Routing Information Protocol", IETF RFC 1058, June 1988. [21] J. Moy, "OSPF Version 2", IETF RFC 2328, Apr. 1998 [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. [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. [24] Turgay Korkmaz, and Marwan Krunz, "Multi-Constrained Optimal Path Selection", IEEE INFOCOM 2001, pp. 834-843, 2001. [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. [26] Yao-Nan Lien, Chien-Tung Chen, "Budget-Based End-to-End QoS Management for All-IP Networks", NCCU-CS Tech. Report, Sep. 2003. [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. [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. [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. [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. [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.
描述:	碩士國立政治大學資訊科學學系 92753013 94
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0092753013
数据类型:	thesis
显示于类别:	[資訊科學系] 學位論文

文件中的档案:

档案	大小	格式	浏览次数
index.html	0Kb	HTML2	585	检视/开启

在政大典藏中所有的数据项都受到原著作权保护.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - 回馈