28 September 2006 Novel heuristic algorithms of candidate p-cycles in mesh WDM networks
Author Affiliations +
Proceedings Volume 6354, Network Architectures, Management, and Applications IV; 635411 (2006) https://doi.org/10.1117/12.688019
Event: Asia-Pacific Optical Communications, 2006, Gwangju, South Korea
Abstract
We study and test several P-Cycle generation algorithms from different strategies. The basic approach of P-Cycle algorithm is to identify an elementary cycle-set firstly, and then to search for improvements on this set through different strategies to create the final P-Cycle-set with higher efficiency. The P-Cycle generation algorithms which are presented in this paper are in terms of three aspects that are elementary cycle-set generation, expansion strategies and expansion times. At last simulation and analysis with these different algorithms will be presented.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Pei Zhang, Pei Zhang, Jian Li, Jian Li, Pei Luo, Pei Luo, Jie Zhang, Jie Zhang, Ludi Zheng, Ludi Zheng, Wanyi Gu, Wanyi Gu, } "Novel heuristic algorithms of candidate p-cycles in mesh WDM networks", Proc. SPIE 6354, Network Architectures, Management, and Applications IV, 635411 (28 September 2006); doi: 10.1117/12.688019; https://doi.org/10.1117/12.688019
PROCEEDINGS
10 PAGES


SHARE
Back to Top