東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

A tabu search heuristic for routing ...

Wang, Shaohong.

FindBook

Google Book

Amazon

博客來

A tabu search heuristic for routing in WDM networks.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	A tabu search heuristic for routing in WDM networks./
作者:	Wang, Shaohong.
面頁冊數:	93 p.
附註:	Source: Masters Abstracts International, Volume: 43-01, page: 0247.
Contained By:	Masters Abstracts International43-01.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MQ92532
ISBN:	0612925323

A tabu search heuristic for routing in WDM networks.
Wang, Shaohong.

A tabu search heuristic for routing in WDM networks. - 93 p.

Source: Masters Abstracts International, Volume: 43-01, page: 0247.

Thesis (M.Sc.)--University of Windsor (Canada), 2004.

Optical networks and Wavelength-Division Multiplexing (WDM) have been widely studied and utilized in recent years. By exploiting the huge bandwidth of optical networks, WDM appears to be one of the most promising technologies to meet the dramatically increased demand for bandwidth. Since optical resources in optical networks are very expensive, development of dynamic lightpath allocation strategies, which utilize network resource efficiently, is an important area of research. We assume that there is no optical wavelength conversion device in the network, and the wavelength-continuity constraint must be satisfied.

ISBN: 0612925323Subjects--Topical Terms:

626642
Computer Science.

A tabu search heuristic for routing in WDM networks.
LDR:02331nmm 2200289 4500 001 1851489
005 20051216110304.5
008 130614s2004 eng d
020 $a 0612925323
035 $a (UnM)AAIMQ92532
035 $a AAIMQ92532
040 $a UnM $c UnM
100 1 $a Wang, Shaohong. $3 1939375
245 1 2 $a A tabu search heuristic for routing in WDM networks.
300 $a 93 p.
500 $a Source: Masters Abstracts International, Volume: 43-01, page: 0247.
500 $a Advisers: Subir Bandyopadhyay; Arunita Jaekel.
502 $a Thesis (M.Sc.)--University of Windsor (Canada), 2004.
520 $a Optical networks and Wavelength-Division Multiplexing (WDM) have been widely studied and utilized in recent years. By exploiting the huge bandwidth of optical networks, WDM appears to be one of the most promising technologies to meet the dramatically increased demand for bandwidth. Since optical resources in optical networks are very expensive, development of dynamic lightpath allocation strategies, which utilize network resource efficiently, is an important area of research. We assume that there is no optical wavelength conversion device in the network, and the wavelength-continuity constraint must be satisfied.
520 $a Exact optimization techniques are typically too time-consuming to be useful for practical-sized networks. In this thesis we present a tabu search based heuristic approach which is used to establish an optimal lightpath dynamically in response to a new communication request in a WDM network. As far as we know, this is the first investigation using tabu search techniques for dynamical lightpath allocation in WDM networks. We have tested our approach with networks having different sizes. And then we have compared our results with those obtained using the MILP approach. In the vast majority of cases, tabu search was able to quickly generate a solution that was optimal or near-optimal, indicating that tabu search is a promising approach for the dynamic lightpath allocation problem in WDM networks.
590 $a School code: 0115.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of Windsor (Canada). $3 1018526
773 0 $t Masters Abstracts International $g 43-01.
790 1 0 $a Bandyopadhyay, Subir, $e advisor
790 1 0 $a Jaekel, Arunita, $e advisor
790 $a 0115
791 $a M.Sc.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MQ92532