Research Article
Optimal Wavelength Scheduling in Optical Burst-Switched Networks Using Constant Time Burst Resequencing
@INPROCEEDINGS{10.1109/BROADNETS.2006.4374388, author={Yuhua Chen and Jonathan S. Turner and Pu-Fan Mo}, title={Optimal Wavelength Scheduling in Optical Burst-Switched Networks Using Constant Time Burst Resequencing}, proceedings={3rd International ICST Conference on Broadband Communications, Networks, and Systems}, publisher={IEEE}, proceedings_a={BROADNETS}, year={2006}, month={10}, keywords={OBS Optical burst switching WDM algorithm optical packet switching scheduling wavelength routing}, doi={10.1109/BROADNETS.2006.4374388} }- Yuhua Chen
Jonathan S. Turner
Pu-Fan Mo
Year: 2006
Optimal Wavelength Scheduling in Optical Burst-Switched Networks Using Constant Time Burst Resequencing
BROADNETS
IEEE
DOI: 10.1109/BROADNETS.2006.4374388
Abstract
Optical burst switching (OBS) is an emerging technology that allows variable size data bursts to be transported directly over DWDM links. In order to make OBS a viable solution, the wavelength scheduling algorithms need to be able to utilize the available wavelengths efficiently, while being able to operate fast enough to keep up with the burst incoming rate. For example, for a system with 32 wavelengths per link, each operating at 10 Gb/s, we need to process one BHC every 25 ns, in order to support an average burst length of 1 KByte. When implemented in hardware, the running time of the well-known horizon scheduler is O(1) for practical numbers of wavelengths. Unfortunately, horizon scheduling cannot utilize the voids created by previously scheduled bursts, resulting in low bandwidth utilization. To date, Min-SV is the fastest scheduling algorithm that can schedule wavelengths efficiently. However, its complexity is O(log m) and it requires lOlog m memory accesses to schedule a single burst. This means that it can take up to several microseconds for each burst request, which is still too slow to make it a practical solution for OBS deployment. In this paper, we propose an optimal wavelength scheduler using constant time burst resequencing (CTBR), which runs in O(1) time. The proposed CTBR scheduler is able to produce optimal wavelength schedules while having the same processing speed as the horizon scheduler. The algorithm is well-suited to high performance hardware implementation.
