By Topic

Local-map-based candidate node-encircling pre-configuration cycles construction in survivable mesh networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Taifei Zhao ; Faculty of Automation and Information Engineering Xi'an University of Technology, 710048, China ; Xizheng Ke ; Peilin Yang

This paper studies the protection problem of pre-configuration cycles (p-cycles) in survivable mesh networks. A new algorithm called local-map-based finding p-cycles algorithm (LFCA) is proposed to find the candidate p-cycles. The major difference between the previous algorithms of finding cycles and LFCA is that LFCA can find node-encircling p-cycles and some special link p-cycles which must contain some fixed nodes. The performance of LFCA is evaluated by computer simulations on the real world network topology.

Published in:

Future Information Networks, 2009. ICFIN 2009. First International Conference on

Date of Conference:

14-17 Oct. 2009