### Abstract

Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelengthdivision multiplexed (WDM) optical network so as to achieve greater capacity. In a recent paper [6], Datta et al. studied the problem of establishing a set of disjoint lightpaths on a tree topology using a single wavelength to maximize the total traffic supported by the chosen set of lightpaths. They discussed applications of this problem to RWA and presented a dynamic programming algorithm which optimally solves this problem in O(n ^{4}+nD^{3}) time, where n is the number of nodes in the network and D is the maximum node degree. In this paper, we present an improved algorithm with a time complexity of O(n^{2}+nD^{2}).

Original language | English (US) |
---|---|

Article number | 1717477 |

Pages (from-to) | 45-56 |

Number of pages | 12 |

Journal | IEEE Journal on Selected Areas in Communications |

Volume | 24 |

Issue number | 8 SUPPL. |

DOIs | |

State | Published - Aug 1 2006 |

### Fingerprint

### Keywords

- Graph algorithms
- Maximum matching
- WDM networks
- Wavelength assignment

### ASJC Scopus subject areas

- Computer Networks and Communications
- Electrical and Electronic Engineering

### Cite this

*IEEE Journal on Selected Areas in Communications*,

*24*(8 SUPPL.), 45-56. [1717477]. https://doi.org/10.1109/JSAC-OCN.2006.22605