Abstract
The high throughput provided by WDM technology in fiber optic networks and the emergence of high speed all-optical wavelength converters have attracted extensive research on lightpath routing in WDM networks. Given a connection request, it is desirable to find a minimum cost lightpath or semi-lightpath to establish the connection without interrupting any existing connections. When a connection cannot be established without rerouting, one would like to establish a connection after rerouting a minimum number of existing lightpaths. In this paper, we present an efficient algorithm for computing a minimum cost route among routes requiring minimum cost reroutings. Our results provide either improvements or generalizations of several recent results in lightpath routing/rerouting.
| Original language | English (US) |
|---|---|
| Title of host publication | Conference Record / IEEE Global Telecommunications Conference |
| Pages | 2124-2128 |
| Number of pages | 5 |
| Volume | 4 |
| State | Published - 2001 |
| Event | IEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States Duration: Nov 25 2001 → Nov 29 2001 |
Other
| Other | IEEE Global Telecommunicatins Conference GLOBECOM'01 |
|---|---|
| Country/Territory | United States |
| City | San Antonio, TX |
| Period | 11/25/01 → 11/29/01 |
Keywords
- Minimum cost lightpath routing and rerouting
- WDM all-optical networks
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Global and Planetary Change