Paper
1 November 1996 Scheduling all-to-all connections in WDM rings
Chunming Qiao, Xijun Zhang, Luying Zhou
Author Affiliations +
Abstract
Scheduling all-to-al connections in a network of limited physical connectivity provides a way to trade bandwidth for reduced routing control as well as deterministic connection latency. In this paper, we consider the problem of scheduling all-to-all connections in a WDM ring. For a given number of wavelengths, K, and a given number of transmitter/receiver pairs per node, T, we determine the theoretical lower bound (TLB) on the scheduling length. A basic scheduling strategy called complementary assembly with dual strides (CADS) is proposed. In a special case when K equals 1 and T equals 1, the TLB can be achieved based on CADS. Heuristic algorithms based on either homogeneous or heterogeneous CADS are then proposed for the case when K > 1, and near minimum scheduling length can be achieved for any T. Our analysis also indicate that there is an optimal value of T for a given K such that neither T nor K would become the performance bottleneck. Impact of wavelength-tuning delay, ring propagation delay, laser array fabrication especially wavelength drift of the WDM sources on the scheduling method is also discussed.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Chunming Qiao, Xijun Zhang, and Luying Zhou "Scheduling all-to-all connections in WDM rings", Proc. SPIE 2919, All-Optical Communication Systems: Architecture, Control, and Network Issues II, (1 November 1996); https://doi.org/10.1117/12.256354
Lens.org Logo
CITATIONS
Cited by 18 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Wavelength division multiplexing

Computer aided design

Wave propagation

Back to Top