Local-map-based Candidate Node-Encircling Preconfiguration Cycles Construction in Survivable Mesh Networks

摘要：

This paper studies the protection problem of preconfiguration 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.

关键词： mesh network p-cycle local-map finding cycles

作者: Taifei Zhao Xizheng Ke Peilin Yang

作者单位: Faculty of Automation and Information Engineering Xian University of Technology,10048 Xian,China Faculty of Automation and Information Engineering Xian University of Technology,710048 Xian,China

会议类型: 国际会议

会议名称: 2009 First International Conference on Future Information Networks(第一届未来信息网络国际会议)

会议地点: 北京

会议语种:英文

页码: 249-252

在线出版日期: 2009-10-14（万方平台首次上网日期，不代表论文的发表时间）