Scalable routing, scheduling and virtualization for TWIN optical burst switching networks

Abstract

We propose a comprehensive scalable algorithm simultaneously assessing the routing, scheduling and virtualization in Time-Domain Wavelength Interleaved Network (TWIN). TWIN is an energy-efficient optical burst switching technology for metropolitan area and data center intra- and interconnections, with destinations using separate allocated sets of wavelengths for the reception. Given the costs of the optical transponders and the wavelength use per km of fiber length, the proposed algorithm solves the routing and wavelength assignment problem, and in the same time allocates the time slots to traffic flows (performs the slot scheduling), so that the total network cost is minimized. The algorithm also enables the construction of overlayed virtual networking domains at minimum cost, which share the transponders and network links, and can employ different scheduling policies. The performance of the algorithm is compared with the pre-existing optimal dimensioning solution for single virtualization domain based on Integer Linear Programing, for different scenarios. The obtained results show that the network cost is within 27% of the optimal.