Novel heuristic algorithms of candidate p-cycles in mesh WDM networks

Pei Zhang; Jian Li; Pei Luo; Jie Zhang; Ludi Zheng; Wanyi Gu

doi:10.1117/12.688019

28 September 2006 Novel heuristic algorithms of candidate p-cycles in mesh WDM networks

Pei Zhang, Jian Li, Pei Luo, Jie Zhang, Ludi Zheng, Wanyi Gu

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.

Citation Download Citation

Pei Zhang, Jian Li, Pei Luo, Jie Zhang, Ludi Zheng, and 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); https://doi.org/10.1117/12.688019

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available