Performance Analysis of Group Scheduling with Look-Ahead Algorithm for Optical Burst Switching Networks 


Vol. 31,  No. 12, pp. 1037-1043, Dec.  2006


PDF
  Abstract

There has been proposed an algorithm to reduce data burst processing delay in group scheduling in core nodes of optical burst switching networks. Since, in this algorithm, look-up tables containing all the void time information in scheduling windows are generated as soon as the primary group scheduling session terminates, it becomes faster to reassign dropped data bursts to proper voids in different data channels by referring to the tables. The group scheduling with this algorithm showed almost the same channel utilization as the one without using the algorithm but performed a little better in both burst loss probability and wavelength conversion rate. On the other hand, per-burst processing time has been reduced dramatically in the load region of higher than 0.8, showing a factor of 2.1 reduction at 0.9.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Shin and W. Jang, "Performance Analysis of Group Scheduling with Look-Ahead Algorithm for Optical Burst Switching Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 12, pp. 1037-1043, 2006. DOI: .

[ACM Style]

Jong-Dug Shin and Won-Seok Jang. 2006. Performance Analysis of Group Scheduling with Look-Ahead Algorithm for Optical Burst Switching Networks. The Journal of Korean Institute of Communications and Information Sciences, 31, 12, (2006), 1037-1043. DOI: .

[KICS Style]

Jong-Dug Shin and Won-Seok Jang, "Performance Analysis of Group Scheduling with Look-Ahead Algorithm for Optical Burst Switching Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 12, pp. 1037-1043, 12. 2006.