<title>An improved multicast routing algorithm in sparse splitting optical networks</title>
Lists
Only you see this
Abstract
The constructing of multicast light-trees in WDM network with sparse splitting has been proven to be an NP-complete problem. The Member-Only (MO) algorithm provides the best links stress and wavelength usage, and the Distance Priority (DP) algorithm reduces the diameter of tree and average delay, which are sensitive in multicast applications. In order to diminish the diameter of tree and average delay further while maintaining the same link stress and average cost, we present an algorithm called Nearest Connector First Heuristic (NCFH) in this paper. Simulation results show that the proposed algorithm achieves a good performance.
BibTeX
@inproceedings{wang2009lt,
author = {Jianping Wang and Xiaosong Yu and Junling Yuan and Zhijun Wu and Qiwu Wu},
title = {{\<title\>An improved multicast routing algorithm in sparse splitting optical networks\</title\>}},
booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
year = {2009},
doi = {10.1117/12.851316},
}Loading related content...