(18.206.238.77) 您好!臺灣時間:2021/05/17 17:44
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

: 
twitterline
研究生:林志成
研究生(外文):Chih-cheng Lin
論文名稱:考量負載平衡之動態光路徑繞路策略
論文名稱(外文):Dynamic Lightpath Routing Strategy with Load Balance Consideration
指導教授:張慶龍張慶龍引用關係
指導教授(外文):Ching-Lung Chang
學位類別:碩士
校院名稱:國立雲林科技大學
系所名稱:電子與資訊工程研究所碩士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2003
畢業學年度:91
語文別:中文
論文頁數:63
中文關鍵詞:負載平衡WDM光網路非線性權值動態繞路備選路徑Blocking機率
相關次數:
  • 被引用被引用:3
  • 點閱點閱:88
  • 評分評分:
  • 下載下載:7
  • 收藏至我的研究室書目清單書目收藏:0
為了能有效地運用WDM光網路並使其更有效率,光路徑通常只會在連線要求抵達時才動態地被建立。一般而言,動態訊務環境下的繞路演算法根據是否預先決定好路徑可以分成適應性繞路及備選繞路兩種機制。本論文以整體網路的負載平衡觀點加以考量,利用非線性線段權值方式,針對線段權值的指定方式,研究一種新的線段權值函數,使針對不同的網路型態及網路負載,所指定的權值能夠反應出即時的網路狀態以及促進流量的平衡。而基於線路權值的考量,本篇論文提出一個稱為EWSCP的適應性繞路演算法及另一個稱為LAPA備選繞路演算法。模擬結果指出,使用EWSCP的繞路機制能夠達到比其他常用的適應性繞路機制更低的連線凍結機率。另一方面,使用擁有較小連線負擔的LAPA機制亦能有接近於適應性繞路機制的性能表現。
In order to use WDM networks efficiently and effectively, a lightpath is dynamically established upon the arrival of a connection request. The dynamic routing algorithms are usually classified into adaptive and alternative schemes based on whether the chosen routes are predetermined or not. In this work, we propose a new weighted function for link cost assignments. The purpose of the cost function is to differentiate network in different traffic load. Based on the link cost assignments, one adaptive routing algorithm referred to as EWSCP and one alternative routing named LAPA are presented in the paper. Simulation results reveal that EWSCP can achieve lowest call blocking probability than conventional adaptive routing schemes. On the other hand, the low overhead LAPA can obtain performance approaching to adaptive routing.
目 錄
中文摘要 i
英文摘要 ii
誌謝 iii
目錄 iv
圖目錄 v
符號說明 vi
一、 緒論 1
二、 WDM網路之繞路策略 8
2.1 靜態訊務之繞路與波長指定 10
2.2 動態訊務之繞路與波長指定 11
2.3 詢息傳遞與資源保留 14
2.4 考量線路權值之適應性繞路 16
2.4.1 最短花費路徑法則 16
2.4.2 考量線路權值之最短花費路徑法則 17
三、 指數式權值最短路徑演算法 20
3.1 EWSCP 演算法之說明 20
3.2 模擬與分析 22
3.2.1 EWSCP 、WSCP及SCP之凍結機率比較 24
3.2.2 EWSCP 、WSCP及SCP之平均路徑長度比較 26
3.2.3 EWSCP 、WSCP及SCP之線段擁塞指數比較 30
四、 具負載平衡考量之備選繞路演算法 35
4.1 LAPA演算法之說明 36
4.2 LAPA演算法之分析模型 38
4.3 LAPA演算法之模擬結果與分析 43
4.3.1 LAPA、FAR及適應性機制之凍結機率比較 43
4.3.2 LAPA與適應性機制之平均路徑長度比較 46
4.3.3 LAPA與適應性機制之線段擁塞指數比較 46
五、 結論與未來工作 49
參考文獻 50
簡歷 52
[1] Thomas H. Cormen, Charles E. Leiserson, Introduction to Algorithms, The MIT Press, second edition, 2001.

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

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

[4] G. Suixiang, J. Xiaohua, H. Chuanhe, D. Ding-Zhu, 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, March 2003.

[5] V. R. Konda and T. Y. Chow, 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, May 2001.

[6] A. Fumagalli, M. Tacca, I. Cerutti, 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, October 1999.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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