Share Email Print

Proceedings Paper

Online routing and wavelength assignment in WDM rings
Author(s): Ching Law; Kai-Yeung Siu
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We present new theoretical results on the performance limits of on-line routing and wavelength assignment (RWA) algorithms in a single-hub wavelength division multiplexing ring network architecture. An RWA algorithm is said to be on-line if at each point in time, the algorithm assigns a lightpath to a current connection request based only on past information and with no knowledge whatsoever about the future requests. We derive tight bounds on the throughput performance of an on-line min-hop algorithm in comparison with that of an optimal off-line algorithm. In addition, we show that when there are sufficiently many nodes in the ring, the min-hop algorithm achieves the best possible throughput performance among all on-line RWA algorithms. On the other hand, when the number of nodes is not greater than the number of wavelengths in the ring, an on-line algorithm that minimizes the maximum load of the network is shown to achieve better throughput performance than the min-hop algorithm.

Paper Details

Date Published: 25 August 1999
PDF: 13 pages
Proc. SPIE 3843, All-Optical Networking 1999: Architecture, Control, and Management Issues, (25 August 1999); doi: 10.1117/12.360406
Show Author Affiliations
Ching Law, Massachusetts Institute of Technology (United States)
Kai-Yeung Siu, Massachusetts Institute of Technology (United States)

Published in SPIE Proceedings Vol. 3843:
All-Optical Networking 1999: Architecture, Control, and Management Issues
John M. Senior; Chunming Qiao; Sudhir Dixit, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?