![]() |
|
以作者查詢圖書館館藏 、以作者查詢臺灣博碩士 、以作者查詢全國書目 、勘誤回報 、線上人數:19 、訪客IP:3.149.247.153
姓名 黃建欽(Jian-Chin Huang) 查詢紙本館藏 畢業系所 通訊工程學系 論文名稱 標籤交換網路下具有服務品質路由安排之研究
(A Study of QoS Path Assignment in the MPLS Network)相關論文 檔案 [Endnote RIS 格式]
[Bibtex 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
[檢視]
[下載]
- 本電子論文使用權限為同意立即開放。
- 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
- 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
摘要(中) 網際網路(Internet)的迅速發展及使用人數的遞增,有效率地頻寬配置管理和服務品質的提供是目前網際網路所要面臨的重要問題。近幾年,由網際網路標準制定組織(Internet Engineering Task Force,IETF)所提出的多重協定標籤交換技術(Multi-protocol Label Switching,MPLS)是為實現未來寬頻網際網路的可行方法,MPLS整合各種IP交換技術的優點,引入標籤(Label)的觀念,來提升整體網路的運作效率,比起傳統網路更具彈性及擴充性。MPLS明確路由安排機制可使整體網路資源的利用理想化,更可提供較佳的服務品質(QoS)支援。本論文的主要研究重點在探討MPLS網路的標籤交換路徑的安排(LSP Assignment),並考量不同服務等級路徑特性,將資源作有效的分配,以期達到不同連線服務之需求。LSP路由演算法於本論文中列舉Best-fit Shortest Path Algorithm (BSP)以及Worst-shortest Path Algorithm (WSP)兩種演算法,並針對不同等級的服務分別來做路徑選擇模擬之比較。經由考慮優先權安排LSP,希望可以達到服務品質之保障。而為讓網路中的鏈結(Link)頻寬的分配更具效率,在論文中亦提出伸縮限制頻寬(Elastic Constrained Bandwidth)的配置方式,由模擬結果得知,此配置方式可有效紓解高優先權路徑過於集中之缺點。在文中亦說明利用最小切割演算法計算最小切割來尋求減少網路關鍵路段負載,降低網路壅塞情形產生。 摘要(英) The paper works on bandwidth-constrained QoS routing looks for one feasible path that meets a certain bandwidth requirement. Internet Engineering Task Force (IETF) Multi-protocol Label Switching (MPLS) standard has made explicit routes practicable and improves network utilization. In other words, by using MPLS techniques it is possible to set up explicit routes for data flows that are constrained by path, resource availability and requested Quality of Service. In this article, we discuss two path routing algorithms for MPLS LSP Assignment. We termed them as Best-fit shortest path algorithm (BSP) and Worst-shortest path algorithm (WSP). In order to guarantee high-priority services, we will find the best one of path routing algorithms for setting up the path of high-priority services. We make a comparison between these path routing algorithms for the two types of services (Guaranteed service and Control-load service). Then we also propose a link-sharing method, Elastic Constrained Bandwidth. The experimental results indicate that the method solves the problem that high priority LSPs concentrate on some links. We then describe what the Minimum-Cut algorithm is and how to separate a network into two parts. By using the Minimum-Cut algorithm, we could easily calculate the Minimum-cut links, which we termed critical links, and decrease the complexity of a network. We expect that these above algorithms could accomplish the QoS performance and further the utility of a network. 關鍵字(中) ★ 服務品質
★ 標籤交換路徑安排關鍵字(英) ★ QoS
★ LSP論文目次 目錄 ………………………………………………………… I
圖目錄 …………………………………………………………… III
表目錄 …………………………………………………………… VI
第一章 緒論……………………………………………………… 1
1.1. 簡介………………………………………………… 1
1.2. 研究動機…………………………………………… 2
1.3. 論文架構介紹……………………………………… 3
第二章 相關研究背景…………………………………………… 5
2.1. MPLS技術之簡介………………………….………... 5
2.1.1. 網路演進簡述………………………………… 5
2.1.2. 多重協定標籤交換技術…………………….... 6
2.1.3. MPLS基本運作………………………………. 9
2.1.4. 標籤指定…………………………….………... 11
2.1.5. MPLS的應用發展……………………………. 12
2.2. 服務品質保證之探討………………………………... 14
2.2.1. IntServ與DiffServ比較……………………… 15
2.2.2. 路由及動態資源分配………………………… 17
第三章 演算法及模擬架構………………………………………... 20
3.1. LSP路由安排演算法………………………………… 20
3.1.1. Best-fit shortest path algorithm (BSP)………… 20
3.1.2. Worst-shortest path algorithm (WSP)………… 23
3.1.3. BSP與WSP之探討…………………………… 26
3.2. 最小切割演算法 (Minimum Cut Algorithm)……… 28
3.2.1. 最大流量/最小切割問題……………………… 28
3.2.2. The Stoer-Wagner Algorithm………………….. 29
3.2.3. 尋求最小切割之範例…………………………. 32
3.3. 伸縮限制頻寬之方法………………………………... 36
3.4. 模擬架構……………………………………………... 38
3.4.1. 模擬參數定義………………………………….. 39
3.4.2. 模擬方案……………………………………….. 40
第四章 模擬結果與討論…………………………………………... 44
4.1. 符號註解……………………………………………... 44
4.2. 模擬結果分析………………………………………... 45
4.2.1. 模擬方案一之討論……………………………. 45
4.2.2. 模擬方案二之討論……………………………. 46
4.2.3. 模擬方案三之討論……………………………. 47
4.2.4. 模擬方案四之討論……………………………. 48
4.2.5. 模擬方案五之討論…………….……………… 49
4.2.6. 模擬方案六之討論……………………………. 51
第五章 結論與未來研究…………………………………………... 84
參考文獻…………………………………………………………….. 86參考文獻 [1] Zheng Wang, "Internet QoS: Architectures and Mechanisms for Quality of Service", Morgan Kaufmann Publishers, 2001, ISBN 1-55860-608-4.
[2] Davie, Bruce, Paul Doolan, and Yakov Rekhter, "Switching in IP Networks: IP Switching, Tag Switching and Related Technologies". San Francisco: Morgan Kaufmann, 1998, ISBN 1-55860-505-3.
[3] Bruce Davie, and Yakov Rekhter, "MPLS Technology and Applications", Morgan Kaufmann Publication, 2000, ISBN 1-55860-656-4.
[4] E. Rosen, et al., " Multiprotocol Label Switching Architecture ", IETF RFC 3031, January 2001.
[5] 傅昌五,李運欽,”MPLS技術之研究A Study on the MPLS Technology” 電信研究雙月刊第29卷第5期, Oct 1999.
[6] Xipen Xiao and Lionel M. Ni. , “Internet QoS: the Big Picture”. IEEE Network, March/April 1999, pp. 8 –18.
[7] X. Xiao, A. Hannan, and B. Bailey, Lionel M. Ni, ”Traffic Engineering with MPLS in the Internet,” IEEE Network, Mar./Apr. 2000, pp.28-33.
[8] Andersson et al., "LDP Specification", RFC 3036, January 2001.
[9] Shenker, S., Partridge, C. and R. Guerin, "Specification of Guaranteed Quality of Service", RFC 2212, September 1997.
[10] Wroclawski, J., "Specification of the Controlled Load Network Element Service", RFC 2211, September 1997.
[11] 林盈達,”寬頻網際網路品質的解決方案”, 網路通訊雜誌101期,1999年 12 月。
[12] George Swallow, ”MPLS Advantages for Traffic Engineering,” IEEE Communications Magazine, Dec. 1999, pp. 54-57.
[13] Kodialam, M., and Lakshman, T. V., "Minimum Interference Routing with Applications to MPLS Traffic Engineering," In Proceedings of IEEE Conference on Computer Communications (IEEE Infocom 2000), New York, March 2000,pp.2566-2579.
[14] Keping Long, Zhongshan Zhang, Shiduan Cheng, ”Load balancing algorithms in MPLS traffic engineering,” Beijing University of Posts and Telecommunications, China. High Performance Switching and Routing, 2001 IEEE Workshop on , 2001, pp.175-179.
[15] S. Floyd, ”Link-Sharing and Resource Management Models for Packet Networks,” IEEE/ACM Transactions on Networking, vol.3, No.4, Aug. 1995, pp.356-386.
[16] Yoram B. , “The Complementary Roles of RSVP and Differentiated Services in the Full-Service QoS Network,” IEEE Communication Magazine, Feb. 2000, pp.154-162.
[17] Bongkyo Moon and Hamid Aghvami, “RSVP Extensions for Real-time Service in Wireless Mobile Networks”, IEEE Communication Magazine, vol12, Dec. 2001, pp.52-59.
[18] R.E Tarjan, “Data Structures and Network Algorithms”, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983
[19] M. Stoer and F. Wagner, “A simple mincut algorithm, ” Proc. of ESA94, Lecture Notes in Computer Science, 855, pp.141-147, 1994.
[20] X. Hao and J. B. Orlin,” A faster algorithm for finding the minimum cut in a graph,” 3rd ACM-SIAM Symposium on Discrete Algorithms, 1992, pp.165-174
[21] 吳森原譯, ”圖形論及其應用,” 國立編譯館出版,大專用書, 第11章, pp.252-267.
[22] 張紹勳、蔡志敏著,”演算法 入門與進階—使用C語言”,松崗電腦圖書資料有限公司,1991, ISBN: 957-22-0688-5,第七部份。指導教授 陳彥文(Yen-Wen Chen) 審核日期 2002-7-8 推文 plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
網路書籤 Google bookmarks
del.icio.us
hemidemi
myshare