Abstract
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.
© 2009 OSA, IEEE Photonics Society, SPIE, COS, CIC
PDF ArticleMore Like This
Krzysztof Walkowiak, Andrzej Kasprzak, and Massimo Tornatore
AS4H.6 Asia Communications and Photonics Conference (ACP) 2015
Costas K. Constantinou and Georgios Ellinas
We.10.P1.88 European Conference and Exposition on Optical Communications (ECOC) 2011
Ziyan Yu, Yongli Zhao, Jie Zhang, XiaoSong Yu, BoWen Chen, and Xuefeng Lin
AF3E.3 Asia Communications and Photonics Conference (ACP) 2012