Share Email Print

Proceedings Paper

Performance of group scheduling with look-ahead algorithm for optical burst switching networks
Author(s): Jong-Dug Shin; Won-Seok Jang; Kyoungdeuk Park; Saravut Charcranoon
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

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.

Paper Details

Date Published: 8 December 2005
PDF: 8 pages
Proc. SPIE 6021, Optical Transmission, Switching, and Subsystems III, 60210U (8 December 2005); doi: 10.1117/12.636467
Show Author Affiliations
Jong-Dug Shin, Soongsil Univ. (South Korea)
Won-Seok Jang, Soongsil Univ. (South Korea)
Kyoungdeuk Park, Soongsil Univ. (South Korea)
Saravut Charcranoon, TRUE Corp. (Thailand)

Published in SPIE Proceedings Vol. 6021:
Optical Transmission, Switching, and Subsystems III
Rodney S. Tucker; Dominique Chiaroni; Wanyi Gu; Ken-ichi Kitayama, Editor(s)

© SPIE. Terms of Use
Back to Top