Two dynamic reconfiguration approaches for optimizing the restoration path length in p-cycle protection network  

作　　者：Raghav Yadav Rama Shankar Yadav 

机构地区：[1]Computer Science and I.T.,Sam Higginbottam Institute of Agriculture Technology & Sciences [2]Computer Science and Engineering,Motilal Nehru National Institute of Technology

出　　处：《Optoelectronics Letters》2010年第4期291-294,共4页光电子快报（英文版）

摘　　要：p-cycle is one of the most promising technique of span protection in optical transport networks with mesh-like efficiency and ring-like speed.Longer p-cycle provides better efficiency in term of spare capacity,but longer restored path increases end-to-end propagation delay,which reduces the reliability of the restored network.Hence,minimization of restoration path is a critical issue in p-cycle based protection network.In this paper,two new dynamic reconfiguration approaches namely inter-cycles switching(ICS) and local restoration paths(LRP) are discussed to reduce the length of restored paths in existing optimal spare capacity design of p-cycle.Both proposed approaches are meant to utilize the idle p-cycles thus significantly reducing the path length.This reduction in restored path length also releases the redundant spare capacity.p-cycle is one of the most promising technique of span protection in optical transport networks with mesh-like efficiency and ring-like speed.Longer p-cycle provides better efficiency in term of spare capacity,but longer restored path increases end-to-end propagation delay,which reduces the reliability of the restored network.Hence,minimization of restoration path is a critical issue in p-cycle based protection network.In this paper,two new dynamic reconfiguration approaches namely inter-cycles switching（ICS） and local restoration paths（LRP） are discussed to reduce the length of restored paths in existing optimal spare capacity design of p-cycle.Both proposed approaches are meant to utilize the idle p-cycles thus significantly reducing the path length.This reduction in restored path length also releases the redundant spare capacity.

关 键 词：路径长度 动态重构 保护网络 周期 优化 备用容量 道路长度 网络保护 

分 类 号：TN929.11[电子电信—通信与信息系统]