Application of ${p}$-Cycle Protection for the Substation Communication Network Under SRLG Constraints

In order to improve the security and stability of the intelligent substation communication networks, a novel shared risk link group (SRLG) weighted p-cycle algorithm (SWCA) is proposed by considering the diversity of different substation links and the associated fiber core. The proposed approach is dedicated to solve the problems of multiple failures by sharing risk analysis. Hybrid integer linear programming and heuristic algorithm implementation are presented to reduce the complexity of optimizing bandwidth allocation under SRLG constraints. The performance of bandwidth utilization, service reject rate, and protection resource redundancy is investigated under the dynamic traffic environment, and the optimum SRLG number is discussed. The experimental results from two demonstration networks with randomly set SRLGs show that SWCA can reserve more bandwidths and, therefore, more service requests can be served at the expense of protection redundancy. Completely separated SRLG protection will decrease simultaneous failure probability of the working path and protection path and, thus, improve the survivability of the substation communication network compared with the classical capacitated iterative design algorithm-grow and shortest path pair protection method. Meanwhile, the approach can restore multiple failures within intelligent substation communication networks, and can therefore enhance the survivability of the electric power communication network.

[1]  Jian-Qiang Hu,et al.  Diverse routing in optical mesh networks , 2003, IEEE Trans. Commun..

[2]  Shen Jie.  Survey on Smart Grid Technology , 2009 .

[3]  Tang Liangrui.  Survival routing algorithm based on DiR protection ring in novel power ICT network , 2011 .

[4]  Wayne D. Grover,et al.  Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[5]  Cheng Shijie.  Structures,Functions and Implementation of United Information System for Smart Grid , 2010 .

[6]  Ke Xi-zheng.  A p-cycles assignation algorithm with SRLG constraints in survivable WDM optical networks , 2009 .

[7]  JI Yue-feng.  Overlapped Segment Shared Protection Scheme Based on SRLG Constraints , 2009 .

[8]  Wayne D. Grover,et al.  Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[9]  A. Di Giorgio,et al.  Open-Source Implementation of Monitoring and Controlling Services for EMS/SCADA Systems by Means of Web Services— IEC 61850 and IEC 61970 Standards , 2009, IEEE Transactions on Power Delivery.

[10]  Antonio Pietrabissa,et al.  Optimal Planning and Routing in Medium Voltage PowerLine Communications Networks , 2013, IEEE Transactions on Smart Grid.

[11]  N. Seeley,et al.  Making Peace with Communications Networks: Modern and Future Network Communication for Plants and Substations , 2013, IEEE Industry Applications Magazine.

[12]  Jean-Dominique Decotignie,et al.  Ethernet-Based Real-Time and Industrial Communications , 2005, Proceedings of the IEEE.

[13]  Chang Liu,et al.  p-Cycle Design in Survivable WDM Networks with Shared Risk Link Groups (SRLGs) , 2005, DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005..

[14]  Zhenrong Zhang,et al.  Dynamically survivable WDM network design with p-cycle-based PWCE , 2005, IEEE Communications Letters.

[15]  Wang Yi-rong.  A dynamic routing and wavelength assignment algorithm in novel ICT networks , 2010 .

[16]  János Tapolcai.  Shared risk link group failure restoration with in-band approximate failure localization , 2013, Opt. Switch. Netw..

[17]  Teresa Gomes,et al.  Candidate cycles generation for p-cycle calculation considering SRLGs , 2011, 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT).

[18]  Felix F. Wu,et al.  Discussion on Smart Grid Supporting Technologies , 2009 .

[19]  T. Skeie,et al.  Ethernet in substation automation , 2002 .

[20]  Bin Wang,et al.  Multi-Constrained Routing in Networks with Shared Risk Link Groups , 2006, 2006 IEEE Sarnoff Symposium.

[21]  G. Villalba,et al.  Optimal Selection of p-cycles on WDM Optical Networks with Shared Risk Link Group Independent Restorability using Genetic Algorithm , 2012, IEEE Latin America Transactions.

[22]  Bin Li,et al.  A novel multi-link fault-tolerant algorithm for survivability in multi-domain optical networks , 2011, Photonic Network Communications.

[23]  Xiaojiang Du,et al.  Self-protecting networking using dynamic p-cycle construction within link capacity constraint , 2012, Secur. Commun. Networks.

[24]  Wayne D. Grover,et al.  Near-optimal FIPP p-cycle network designs using general path-protecting p-cycles and combined GA-ILP methods , 2009, 2009 7th International Workshop on Design of Reliable Communication Networks.

[25]  Gu Wan-yi.  Automatic Configuration P-Cycle with Partial Flooding Based DCPC in Optical Mesh Network , 2009 .

[26]  Chang Liu,et al.  Finding good candidate cycles for efficient p-cycle network design , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[27]  Tang Liangrui.  A link failure protection algorithm applying to power automatic switched optical network based on p-cycle with completely separated SRLG , 2013 .

[28]  J. D. McDonald,et al.  Substation automation. IED integration and availability of information , 2003 .

[29]  Bin Li,et al.  Distributed Protocol for Removal of Loop Backs with Asymmetric Digraph Using GMPLS in P-Cycle Based Optical Networks , 2011, IEEE Transactions on Communications.