Anycast routing problem on WDM ring network

Research output: Contribution to journalArticle

2 Citations (Scopus)

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 languageEnglish
Pages (from-to)1347-1354
Number of pages8
JournalIEICE Transactions on Communications
VolumeE88-B
Issue number4
DOIs
Publication statusPublished - 2005 Jan 1

All Science Journal Classification (ASJC) codes

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

Fingerprint Dive into the research topics of 'Anycast routing problem on WDM ring network'. Together they form a unique fingerprint.

  • Cite this