Paper
25 August 1999 Online routing and wavelength assignment in WDM rings
Ching Law, Kai-Yeung Siu
Author Affiliations +
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.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ching Law and Kai-Yeung Siu "Online routing and wavelength assignment in WDM rings", Proc. SPIE 3843, All-Optical Networking 1999: Architecture, Control, and Management Issues, (25 August 1999); https://doi.org/10.1117/12.360406
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Wavelength division multiplexing

Algorithms

Network architectures

Algorithm development

Analytical research

Wavelength division multiplexing networks

Performance modeling

Back to Top