Performance of group scheduling with look-ahead algorithm for optical burst switching networks

초록

An algorithm to reduce data burst processing delay in group scheduling in core nodes of optical burst switching networks has been proposed. 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, if any, by referring to the tables. The group scheduling with this algorithm showed almost the same performance as the previous group scheduling in regard to channel utilization 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 and burst loss probability has been improved more under lighter traffic condition.