Paper
19 November 2009 An improved multicast routing algorithm in sparse splitting optical networks
Jianping Wang, Xiaosong Yu, Junling Yuan, Zhijun Wu, Qiwu Wu
Author Affiliations +
Proceedings Volume 7633, Network Architectures, Management, and Applications VII; 76331S (2009) https://doi.org/10.1117/12.851316
Event: Asia Communications and Photonics, 2009, Shanghai, Shanghai , China
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.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jianping Wang, Xiaosong Yu, Junling Yuan, Zhijun Wu, and Qiwu Wu "An improved multicast routing algorithm in sparse splitting optical networks", Proc. SPIE 7633, Network Architectures, Management, and Applications VII, 76331S (19 November 2009); https://doi.org/10.1117/12.851316
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Connectors

Optical networks

Computer simulations

Wavelength division multiplexing networks

Molybdenum

Wavelength division multiplexing

Communication engineering

Back to Top