A new scheduling algorithm, which aims to provide proportional and controllable QoS in terms of burst loss probability for OBS (optical burst switching) networks, is proposed on the basis of a summary of current QoS schemes in OBS. With simulations, performance analyses and comparisons are studied in detail. The results show that, in the proposed scheme, burst loss probabilities are proportional to the given factors and the control of QoS performance can be achieved with better performance. This scheme will be beneficial to the OBS network management and the tariff policy making.
Optical Burst Switching (OBS) is considered as an efficient switching technique for building the next generation optical Internet. An offset-time-based scheme has recently been proposed in order to provide quality-of-service (QoS) in OBS networks. Unfortunately, the proposed service differentiation has several problems. In this paper, we propose a burst-length-based QoS scheme cooperate with Void-Filling, which is less complex and more valuable than existing offset-time-based scheme. Simulations are conducted to evaluate the performance of our burst-length-based scheme provisioning within OBS networks in terms of burst loss probability.
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.