跳到主要內容

臺灣博碩士論文加值系統

(3.235.60.144) 您好!臺灣時間:2021/07/27 00:20
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:林國揚
研究生(外文):Kuo-Yang Lin
論文名稱:應用隨機預早凍結策略於動態光路徑繞路之研究
論文名稱(外文):The Research of Applying Random Early Blocking strategy to Dynamic Lightpath Routing
指導教授:張慶龍張慶龍引用關係
指導教授(外文):Ching-Lung Chang
學位類別:碩士
校院名稱:國立雲林科技大學
系所名稱:電子與資訊工程研究所碩士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2004
畢業學年度:92
語文別:中文
論文頁數:46
中文關鍵詞:WDM網路隨機預早凍結策略動態光路徑繞路
外文關鍵詞:Dynamic lightpath routingRandom Early BlockingWDM network
相關次數:
  • 被引用被引用:0
  • 點閱點閱:105
  • 評分評分:
  • 下載下載:2
  • 收藏至我的研究室書目清單書目收藏:0
在WDM光網路環境,對於動態訊務(Traffics)的連線要求,通常會在連線要求抵達時才動態建立光路徑以提高整體網路的使用效率。本論文主要研究如何設計一動態繞路演算法,其可依據動態訊務的要求,提供最合適的光路徑(lightpath),以降低整體之連線要求凍結率(blocking probability)。首先,我們以本實驗室之前提出之EWSCP演算法為基礎;其利用非線性網段權值來反應其負載,達到負載平衡為考量的繞路策略。配合Layered-Graph 轉換技巧,可將EWSCP及其它動態繞路演算法轉換成最短路徑演算法,應用在不同的WDM網路環境之動態繞路選擇,並利用電腦模擬比較不同的WDM網路拓樸與環境下,各個演算法在不同的網路負載下之優缺點。另外,本論文提出一「隨機預早凍結」(Random Early Blocking, REB)策略,其根據目前網路的負載大小與所選取來的光路徑長度,而給予一不同的凍結率,以避免整個WDM網路的資源被佔盡。模擬結果顯示,同樣的動態繞路演算法,若導入REB策略後,其網路效能可大幅提升,即其平均之連線凍結率有明顯的改善。
In order to use WDM network efficiently and effectively, a lightpath is established dynamically upon the arrival of a connection request. In this thesis, we aim to design of a dynamic routing algorithm which can base on the current network status to find a suitable light-path for the connection request. Thus the average system blocking probability is low.
In this thesis, we first apply a Layered-Graph transformation technique to the WDM network. Via this translation, the existed dynamic routing algorithms can be implemented by a simple Dijstra’s shortest path algorithm under different WDM network environments. Based on this technique, a computer simulation is applied to compare the EWSCP algorithm, a previous proposed algorithm [26], with other dynamic algorithms in different network topology and in different network loading. Furthermore, a Random Early Blocking strategy is proposed. It is randomly blocking the finding lightpath according to the current network loading and the hop-count of the lightpath. Simulation results reveal that all of the dynamic routing algorithms incorporated with the REB strategy have a great improve on the blocking probability.
一、 緒論
二、 WDM網路之繞路策略
2.1 適應性繞路
2.1.1 最短花費路徑演算法
2.1.2 不用光線段權值之最短路徑演算法
2.1.3 指數式權值最短路徑演算法
2.2 階層圖模型
三、 適應性繞路與階層圖模型
3.1 模擬的網路環境
3.2 Ring網路下的模擬結果與分析
3.3 NSFNET的模擬結果與分析
3.4 Random網路拓樸的模擬結果與分析
四、 隨機預早凍結策略
4.1 REB策略
4.2 NSFNET模擬結果與分析
4.3 Random網路模擬結果與分析
4.4 REB機制的公平性
五、 結論
[1] Thomas H. Cormen, Charles E. Leiserson, 2001, Introduction to Algorithms, The MIT Press, second edition.

[2] S. Subramaniam , M. Azizoglu , and A. Somani, 1996, All-Optical Networks with Sparse Wavelength Conversion, IEEE/ACM Transactions on Networking, vol. 4, no. 4, pp. 544-557.

[3] K. C. Lee and Victor O. K. Li, May 1993,A Wavelength- Convertible Optical Network, IEEE Journal of Lightwave Technology, Vol. 11,No. 5, pp. 962-970.

[4] G. Suixiang, J. Xiaohua, H. Chuanhe, D. Ding-Zhu, March 2003, An Optimization Model for Placement of Wavelength Converters to Minimize Blocking Probability in WDM Networks, IEEE Journal of Lightwave Technology, Vol. 21, No. 3, pp. 684-694.

[5] V. R. Konda and T. Y. Chow, May 2001, Algorithm for traffic grooming in optical networks to minimize the number of transceivers, in 2001 IEEE Workshop on High Performance Switching and Routing , pp. 218-221.

[6] A. Fumagalli, M. Tacca, I. Cerutti, October 1999, Minimizing the Number of Optical Crossconnect Ports in Mesh Networks Based on Bidirectional Line-Switched WDM Self-Healing Ring, Proceedings of IEEE INFOCOM''99, pp.398-403.

[7] A. Chiu and E. Modiano, 1998, Reducing electronic multiplexing costs in unidirectional SONET/WDM ring networks via efficient traffic grooming, in Proceedings of Globecom , Vol. 1, pp. 322-327.

[8] E. Modiano and A. Chiu, Jan. 2000, Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks, IEEE Journal of Lightwave Technology, Vol. 18, pp. 2-12.

[9] W. Peng-Jun, L. Liwu and F. Ophir, May 2003, Wavelength assignment to minimize requirement on tunable range of optical transceivers in WDM networks, IEEE Computer Communications, Vol. 26, No. 7, pp. 404-409.

[10] R. Ramamurthy, B. Mukherjee, Jun 2002, Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks, IEEE/ACM Transactions on Networking, Vol. 10, No. 3, pp. 351-367.

[11] Ching-Fang Hsu, Te-Lung Liu, and Nen-Fu Huang, 2002, An Adaptive Routing Strategy for Wavelength-Routed Networks with Wavelength Conversion Capability, IEEE International Conference 2002 on Communications, Vol. 5, pp. 2860-2864.

[12] E. Modiano and P. Lin, July 2001, Traffic grooming in WDM networks", IEEE Communications Magazine., Vol. 39, pp. 124-129.

[13] R. Dutta,G. N. Rouskas, Nov. 2002, Traffic grooming in WDM networks: past and future, IEEE Network, Vol. 16, No. 6 , pp. 46-56.
[14] L. Deying, S. Zhenqiang, J. Xiaohua, S. Makki, Oct. 2002, Traffic grooming for minimizing wavelength usage in WDM networks, IEEE Proceedings on Computer Communications and Networks, pp. 460-465.

[15] Harry J. R. Dutton, 1998, Understanding Optical Communications, Prentice Hal.

[16] Erol Gelenbe, Guy Pujolle, 1998, Introduction to queueing networks, Wiley.

[17] Donald Gross, Carl M. Harris, 1998, Fundamentals of queueing theory, Wiley.

[18] H. Harai, M. Murata, and H. Miyahara, Apr 1997, Performance of alternaterouting methods in all-optical switching networks, IEEE INFOCOM''97, pp. 517-525.

[19] A. Birman, June 1996, Computing Approximate Blocking Probabilities for a Class of All-Optical Networks, IEEE Journal of Selected Areas of Communication, Vol 14, pp. 852-857.

[20] L. Li and A.K. Somani, Oct 1999, Dynamic wavelength routing using congestion and neighborhood information, IEEE/ACM Transactions on Networking, Vol. 7, No. 5, pp. 779 -786.

[21] A. Birman and A. Kershenbaum, 1995, Routing and wavelength assignment methods in single-hop all-optical networks with blocking, IEEE INFOCOM ''95, Vol. 2, pp. 431-438.

[22] Hui Zang, J.P. Jue, L. Sahasrabuddhe, R. Ramamurthy,B. Mukherjee, Sep 2001, Dynamic lightpath establishment in wavelength routed WDM networks, IEEE Communications Magazine, Vol. 39, No. 9, pp. 100-108.

[23] X. Yuan, R. Gupta, R. Melhem, Oct 1996, Distributed control in optical WDM networks, IEEE Military Communications Conference 1996, Conference Proceedings, Vol. 1, pp. 100-104.

[24] Kit-man Chan, Tak-Shing Peter Yum, Apr. 1994, Anslysis of least congested Path Routing in WDM Lightwave Networks, IEEE INFOCOM, Vol. 2, pp. 962-969

[25] E. Karasan and E. Ayanoglu, Nov 1996, Effects of Wavelength Routing and Selection Algorithms on Wavelength Conversion Gain in WDM Optical Networks, IEEE GLOBECOM''96, Vol. 1, 18-22, pp. 299-305.

[26] 林志成,2003,考量負載平衡之動態光路徑繞路策略,雲林科技大學電資所碩士論文

[27] Min Ho Park, Jin Seek Choi, Soo-Hyun Choi, You-Hyen Jeong, 2003, Load Balanced Wavelength Routing Algorithm for the Layered-Graph Model, COIN/ACOFT 2003 PROCEEDINGS, pp. 110-113

[28] Bo Li , Xiaowen Chu , Kazem Sohraby, August 2003, Routing and Wavelength assignment vs. wavelength converter placement in All-optical networks, IEEE Optical Communications, pp. S22-S28

[29] 台灣網路資訊中心TWNIC, “http://www.myhome.net.tw”

[30] 台灣網路資訊中心TWNIC, “http://www.twnic.net.tw”
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top