Average-Case Performance Evaluation of Online Algorithms for Routing and Wavelength Assignment in WDM Optical Networks

Author

Li, Keqin

Author_Institution

Dept. of Comput. Sci., State Univ. of New York, New Paltz, NY

fYear

2007

fDate

26-30 March 2007

Firstpage

1

Lastpage

10

Abstract

We investigate the problem of online routing and wavelength assignment and the related throughput maximization problem in wavelength division multiplexing optical networks. It is pointed out that these problems are highly inapproximable. We evaluate the average-case performance of several online algorithms, which have no knowledge of future arriving connection requests when processing the current connection request. Our experimental results on a wide range of optical networks demonstrate that the average-case performance of these algorithms is very close to optimal.

Keywords

optical fibre networks; optimisation; telecommunication network routing; wavelength assignment; wavelength division multiplexing; WDM optical network; average-case performance evaluation; maximization problem; online algorithm; telecommunication network routing; wavelength division multiplexing; Approximation algorithms; Computer science; Optical fiber networks; Partitioning algorithms; Polynomials; Throughput; WDM networks; Wavelength assignment; Wavelength division multiplexing; Wavelength routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International

Conference_Location

Long Beach, CA

Print_ISBN

1-4244-0910-1

Electronic_ISBN

1-4244-0910-1

Type

conf

DOI

10.1109/IPDPS.2007.370264

Filename

4227992