On-Line Routing in All-Optical Networks (1997)
Cached
Download Links
- [www.icsi.berkeley.edu]
- [www.dis.uniroma1.it]
- [www.dis.uniroma1.it]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROCEEDINGS OF THE 24TH INTERNATIONAL COLLOQIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING, LNCS 1256 |
| Citations: | 30 - 7 self |
BibTeX
@INPROCEEDINGS{Bartal97on-linerouting,
author = {Yair Bartal and Stefano Leonardi},
title = {On-Line Routing in All-Optical Networks},
booktitle = {IN PROCEEDINGS OF THE 24TH INTERNATIONAL COLLOQIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING, LNCS 1256},
year = {1997},
pages = {516--526},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The paper deals with on-line routing in WDM (wavelength division multiplexing) optical networks. A sequence of requests arrives over time, each is a pair of nodes to be connected by a path. The problem is to assign a wavelength and a path to each pair, so that no two paths sharing a link are assigned the same wavelength. The goal is to minimize the number of wavelengths used to establish all connections. Raghavan and Upfal [RU94] considered the off-line version of the problem, which was further studied in [AR95, KP96, MKR95, Ra96]. For a line topology, the problem is the well-studied interval graph coloring problem. On-line algorithms for this problem have been analyzed in [KT81, Ki88]. We consider trees, trees of rings, and meshes topologies, previously studied in the off-line case. We give on-line algorithms with competitive ratio O(log n) for all these topologies. We give a matching \Omega\Gammaing n) lower bound for meshes. We also prove that any algorithm for trees canno...
