### 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 WDM anycast routing problem (WARP) is to find a set of light-paths, one for each source, for anycasting messages to 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 WARP is to minimize the number of used wavelengths. In this paper, the WARP is formulated and studied, since WARP is NP-hard, several heuristic algorithms and a hybrid method which combines heuristic and simulated annealing techniques are proposed to solve it. These algorithms are used to find the close-to-optimal solution. Simulated results show that the proposed algorithms are able to achieve good performance.

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

Pages (from-to) | 1347-1354 |

Number of pages | 8 |

Journal | IEICE Transactions on Communications |

Volume | E88-B |

Issue number | 4 |

DOIs | |

Publication status | Published - 2005 Jan 1 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

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

### Cite this

*IEICE Transactions on Communications*,

*E88-B*(4), 1347-1354. https://doi.org/10.1093/ietcom/e88-b.4.1347

}

*IEICE Transactions on Communications*, vol. E88-B, no. 4, pp. 1347-1354. https://doi.org/10.1093/ietcom/e88-b.4.1347

**Anycast routing problem on WDM ring network.** / Din, Der-Rong.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Anycast routing problem on WDM ring network

AU - Din, Der-Rong

PY - 2005/1/1

Y1 - 2005/1/1

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 WDM anycast routing problem (WARP) is to find a set of light-paths, one for each source, for anycasting messages to 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 WARP is to minimize the number of used wavelengths. In this paper, the WARP is formulated and studied, since WARP is NP-hard, several heuristic algorithms and a hybrid method which combines heuristic and simulated annealing techniques are proposed to solve it. These algorithms are used to find the close-to-optimal solution. Simulated results show that the proposed algorithms are 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 WDM anycast routing problem (WARP) is to find a set of light-paths, one for each source, for anycasting messages to 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 WARP is to minimize the number of used wavelengths. In this paper, the WARP is formulated and studied, since WARP is NP-hard, several heuristic algorithms and a hybrid method which combines heuristic and simulated annealing techniques are proposed to solve it. These algorithms are used to find the close-to-optimal solution. Simulated results show that the proposed algorithms are able to achieve good performance.

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

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

U2 - 10.1093/ietcom/e88-b.4.1347

DO - 10.1093/ietcom/e88-b.4.1347

M3 - Article

VL - E88-B

SP - 1347

EP - 1354

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 4

ER -