IEICE TRANSACTIONS on Communications
Ant-Based Alternate Routing in All-Optical WDM Networks
Summary :
We propose an ant-based algorithm to improve the alternate routing scheme for dynamic Routing and Wavelength Assignment (RWA) in all-optical wavelength-division- multiplexing (WDM) networks. In our algorithm, we adopt a novel twin routing table structure that comprises both a P-route table for connection setup and a pheromone table for ants' foraging. The P-route table contains P alternate routes between a source-destination pair, which are dynamically updated by ant-based mobile agents based on current network congestion information. Extensive simulation results upon the ns-2 network simulator indicate that by keeping a suitable number of ants in a network to proactively and continually update the twin routing tables in the network, our new ant-based alternate routing algorithm can result in a small setup time and achieve a significantly lower blocking probability than the promising alternate shortest-path (ASP) algorithm and the fixed-paths least congestion (FPLC) algorithm for dynamic RWA even with a small value of P.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E89-B No.3 pp.748-755
- Publication Date
- 2006/03/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e89-b.3.748
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Son-Hong NGO, Xiaohong JIANG, Susumu HORIGUCHI, "Ant-Based Alternate Routing in All-Optical WDM Networks" in IEICE TRANSACTIONS on Communications,
vol. E89-B, no. 3, pp. 748-755, March 2006, doi: 10.1093/ietcom/e89-b.3.748.
Abstract: We propose an ant-based algorithm to improve the alternate routing scheme for dynamic Routing and Wavelength Assignment (RWA) in all-optical wavelength-division- multiplexing (WDM) networks. In our algorithm, we adopt a novel twin routing table structure that comprises both a P-route table for connection setup and a pheromone table for ants' foraging. The P-route table contains P alternate routes between a source-destination pair, which are dynamically updated by ant-based mobile agents based on current network congestion information. Extensive simulation results upon the ns-2 network simulator indicate that by keeping a suitable number of ants in a network to proactively and continually update the twin routing tables in the network, our new ant-based alternate routing algorithm can result in a small setup time and achieve a significantly lower blocking probability than the promising alternate shortest-path (ASP) algorithm and the fixed-paths least congestion (FPLC) algorithm for dynamic RWA even with a small value of P.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.3.748/_p
Copy
@ARTICLE{e89-b_3_748,
author={Son-Hong NGO, Xiaohong JIANG, Susumu HORIGUCHI, },
journal={IEICE TRANSACTIONS on Communications},
title={Ant-Based Alternate Routing in All-Optical WDM Networks},
year={2006},
volume={E89-B},
number={3},
pages={748-755},
abstract={We propose an ant-based algorithm to improve the alternate routing scheme for dynamic Routing and Wavelength Assignment (RWA) in all-optical wavelength-division- multiplexing (WDM) networks. In our algorithm, we adopt a novel twin routing table structure that comprises both a P-route table for connection setup and a pheromone table for ants' foraging. The P-route table contains P alternate routes between a source-destination pair, which are dynamically updated by ant-based mobile agents based on current network congestion information. Extensive simulation results upon the ns-2 network simulator indicate that by keeping a suitable number of ants in a network to proactively and continually update the twin routing tables in the network, our new ant-based alternate routing algorithm can result in a small setup time and achieve a significantly lower blocking probability than the promising alternate shortest-path (ASP) algorithm and the fixed-paths least congestion (FPLC) algorithm for dynamic RWA even with a small value of P.},
keywords={},
doi={10.1093/ietcom/e89-b.3.748},
ISSN={1745-1345},
month={March},}
Copy
TY - JOUR
TI - Ant-Based Alternate Routing in All-Optical WDM Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 748
EP - 755
AU - Son-Hong NGO
AU - Xiaohong JIANG
AU - Susumu HORIGUCHI
PY - 2006
DO - 10.1093/ietcom/e89-b.3.748
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2006
AB - We propose an ant-based algorithm to improve the alternate routing scheme for dynamic Routing and Wavelength Assignment (RWA) in all-optical wavelength-division- multiplexing (WDM) networks. In our algorithm, we adopt a novel twin routing table structure that comprises both a P-route table for connection setup and a pheromone table for ants' foraging. The P-route table contains P alternate routes between a source-destination pair, which are dynamically updated by ant-based mobile agents based on current network congestion information. Extensive simulation results upon the ns-2 network simulator indicate that by keeping a suitable number of ants in a network to proactively and continually update the twin routing tables in the network, our new ant-based alternate routing algorithm can result in a small setup time and achieve a significantly lower blocking probability than the promising alternate shortest-path (ASP) algorithm and the fixed-paths least congestion (FPLC) algorithm for dynamic RWA even with a small value of P.
ER -
English
