Traffic tree based burst scheduling in optical burst switching network

摘要

Serializing bursts at the ingress node is an effective method to reduce burst loss in OBS networks. One of the key issues in the scheduling scheme is home channel assignment. In this letter, serialized burst traffic load (SBTL) is defined to evaluate the burst serializing degree according to the traffic tree model. A home channel assignment algorithm based on the optimization of total SBTL is proposed. Simulation is performed to verify the efficiency of the burst scheduling scheme for the proposed algorithm. The results show that the performance of the proposed algorithm is better than that obtained by greedy algorithm.