|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
2009 Second International Conference on Emerging Trends in Engineering & Technology
Best Fit Void Filling Algorithm in Optical Burst Switching Networks
Nagpur, Maharashtra India
December 16-December 18
ISBN: 978-0-7695-3884-6
| ASCII Text | x | ||
| M. Nandi, A. K. Turuk, D. K. Puthal, S. Dutta, "Best Fit Void Filling Algorithm in Optical Burst Switching Networks," Emerging Trends in Engineering & Technology, International Conference on, pp. 609-614, 2009 Second International Conference on Emerging Trends in Engineering & Technology, 2009. | |||
| BibTex | x | ||
| @article{ 10.1109/ICETET.2009.46, author = {M. Nandi and A. K. Turuk and D. K. Puthal and S. Dutta}, title = {Best Fit Void Filling Algorithm in Optical Burst Switching Networks}, journal ={Emerging Trends in Engineering & Technology, International Conference on}, volume = {0}, year = {2009}, isbn = {978-0-7695-3884-6}, pages = {609-614}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICETET.2009.46}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Emerging Trends in Engineering & Technology, International Conference on TI - Best Fit Void Filling Algorithm in Optical Burst Switching Networks SN - 978-0-7695-3884-6 SP609 EP614 A1 - M. Nandi, A1 - A. K. Turuk, A1 - D. K. Puthal, A1 - S. Dutta, PY - 2009 VL - 0 JA - Emerging Trends in Engineering & Technology, International Conference on ER - | |||
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.
Citation:
M. Nandi, A. K. Turuk, D. K. Puthal, S. Dutta, "Best Fit Void Filling Algorithm in Optical Burst Switching Networks," icetet, pp.609-614, 2009 Second International Conference on Emerging Trends in Engineering & Technology, 2009
Usage of this product signifies your acceptance of the Terms of Use.
