Share Email Print
cover

Proceedings Paper

An improved multicast routing algorithm in sparse splitting optical networks
Author(s): Jianping Wang; Xiaosong Yu; Junling Yuan; Zhijun Wu; Qiwu Wu
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 19 November 2009
PDF: 8 pages
Proc. SPIE 7633, Network Architectures, Management, and Applications VII, 76331S (19 November 2009); doi: 10.1117/12.851316
Show Author Affiliations
Jianping Wang, Univ. of Science and Technology Beijing (China)
Xiaosong Yu, Univ. of Science and Technology Beijing (China)
Junling Yuan, Univ. of Science and Technology Beijing (China)
Zhijun Wu, Univ. of Science and Technology Beijing (China)
Qiwu Wu, Univ. of Science and Technology Beijing (China)


Published in SPIE Proceedings Vol. 7633:
Network Architectures, Management, and Applications VII
Ken-ichi Sato; Lena Wosinska; Jing Wu; Yuefeng Ji, Editor(s)

© SPIE. Terms of Use
Back to Top