Cart (Loading....) | Create Account
Close category search window
 

Best Fit Void Filling Algorithm in Optical Burst Switching Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Nandi, M. ; Dept. of Comput. Sci. & Eng., Nat. Inst. of Technol., Rourkela, India ; Turuk, A.K. ; Puthal, D.K. ; Dutta, S.

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 better performances compared to the existing algorithms.

Published in:

Emerging Trends in Engineering and Technology (ICETET), 2009 2nd International Conference on

Date of Conference:

16-18 Dec. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.