Skip to Main Content
The paper proposes a new scheduling algorithm for core routers to support QoS in optical burst switching networks. In the proposed algorithm, which is named waiting-queuing-scheduling, all BHPs (burst header packets) are deliberately delayed a properly-designed time, and added to input queues with a policy. All BHPs are scheduled in a batch when the waiting period times out. Using one of the currently well-known scheduling algorithm as its sub-algorithm, the proposed scheme is rather simple and feasible, and can yield a good performance. The simulation results show that the burst loss probabilities of higher classes can be decreased greatly, while not introducing much end-to-end delay. In addition, with proper waiting time, the average loss probability can also be decreased.