### Abstract

The routing ond wavelength assignment (RWA) problem on wavelength division multiplexing (WDM) ring networks without wavelength conversion is considered in this paper. When the physical network and required connections are given, RWA is the problem to select a suitable path and wavelength among the many possible choices for each connection such that not any paths using the same wavelength pass through the same link. This problem has been proven to be the NP-hard problem. In the paper, a simulated annealing (SA) algorithm is proposed to solve it. Experimental results indicate that SA is robust for this problem.

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

Pages (from-to) | 253-262 |

Number of pages | 10 |

Journal | Computer Systems Science and Engineering |

Volume | 19 |

Issue number | 4 |

Publication status | Published - 2004 Jul 1 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Control and Systems Engineering
- Theoretical Computer Science
- Computer Science(all)

### Cite this

}

*Computer Systems Science and Engineering*, vol. 19, no. 4, pp. 253-262.

**A simulated annealing algorithm for finding minimal wavelength on a WDM ring.** / Din, Der Rong.

Research output: Contribution to journal › Article

TY - JOUR

T1 - A simulated annealing algorithm for finding minimal wavelength on a WDM ring

AU - Din, Der Rong

PY - 2004/7/1

Y1 - 2004/7/1

N2 - The routing ond wavelength assignment (RWA) problem on wavelength division multiplexing (WDM) ring networks without wavelength conversion is considered in this paper. When the physical network and required connections are given, RWA is the problem to select a suitable path and wavelength among the many possible choices for each connection such that not any paths using the same wavelength pass through the same link. This problem has been proven to be the NP-hard problem. In the paper, a simulated annealing (SA) algorithm is proposed to solve it. Experimental results indicate that SA is robust for this problem.

AB - The routing ond wavelength assignment (RWA) problem on wavelength division multiplexing (WDM) ring networks without wavelength conversion is considered in this paper. When the physical network and required connections are given, RWA is the problem to select a suitable path and wavelength among the many possible choices for each connection such that not any paths using the same wavelength pass through the same link. This problem has been proven to be the NP-hard problem. In the paper, a simulated annealing (SA) algorithm is proposed to solve it. Experimental results indicate that SA is robust for this problem.

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

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

M3 - Article

AN - SCOPUS:9944233128

VL - 19

SP - 253

EP - 262

JO - Computer Systems Science and Engineering

JF - Computer Systems Science and Engineering

SN - 0267-6192

IS - 4

ER -