跳到主要內容

臺灣博碩士論文加值系統

(18.204.48.64) 您好!臺灣時間:2021/08/04 18:48
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:汪威志
研究生(外文):Wei-Chih Wang
論文名稱:OSPF通訊網路之訊務工程與壅塞控制
論文名稱(外文):Traffic Engineering and Congestion Control in OSPF Networks
指導教授:溫于平溫于平引用關係
指導教授(外文):Ue-Pyng Wen
學位類別:碩士
校院名稱:國立清華大學
系所名稱:工業工程與工程管理學系
學門:工程學門
學類:工業工程學類
論文種類:學術論文
論文出版年:2004
畢業學年度:92
語文別:英文
論文頁數:57
中文關鍵詞:啟發式演算法鏈路權重值網路壅塞最佳化開放最短路徑優先協定訊務工程
外文關鍵詞:heuristic algorithmlink weightnetwork congestionoptimizationOSPF routingtraffic engineering
相關次數:
  • 被引用被引用:0
  • 點閱點閱:162
  • 評分評分:
  • 下載下載:24
  • 收藏至我的研究室書目清單書目收藏:0
在網際網路的環境中,開放最短路徑優先協定為最常被應用的協定之一,其隸屬於內部路由通訊協定,該協定的特色在於:以鏈路權重值來決定最短路徑,進而以最短路徑的方式傳送訊務。在該協定當中,訊務工程之主要目的著重在:透過已定義的目標函數式,來提升與最佳化網路的績效表現;其中,我們最常採取最小化「最大鏈路使用率」的目標式,來降低網路壅塞的情形。
本論文主要探討路徑選擇的模式建立,並針對不同的權重設定之方法加以比較。此外,文中我們提出一個啟發式演算法,其藉由最佳化鏈路權重的方式來解決路徑選擇的問題;依據實驗的結果,我們驗證了該演算法確實能達成負載平衡的成效,使網路資源能被有效地利用;我們同時也提出了一套系統化的程序,讓網路能根據最佳的權重設定與訊務配置,來管理與調整目前通訊協定中的權重值。
Open Shortest Path First (OSPF) is the most widely used Interior Gateway Protocol in IP networks. The OSPF protocol directs the Internet traffic along the shortest paths that are defined by the links weight. Traffic engineering is responsible for improving the network performance by optimizing the objective function that we give. The objective function that minimizes the maximal link utilization is usually adopted to avoid the network congestion.
The main concern of this thesis is to formulate the model of OSPF routing, and further evaluate the performance of different approaches. In addition, we propose a heuristic algorithm to solve the routing problems by optimizing OSPF weights. Experimental results indicate that the optimization algorithm could lead to good load balancing, and make efficient utilization of network resources. According to the best weights setting and the traffic allocation, we show how to manage and adjust the OSPF weights in a systematic procedure.
TABLE OF CONTENT

ABSTRACT i
TABLE OF CONTENT iv
LIST OF FIGURES vi
LIST OF TABLES vii
1. INTRODUCTION 1
1.1 Background 1
1.2 OSPF Routing Protocol 2
1.3 Purpose and Scope 5
1.4 Research Framework 6
2. LITERATURE REVIEW 8
2.1 Optimal Routing Problem 8
2.2 Characteristics of OSPF Routing 9
2.3 Measurement of Traffic Demands 11
2.4 Previous Solution Approaches 12
3. THE PROPOSED METHODS 17
3.1 Problem Statement 17
3.2 Notations and Formulation 17
3.3 Approaches of Weights Setting 20
4. EXPERIMENTAL DESIGN AND RESULTS 30
4.1 Experimental Design 30
4.2 Preliminary Test 31
4.3 Computational Test 37
4.4 Equal-Cost Multiple Paths 40
5. NUMERICAL EXAMPLE 41
5.1 An Illustrative Example 41
5.2 Computational Result 43
5.3 Traffic Engineering Framework 44
6. CONCLUSIONS AND DISCUSSION 47
REFERENCE 49
APPENDIX 52
[1] 曾春榮譯,「Cisco網路架構設計指南」,儒林,初版 [2000]。
[2] 張智勝譯,「TCP/IP互連網路」,全華,第四版 [2001]。
[3] 林班侯、林長毅譯,「IP選徑技術」,歐萊禮,初版 [2003]。
[4] Ahuja, R. K., T. L. Magnanti and J. B. Orlin, Network Flows, Prentice Hall, New Jersey (1993).
[5] Leben, J. and J. Martin, TCP/IP networking, Prentice Hall, New Jersey (1994).
[6] Bazaraa, M. S., J. J. Jarvis and H. D. Sherali, Linear Programming and Network Flows, second edition, John Wiley and Sons, New York (1997).
[7] Moy, J., “OSPF Version 2,” Internet Engineering Task Force (IETF), RFC 2328 (1998).
[8] Comer, D. E. and D. L. Stevens, Internetworking with TCP/IP, third edition, Prentice Hall, New Jersey (1999).
[9] Lewis, C., Cisco TCP/IP routing professional reference, McGraw-Hill, New York (2000).
[10] Fortz, B. and M. Thorup, “Internet Traffic Engineering by Optimizing OSPF Weights,” Proceedings of the INFOCOM’2000, 2, 519-528 (2000).
[11] Metz, C., “IP Protection and Restoration,” IEEE Internet Computing, 97-101 (2000).
[12] Ramakrishnan, K. G. and M. A. Roudrigues, “Optimal Routing in Shortest-path Data Networks, ” Lucent Bell Labs Technical Journal, 6, 117-138 (2001).
[13] Bhattacharyya, S., C. Diot, J. Jetcheva and N. Taft, “Pop-Level and Access- Link-Level Traffic Dynamics in a Tier-1 POP,” Proceedings of 1st ACM Sigcomm Internet Measurement Workshop (2001).
[14] Goralski, W. J., Juniper and Cisco routing, John Wiley, Indiana (2002).
[15] Pióro, M., Á. Szentesi, J. Harmatos, A. Jüttner, P. Gajowniczek and S. Kozdrowski, “On Open Shortest Path First Related Optimisation Problems,” Performance Evaluation, 48, Issue 1-4, 201-223 (2002).
[16] Fortz, B. and M.Thorup, “Optimizing OSPF/IS-IS Weights in a Changing World,” IEEE Journal on Selected Areas in Communications, 20, 756-767 (2002).
[17] Villamizar, C., “OSPF Optimized Multipath (OMP),” Internet Engineering Task Force, Internet-Draft (2002).
[18] Fortz, B., J. Rexford and M. Thorup, “Traffic Engineering with Traditional Routing Protocols,” IEEE Communications Magazine, 40, 118-124 (2002).
[19] Kalyanaraman, S., H. T. Kaur, S. Raghunath, J. Akella, H. Nagar and K. Chandrayana, “BANANAS: A New Connectionless Traffic Engineering Framework for the Internet,” Rensselaer Polytechnic Institute Technical Report, 1-14 (2002).
[20] Platt, D., “Improved Utilisation in IP Networks Using Multiple Path Routing”, ICCS2002 8th International Conference on Communication Systems, 1, 617-622 (2002).
[21] Abrahamsson, H., B. Ahlgren, J. Alonso, A. Andersson and P. Kreuger, “A Multi Path Routing Algorithm for IP Networks Based on Flow Optimisation,” Lecture Notes in Computer Science (LNCS), 2511 (2002).
[22] Harris, R., J. Murphy and R. J. Suryasaputra, “A Rapid Hot Spot Remover in OSPF networks,” presented at Australian Telecommunications, Networks and Applications Conference (2003).
[23] Kaur, H. T., Tao Ye, S. Kalyanaraman and K. S. Vastola, “Minimizing Packet Loss by Optimizing OSPF Weights Using Online Simulation,” presented at 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 79-86 (2003).
[24] Bhattacharyya, S., C. Diot, A. Nucci, B. Schroeder and N. Taft, “IGP Link Weight Assignment for Transient Link Failures,” presented at 18th international Teletraffic Congress (2003).
[25] Diot, C., R. Guérin and A. Sridharan, “Achieving Near-Optimal Traffic Engineering Solutions for Current OSPF/IS-IS Networks,” IEEE INFOCOM 2003, 2, 1167-1177 (2003).
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
1. 謝錦城(民87):運動、體適能與健康的認知。國民體育季刊,27(2),20-26。
2. 謝秀芳、鄭麗霞(民84):技職院校學生休閒活動參與狀況之研究。體育學報,20,123-134。
3. 鄭天爵(民83):青少年學生長假日(寒假、春假)自家外休閒活動特徵研究—以宜蘭農工專校五專低年級學生為例。宜蘭農工學報,9,185-199。
4. 廖榮利(民67):休閒生活與現代生活。國民體育季刊,7(1),12-17。
5. 黃振球(民59):休閒活動的理論與實施。教育學報創刊號,台北師範大學。
6. 彭淑美(民82):營利性運動休閒健身設施之經營管理。國民體育季刊,22(2),89-94。
7. 程紹同(民83):現代體育發展之新趨勢-運動休閒管理。中華體育,7(4),25-30。
8. 陳克宗(民87):大學體育課程的休閒性。國民體育季刊,27(3),38-42。
9. 許義雄(民69):休閒的意義、內容及其方法。體育學報,2,27-40。
10. 許義雄、張清龍(民67):我國大專青年休閒傾向調查研究。亞洲體育,1(3)。
11. 許天路(民82):私立南亞工專男女學生參與休閒運動狀況調查分析。南亞學報,13,173-211。
12. 張豐緒(民79):推廣休閒運動的意義與展望。體育與運動,67,1。
13. 張良漢、許志賢(民91)。休閒運動阻礙量表編製、信效度分析研究。國立臺灣體育學院學報,10,157-171。
14. 林素麗(民66):休閒的理論與研究。思與言雙月刊,15(1),27-35。
15. 李素馨(民86):都市女性休閒類型和休閒阻礙。戶外遊憩研究,10(1),43-68。