完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Din, Der-Rong | |
| dc.date.accessioned | 2009-06-02T08:42:57Z | |
| dc.date.accessioned | 2020-07-05T06:33:15Z | - |
| dc.date.available | 2009-06-02T08:42:57Z | |
| dc.date.available | 2020-07-05T06:33:15Z | - |
| dc.date.issued | 2006-06-13T07:28:40Z | |
| dc.date.submitted | 2003-12-19 | |
| dc.identifier.uri | http://dspace.fcu.edu.tw/handle/2376/1887 | - |
| dc.description.abstract | Wavelength-division multiplexing (WDM) is an effective technique to make use of the large amount of bandwidth in optical fibers to meet the bandwidth requirement of applications. In this paper, the multicast routing problem on WDM networks is studied. Specifically, the formulation for the WDM multicast routing problem is given. Since the problem is NP-hard, a genetic algorithm (GA) constructs a source-based light-forest (consisting one or more light-trees) for the multicast request is proposed to solve this problem. Simulation results demonstrate that the proposed GA can run efficiently | |
| dc.description.sponsorship | 逢甲大學,台中市 | |
| dc.format.extent | 8P. | |
| dc.format.extent | 384505 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 中華民國92年全國計算機會議 | |
| dc.subject | Light-forest | |
| dc.subject | multicast routing | |
| dc.subject | wavelength division multiplexing | |
| dc.subject | WDM | |
| dc.subject | genetic algorithm | |
| dc.subject | path-oriented encoding | |
| dc.subject.other | 網路和IPv6 | |
| dc.title | Genetic Algorithm for Finding Minimal Cost Light-Forest of Multicast Routing on WDM Network | |
| 分類: | 2003年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| OT_0282003208.pdf | 375.49 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。