Share Email Print
cover

Proceedings Paper

Novel heuristic algorithms of candidate p-cycles in mesh WDM networks
Author(s): Pei Zhang; Jian Li; Pei Luo; Jie Zhang; Ludi Zheng; Wanyi Gu
Format Member Price Non-Member Price
PDF $14.40 $18.00

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

Paper Details

Date Published: 28 September 2006
PDF: 10 pages
Proc. SPIE 6354, Network Architectures, Management, and Applications IV, 635411 (28 September 2006); doi: 10.1117/12.688019
Show Author Affiliations
Pei Zhang, Beijing Univ. of Posts and Telecommunications (China)
Jian Li, Beijing Univ. of Posts and Telecommunications (China)
Pei Luo, Beijing Univ. of Posts and Telecommunications (China)
Jie Zhang, Beijing Univ. of Posts and Telecommunications (China)
Ludi Zheng, Bell Labs. Research China (China)
Wanyi Gu, Beijing Univ. of Posts and Telecommunications (China)


Published in SPIE Proceedings Vol. 6354:
Network Architectures, Management, and Applications IV
Yong Hyub Won; Gee-Kung Chang; Ken-ichi Sato; Jian Wu, Editor(s)

© SPIE. Terms of Use
Back to Top