Burst segmentation for void-filling scheduling and its performance evaluation in optical burst switching.
As a promising solution for the next generation optical Internet, optical burst switching still has much to be improved, especially the design of core routers. This paper mainly focuses on channel scheduling algorithms of core routers and proposes a new practical scheduling algorithm. In the new algorithm, burst segmentation, one of the contention resolution schemes that are another major concern in core router design, is introduced. The proposed algorithm is analyzed theoretically and evaluated by computer simulations. The results show that the new algorithm, compared with existing traditional scheduling algorithms, can lower the packet loss probability and enhance the link utilization and network performance.
Tan
Wei
W
Wang
Sheng
S
Li
Lemin
L