Simulation study of a heuristic near-maximum ant-based dynamic routing
A new ant-based routing is proposed for solving dynamic routing and wavelength assignment in mesh WDM network under the wavelength continuity constraint. The ant algorithm favors paths with maximum number of available wavelengths between two nodes, resulting in improved load balancing and less conge...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
ZARKA PRIVATE UNIV
2008
|
| Subjects: | |
| Online Access: | http://shdl.mmu.edu.my/2655/ |
| _version_ | 1848790115451666432 |
|---|---|
| author | Tan, Chin Fouad, Abbou Ewe, Tat |
| author_facet | Tan, Chin Fouad, Abbou Ewe, Tat |
| author_sort | Tan, Chin |
| building | MMU Institutional Repository |
| collection | Online Access |
| description | A new ant-based routing is proposed for solving dynamic routing and wavelength assignment in mesh WDM network under the wavelength continuity constraint. The ant algorithm favors paths with maximum number of available wavelengths between two nodes, resulting in improved load balancing and less congested shortest path. The simulation results showed that the proposed ant-based routing algorithm is highly reliable in the sense that the number of ants used is predictable to achieve a steady performance in terms of blocking probability. |
| first_indexed | 2025-11-14T18:07:29Z |
| format | Article |
| id | mmu-2655 |
| institution | Multimedia University |
| institution_category | Local University |
| last_indexed | 2025-11-14T18:07:29Z |
| publishDate | 2008 |
| publisher | ZARKA PRIVATE UNIV |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | mmu-26552011-09-08T03:16:18Z http://shdl.mmu.edu.my/2655/ Simulation study of a heuristic near-maximum ant-based dynamic routing Tan, Chin Fouad, Abbou Ewe, Tat T Technology (General) QA75.5-76.95 Electronic computers. Computer science A new ant-based routing is proposed for solving dynamic routing and wavelength assignment in mesh WDM network under the wavelength continuity constraint. The ant algorithm favors paths with maximum number of available wavelengths between two nodes, resulting in improved load balancing and less congested shortest path. The simulation results showed that the proposed ant-based routing algorithm is highly reliable in the sense that the number of ants used is predictable to achieve a steady performance in terms of blocking probability. ZARKA PRIVATE UNIV 2008-07 Article NonPeerReviewed Tan, Chin and Fouad, Abbou and Ewe, Tat (2008) Simulation study of a heuristic near-maximum ant-based dynamic routing. INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY, 5 (3). pp. 230-233. http://apps.webofknowledge.com/full_record.do?product=WOS&search_mode=GeneralSearch&qid=1&SID=Q11IECEn41nCPeiaHmd&page=76&doc=758 |
| spellingShingle | T Technology (General) QA75.5-76.95 Electronic computers. Computer science Tan, Chin Fouad, Abbou Ewe, Tat Simulation study of a heuristic near-maximum ant-based dynamic routing |
| title | Simulation study of a heuristic near-maximum ant-based dynamic routing |
| title_full | Simulation study of a heuristic near-maximum ant-based dynamic routing |
| title_fullStr | Simulation study of a heuristic near-maximum ant-based dynamic routing |
| title_full_unstemmed | Simulation study of a heuristic near-maximum ant-based dynamic routing |
| title_short | Simulation study of a heuristic near-maximum ant-based dynamic routing |
| title_sort | simulation study of a heuristic near-maximum ant-based dynamic routing |
| topic | T Technology (General) QA75.5-76.95 Electronic computers. Computer science |
| url | http://shdl.mmu.edu.my/2655/ http://shdl.mmu.edu.my/2655/ |