G. Mohan, M. Ashish, and K. Akash (Singapore)
IP over WDM, Wavelength division multiplexing, Opticalburst switching, Scheduling, Time-slotting, Burst fragmentation.
The recent explosive growth in the Internet technology has
made it imperative to have a network which supports a very
high bandwidth.Wavelength division multiplexing (WDM)
based on optical networks are becoming a viable solution
to meet this ever-increasing bandwidth demand. Optical
burst switched (OBS) networks provide a good solution for
a very high trafﬁc inﬂux which is generally bursty in nature.
In this a single control header is sent for a group of pack
ets which constitute a burst. A good scheduling algorithm
which provides efﬁcient resource utilization and increased
acceptance ratio for bursts is desired. At the same time it is
important that the algorithm is not very computationally in
tensive. In this paper we develop a computationally simple
algorithm which schedules bursts in a more efﬁcient way
than the existing algorithms , . The proposed algo
rithm uses the concepts of time-slotting and burst fragmen
tation to improve performance in terms of burst dropping
probability. Extensive simulation results have been used to
demonstrate the performance of the algorithm.