Wavelength scheduling in Time-domain Wavelength Interleaved Networks

Abstract

Abstract-Time-domain Wavelength Interleaved Networking (TWIN) is a new optical network architecture which achieves a good balance between scheduling flexibility and deployment cost. In this paper, we solve the wavelength assignment problem for TWIN networks using topology sharing approach. We show that determining the wavelength assignment that use the minimum number of wavelengths is a NP-Complete problem. Four greedy heuristics are presented to compute the approximated solution within reasonable time. The evaluation results show that performing sorting on destination trees and wavelengths improves the assignment results, especially under low traffic loads. However, performing sorting brings some extra overheads to the sort heuristics' running time, but overall computation costs are still acceptable.

Scheduling aware dimensioning for Time-Domain Wavelength Interleaved Network

“…Such approach is novel, and to the best of authors' knowledge, this is the first work that addresses both problems simultaneously. For instance, the wavelength assignment problem in TWIN is shown to be NP-complete in [9], where an optimal greedy algorithm for resolving it, is presented. However, [9] does not address the optimal slot allocation in TWIN, and the problems of slot collisions at sources and destinations are omitted.…”

“…For instance, the wavelength assignment problem in TWIN is shown to be NP-complete in [9], where an optimal greedy algorithm for resolving it, is presented. However, [9] does not address the optimal slot allocation in TWIN, and the problems of slot collisions at sources and destinations are omitted. The second main contribution of our work is in the fact that we introduce the QoS constraints, which can significantly improve the the network performance.…”