CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A Segmentation based Channel Scheduling Scheme in Optical Burst Switching Networks

by A. Mandloi, V. Mishra
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 51 - Number 6
Year of Publication: 2012
Authors: A. Mandloi, V. Mishra
10.5120/8045-1363

A. Mandloi, V. Mishra . A Segmentation based Channel Scheduling Scheme in Optical Burst Switching Networks. International Journal of Computer Applications. 51, 6 ( August 2012), 11-18. DOI=10.5120/8045-1363

@article{ 10.5120/8045-1363,
author = { A. Mandloi, V. Mishra },
title = { A Segmentation based Channel Scheduling Scheme in Optical Burst Switching Networks },
journal = { International Journal of Computer Applications },
issue_date = { August 2012 },
volume = { 51 },
number = { 6 },
month = { August },
year = { 2012 },
issn = { 0975-8887 },
pages = { 11-18 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume51/number6/8045-1363/ },
doi = { 10.5120/8045-1363 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:49:41.204531+05:30
%A A. Mandloi
%A V. Mishra
%T A Segmentation based Channel Scheduling Scheme in Optical Burst Switching Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 51
%N 6
%P 11-18
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Optical Burst Switching (OBS) is considered to be a promising paradigm for bearing IP traffic in Wavelength Division Multiplexing (WDM) optical networks. 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. Non-preemptive Delay-First Minimum Overlap Channel with Void Filling and Non-preemptive Segment-First Minimum Overlap Channel with Void Filling are best among other existing segmentation based void filling algorithms. Though it gives less burst loss but not existing the channel utilization efficiently. In this paper we introduce a new approach, which will give less burst loss and also utilize existing channels in efficient way. Also analyze the performance of this proposed scheduling scheme and compare it with the existing void filling algorithms. It is shown by simulations that the proposed scheme gives some better performances compared to the existing schemes.

References
  1. K. Koduru 2005 New Contention Resolution Techniques for Optical Burst Switching, Master's thesis, Louisiana State University.
  2. V. M Vokkarane and J. P Jue. 2003 Segmentation-based non preemptive scheduling algorithms for optical burst-switched networks. IEEE First Inter-national Workshop on Optical Burst Switching (WOBS)
  3. K. Dolzer and C. Gauger, 2007 On burst assembly in optical burst switching networks - a performance evaluation of Just-Enough-Time", Proceedings of the 17th International Teletraffic Congress (ITC 17), Salvador
  4. Y. Xiong, M. Vandenhoute, and H. C. Cankaya, 2000. Control Architecture in Optical Burst Switched WDM Networks. IEEE JSAC, vol. 18, no. 10, pp. 1838 – 1851.
  5. M. Yoo, C. Qiao, and S. Dixit, 2000 QoS Performance of Optical Burst Switching in IP-Over-WDM Networks, IEEE Journal on Selected Areas in Communications, vol. 18.
  6. W. M. Golab and R. Boutaba, 1998 Resource Allocation in User-Controlled Circuit-Switched Optical Networks, LNCS Spinger- Verlag, vol. 16, no. 12, 2081 – 2094, December 1998.
  7. M. Yang, S. Q. Zheng, and D. Verchere, 2001 A QoS Supporting Scheduling Algorithm for Optical Burst Switching DWDM Networks, GLOBECOM 01 86 – 91.
  8. L. Xu, H. G. Perros, and G. Rouskas, 2001 Techniques for optical packet switching and optical burst switching, IEEE Communications Magazine, Vol. 39, 136-142.
  9. V. M. Vokkarane, G. P. V. Thodime, V. B. T. Challagulla, and J. P. Jue. 2008 Channel scheduling algorithms using burst segmentation and FDLs for optical burst-switched networks IEEE ICC. .
  10. M. Yoo, M. Jeong and C. Qiao, 2007 A High Speed Protocol for Bursty Traffic in Optical Networks", in SPIE's All-Optical Communication Systems: Architecture, Control and Protocol Issues, Vol. 3230, 79-90.
  11. Aydin, M. A. ; Atmaca, T. ; Turna, O. C. ; Zaim, H. , 2009 Performance Study of New OBS Channel Scheduling Algorithms in a Multiservice Network. etworking and Services, 2009. ICNS '09. Fifth International Conference. 242- 248
  12. Jinhui Xu; Chunming Qiao; Li, J. ; Guang Xu, : 2004 Efficient burst scheduling algorithms in optical burst-switched networks using geometric techniques. Selected Areas in Communications, IEEE Journal Volume:22 , Issue: 9, 1796- 1811.
  13. Hongyun Zheng; Changjia Chen; Yongxiang Zhao, 2006 Optimization Scheduling for Optical Burst Switching Networks with Wavelength Conversion. Communication Technology, 2006. ICCT '06. International Conference 1 - 4.
  14. R Netak, L. D. ; Chowdhary, G. V. ; Suryawanshi, V. N. ; Borade, J. 2011 Reverse scheduling approach for burst loss minimization in WDM OBS based networks. Computer and Communication Technology (ICCCT), 2011 2nd International Conference. 517 -523
Index Terms

Computer Science
Information Sciences

Keywords

Core Node OBS Scheduling Segmentation based Void Filling Algorithm Wavelength Conversion

Powered by PhDFocusTM