DocumentCode :
837775
Title :
Traffic tree based burst scheduling in optical burst switching network
Author :
Dai, Wei ; Wu, Guiling ; Chen, Jianping ; Li, Xinwan ; Yang, Yahong
Author_Institution :
State Key Lab. on Adv. Opt. Commun. Syst. & Networks, Shanghai Jiao Tong Univ., Shanghai
Volume :
12
Issue :
8
fYear :
2008
Firstpage :
590
Lastpage :
592
Abstract :
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.
Keywords :
channel allocation; optical burst switching; telecommunication traffic; home channel assignment algorithm; optical burst switching network; serialized burst traffic load; traffic tree based burst scheduling; Burst switching; Greedy algorithms; Optical buffering; Optical burst switching; Optical losses; Performance loss; Scheduling algorithm; Telecommunication traffic; Traffic control; Wavelength division multiplexing;
fLanguage :
English
Journal_Title :
Communications Letters, IEEE
Publisher :
ieee
ISSN :
1089-7798
Type :
jour
DOI :
10.1109/LCOMM.2008.080665
Filename :
4601449
Link To Document :
بازگشت