期刊論文
| 學年 | 96 |
|---|---|
| 學期 | 2 |
| 出版（發表）日期 | 2008-06-13 |
| 作品名稱 | Finding routing paths for alternate routing in all-optical WDM networks |
| 作品名稱（其他語言） | |
| 著者 | Hwa-Chun Lin; Sheng-Wei Wang; Meng-Lin Hung |
| 單位 | |
| 出版者 | |
| 著錄名稱、卷期、頁數 | IEEE/OSA Journal of Lightwave Technology,vol. 26(11),p.1432–1444 |
| 摘要 | An alternate routing algorithm requires a set of predetermined routing paths between each source-destination pair. To reduce the connection blocking probability, it is desirable that the predetermined routing paths between each source-destination pair be link-disjoint. The predetermined routing paths used in previous works on alternate routing are the -shortest link-disjoint paths in terms of hop count. The shared links among the -shortest link-disjoint paths between different source-destination pairs may cause high connection blocking probability. Thus, depending on the traffic requirements of all source-destination pairs, hop-count based -shortest link-disjoint paths may not be the best choice for the predetermined routing paths. This paper proposes a method to find a set of link-disjoint routing paths between each source-destination pair to be used by an alternate routing algorithm in order to reduce the connection blocking probability. The key idea is to find a set of link-disjoint routing paths based on the routing paths that are utilized by the optimal traffic pattern in the network. Then, for each source-destination pair, we select a set of link-disjoint routing paths from the routing paths that are utilized by the optimal traffic pattern such that the selected set of link-disjoint routing paths carries the most of the traffic between the source-destination pair. Simulations are performed to compare the performance of using the link-disjoint routing paths found by the proposed method as the predetermined routing paths and those of using the hop-count based -shortest link-disjoint paths and employing the routing paths found by the capacity-balanced alternate routing method proposed method by Ho and Mouftah (in 2002) as the predetermined routing paths. Our simulation results show that using the link-disjoint routing paths found by the proposed method yields significantly lower connection blocking probability than employing the hop-count based -shortest link-dis... |
| 關鍵字 | WDM networks , Wavelength routing , Educational institutions , Telecommunication traffic , Traffic control , Wavelength division multiplexinComputer science;Councils;Information science;Intelligent networks |
| 語言 | en_US |
| ISSN | |
| 期刊性質 | 國外 |
| 收錄於 | SCI |
| 產學合作 | |
| 通訊作者 | Hwa-Chun Lin |
| 審稿制度 | 是 |
| 國別 | USA |
| 公開徵稿 | |
| 出版型式 | ,電子版,紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/121044 ) |