An Improved Multicast Routing Algorithm in Sparse Splitting Optical Networks
The construction of multicast light-trees in WDM network with sparse splitting has been proved to be an NP-complete problem. To reduce the diameter of the tree and average delay, an improved algorithm called Nearest Connector First Heuristic (NCFH) is proposed. The simulation results show that the proposed algorithm performs well.
(060.4255) Networks, multicast (060.4251) Networks, assignment and routing algorithms
Jianping Wang Xiaosong Yu Junling Yuan Zhijun Wu
Department of Communication Engineering, School of Information Engineering, University of Science and Technology Beijing, Beijing, China, 100083
国际会议
上海
英文
1-2
2009-11-01(万方平台首次上网日期,不代表论文的发表时间)