### Abstract

Anycast refers to the transmission of data from a source node to (any) one member in the group of designed recipients in a network. When the physical network and the set of anycast requests are given, the Anycast Routing and Wavelength Assignment (ARWA) problem is to find a set of light-paths, one for each source, for anycasting messages to any one of the member in the anycast destination group such that not any path using the same wavelength passes through the same link. The goal of the ARWA problem is to minimize the number of used wavelengths. In this paper, the ARWA problem is formulated and studied; since ARWA problem is NP-hard, a three-phase genetic algorithm is proposed to solve it. This algorithm is used to find the close-to-optimal solution. Simulated results show that the proposed algorithm is able to achieve good performance.

Original language | English |
---|---|

Pages (from-to) | 3941-3951 |

Number of pages | 11 |

Journal | IEICE Transactions on Communications |

Volume | E88-B |

Issue number | 10 |

DOIs | |

Publication status | Published - 2005 Oct |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Software
- Computer Networks and Communications
- Electrical and Electronic Engineering

### Cite this

}

*IEICE Transactions on Communications*, vol. E88-B, no. 10, pp. 3941-3951. https://doi.org/10.1093/ietcom/e88-b.10.3941

**Anycast routing and wavelength assignment problem on WDM network.** / Din, Der Rong.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Anycast routing and wavelength assignment problem on WDM network

AU - Din, Der Rong

PY - 2005/10

Y1 - 2005/10

N2 - Anycast refers to the transmission of data from a source node to (any) one member in the group of designed recipients in a network. When the physical network and the set of anycast requests are given, the Anycast Routing and Wavelength Assignment (ARWA) problem is to find a set of light-paths, one for each source, for anycasting messages to any one of the member in the anycast destination group such that not any path using the same wavelength passes through the same link. The goal of the ARWA problem is to minimize the number of used wavelengths. In this paper, the ARWA problem is formulated and studied; since ARWA problem is NP-hard, a three-phase genetic algorithm is proposed to solve it. This algorithm is used to find the close-to-optimal solution. Simulated results show that the proposed algorithm is able to achieve good performance.

AB - Anycast refers to the transmission of data from a source node to (any) one member in the group of designed recipients in a network. When the physical network and the set of anycast requests are given, the Anycast Routing and Wavelength Assignment (ARWA) problem is to find a set of light-paths, one for each source, for anycasting messages to any one of the member in the anycast destination group such that not any path using the same wavelength passes through the same link. The goal of the ARWA problem is to minimize the number of used wavelengths. In this paper, the ARWA problem is formulated and studied; since ARWA problem is NP-hard, a three-phase genetic algorithm is proposed to solve it. This algorithm is used to find the close-to-optimal solution. Simulated results show that the proposed algorithm is able to achieve good performance.

UR - http://www.scopus.com/inward/record.url?scp=29144502410&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=29144502410&partnerID=8YFLogxK

U2 - 10.1093/ietcom/e88-b.10.3941

DO - 10.1093/ietcom/e88-b.10.3941

M3 - Article

AN - SCOPUS:29144502410

VL - E88-B

SP - 3941

EP - 3951

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 10

ER -