A Technique to Minimize Contention in Optical Burst Switching Networks

Abstract

Optical burst switching (OBS) is the new switching technique for next generation
optical networks. However, there are certain issues such as burst aggregation,
scheduling, contention resolution and QoS that needs to be addressed in OBS.
This thesis is an attempt to address the burst scheduling and burst contention in
OBS networks.
Several scheduling algorithms have been proposed in the literature, which can
be categorized into Horizon and Void lling scheduling algorithm. Void lling algorithms
perform better because they exploits void within a channel for scheduling.
Reported void lling algorithms - Latest available unscheduled channel with void
lling (LAUC-VF) and Minimum end void (Min-EV) - do not consider the void
duration in scheduling. In this thesis we propose a new scheduling algorithm called
Best Fit Void Filling (BFVF), which consider both void duration and incoming
burst length to nd an optimal void channel. We simulate our proposed scheme
using obs-ns simulator and compared with LAUC-VF and Min-EV algorithm. Result
shows that the burst loss ratio is lower and channel utilization is higher in
our proposed scheme.