A Technique to Minimize Contention in Optical Burst Switching Networks

摘要

Optical burst switching (OBS) is the new switching technique for next generationudoptical networks. However, there are certain issues such as burst aggregation,udscheduling, contention resolution and QoS that needs to be addressed in OBS.udThis thesis is an attempt to address the burst scheduling and burst contention inudOBS networks.udSeveral scheduling algorithms have been proposed in the literature, which canudbe categorized into Horizon and Void lling scheduling algorithm. Void lling algorithmsudperform better because they exploits void within a channel for scheduling.udReported void lling algorithms - Latest available unscheduled channel with voidudlling (LAUC-VF) and Minimum end void (Min-EV) - do not consider the voidudduration in scheduling. In this thesis we propose a new scheduling algorithm calledudBest Fit Void Filling (BFVF), which consider both void duration and incomingudburst length to nd an optimal void channel. We simulate our proposed schemeudusing obs-ns simulator and compared with LAUC-VF and Min-EV algorithm. Resultudshows that the burst loss ratio is lower and channel utilization is higher inudour proposed scheme.