Sciweavers

Share
ICETET
2009
IEEE

Best Fit Void Filling Algorithm in Optical Burst Switching Networks

9 years 6 months ago
Best Fit Void Filling Algorithm in Optical Burst Switching Networks
: Optical Burst Switching is a promising technology in Optical Network. Scheduling of data burst in data channels in an optimal way is one of a key problem in Optical Burst Switched networks. The main concerns in this paper is to schedule the incoming bursts in proper data channel such that more burst can be scheduled so burst loss will be less. There are different algorithms exists to schedule data burst on data channels. Latest available unscheduled channel with void filling and minimum end void are the best among other existing non-segmentation based void filling algorithms. Though it gives less burst loss, but not utilizing the existing voids efficiently. In this paper we propose a new approach, which will give less burst loss and also utilize voids in efficient way. Also analyze the performance of this proposed scheduling algorithm and compare it with the existing void filling algorithms with respect to burst loss by simulation. It is shown that the proposed algorithm gives some b...
M. Nandi, Ashok K. Turuk, D. K. Puthal, S. Dutta
Added 23 May 2010
Updated 23 May 2010
Type Conference
Year 2009
Where ICETET
Authors M. Nandi, Ashok K. Turuk, D. K. Puthal, S. Dutta
Comments (0)
books