Burst segmentation for void-filling scheduling in optical burst switching

摘要

As a promising solution for the next generation optical Internet, optical burst switching still has much to be improved, especially on the design of core routers. This paper mainly focuses on the channel scheduling algorithms of core routers and proposes a new scheduling algorithm. The new scheduling algorithm integrates burst segmentation, one of contention resolution schemes that are another major concern in the core router design. The simulation results show that the new algorithm, compared to existing scheduling algorithms, can effectively lower the packet loss probability and is of great benefit to the network performance.