Capacity-Efficient Protection with Fast Recovery in Optically Transparent Mesh Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Group shared protection for spare capacity reconfiguration in optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Optical networks
A new heuristic routing algorithm with Hamiltonian Cycle Protection in survivable networks
Computer Communications
Reliability assessment of optical p-cycles
IEEE/ACM Transactions on Networking (TON)
Survivability approaches using p-cycles in WDM mesh networks under static traffic
IEEE/ACM Transactions on Networking (TON)
Group shared protection for spare capacity reconfiguration in optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A fast reroute scheme for IP multicast
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
1 + N network protection for mesh networks: network coding-based protection using p-cycles
IEEE/ACM Transactions on Networking (TON)
ILP formulations for p-cycle design without candidate cycle enumeration
IEEE/ACM Transactions on Networking (TON)
Self-protecting networking using dynamic p-cycle construction within link capacity constraint
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
IEEE Journal on Selected Areas in Communications
Design of multi-granularity directed segment p-cycles
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
The backup reprovisioning problem of FIPP p-cycles for node failure on survivable WDM networks
Photonic Network Communications
Designing fast and bandwidth efficient protection scheme for WDM optical networks
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Self-protecting networking using dynamic p-cycle construction within link capacity constraint
Security and Communication Networks
Automatic protection switching for p-cycles in WDM networks
Optical Switching and Networking
| Hi-index | 0.07 |
The paper introduces an extension to the method of p-cycles for network protection. The p-cycle concept is generalized to protect path segments of contiguous working flow, not only spans that lie on the cycle or directly straddle the p-cycle. The original span protecting use of the p-cycle technique is extend to include path protection or protection of any flow segment along a path. It also gives an inherent means of protecting working flows that transit a failed node. We use integer linear programming to study the new concept and determine its inherent capacity requirements relative to prior p-cycle designs and other types of efficient mesh-survivable networks. Results show that path-segment-protecting p-cycles ("flow p-cycles") have capacity efficiency near that of the shared backup path-protection (SBPP) scheme currently favored for optical networking. Because its protection paths are fully preconnected and because it protects path segments (not entire paths), it has the potential for both higher speed and higher availability than SBPP. We also develop capacity optimization models to support 100% restoration of transiting flows through failed nodes. Only a very small additional spare capacity is needed to achieve both 100% span and intermediate node-failure restorabilities, and a very high transiting traffic restorability can be accomplished for node failure restorability given spare capacity only for span-failure protection. An immediate practical application is to suggest the use of flow p-cycles to protect transparent optical express flows through a regional network.