Browse > Article

Group Scheduling for Efficient Channel Utilization in Optical Burst Switched Networks  

신종덕 (숭실대학교 정보통신전자공학부)
Publication Information
Journal of the Institute of Electronics Engineers of Korea TC / v.40, no.10, 2003 , pp. 51-58 More about this Journal
Abstract
In this paper, we propose a group scheduling scheme to efficiently utilize network resources for core nodes in optical burst switching networks. This scheme schedules multiple bursts utilizing an interval graph to obtain the maximum stable set using the information such as arrival times and burst lengths from the collected header packets. Simultaneous scheduling of multiple bursts in a scheduling window results in lower burst loss probability and increased channel utilization than those proposed previously using one-to-one mapping. Simulation results for both cases of variable and fixed burst sizes show that the group scheduling scheme is better than the immediate scheduling, so called Latest Available Unused Channel with Void Filling, scheme in both performance metrics above mentioned.
Keywords
Group scheduling; optical burst switching; scheduling; channel utilization; burst drop probability; optical networks;
Citations & Related Records
연도 인용수 순위
  • Reference
1 F. Gavril, 'Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph,' SIAM Journal of Computing, Vol 1, No. 2, pp. 180-187, 1972   DOI
2 C. Qiao and M. Yoo, 'Optical Burst Switching (OBS): A New Paradigm for an Optical Internet,' Journal of High-Speed Networks, pp. 69-84, 1999
3 Jong-Dug Shin, Saravut Charcranoon, Hakki C. Cankaya, and Tarek S. El-Bawab, 'Procedures and Functions for Operation and Maintenance in Optical Burst-Switching Networks,' IPOM2002, Dallas, TX, pp. 149-153, Oct. 29-31, 2002   DOI
4 J. Y. Wei and R. I. McFarland, 'Just-In-Time Signaling for WDM Optical Burst Switching Networks,' IEEE Journal of Lightwave Technology, Vol. 18, No. 12,pp. 2019-2037, December 2000   DOI   ScienceOn
5 J. S. Turner, 'Terabit Burst Switching,' Journal of High-Speed Networks, pp. 3-16, 1999
6 Esther M Arkin and Ellen B. Silverberg, 'Scheduling Jobs with Fixed Start and End Times,' Discrete Applied Mathematics, Vol. 18, pp 1-8, 1987   DOI   ScienceOn
7 I. Widjaja, 'Performance Analysis of Burst Admission Control Protocols,' IEE Proceeding Communications, Vol. 142, pp 7-14, February 1995   DOI   ScienceOn
8 Y. Xiong, M Vandenhoute, and H. C. Cankaya, 'Control Architecture in Optical Burst Switched WDM Networks,' IEEE Journal on Selected Areas in Communications, vol. 18, no. 10, pp. 1838-1851, Oct. 2000   DOI   ScienceOn
9 Ulrich Faigle and Willem M Nawijin, 'Note on Scheduling Intervals On-Line,' Discrete Applied Mathematics, Vol. 58, pp 13-17, 1995   DOI   ScienceOn
10 Richard J. Lipton and Andrew Tomkins, 'Online Interval Scheduling,' Proc. 5th Annual ACM-SIAM Symp. On Discrete Algorithms, Arlington, VA, 1994
11 Martin C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980