A scalable and decentralized fast-rerouting scheme with efficient bandwidth sharing
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Parallel and Distributed Systems
Reliability assessment of optical p-cycles
IEEE/ACM Transactions on Networking (TON)
An open source traffic engineering toolbox
Computer Communications
Can critical real-time services of public infrastructures run over ethernet and MPLS networks?
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
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)
Differentiated recovery in WDM networks
Photonic Network Communications
Overlay protection against link failures using network coding
IEEE/ACM Transactions on Networking (TON)
The backup reprovisioning problem of FIPP p-cycles for node failure on survivable WDM networks
Photonic Network Communications
Dependable WDM networks with edge-disjoint p-cycles
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Applicability of resilient routing layers for k-fault network recovery
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Resilient routing layers for network disaster planning
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Intra autonomous system overlay dedicated to communication resilience
CRITIS'07 Proceedings of the Second international conference on Critical Information Infrastructures Security
ICIC'11 Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications
Hi-index | 0.07 |
We describe a novel restoration strategy called virtual protection cycles (p-cycles, patents pending) for extremely fast restoration in IP networks. Originally conceived for use in WDM and Sonet transport networks, we outline the adaption of the p-cycle concept to an IP environment. In an IP router-based network, p-cycles are implemented with virtual circuits techniques (such as an MPLS label switched path, or other means) to form closed logical loops that protect a number of IP links, or a node. In the event of failure, packets which would normally have been lost are encapsulated with a p-cycle IP address and reenter the routing table, which diverts them onto a protection cycle. They travel by normal forwarding or label switching along the p-cycle until they reach a node where the continuing route cost to the original destination is lower than that at the p-cycle entry node. Diverted packets are deencapsulated (dropped from the p-cycle) at that node and follow a normal (existing) route from there to their destination. Conventional routing protocols such as OSPF remain in place and operate as they do today, to develop a longer term global update to routing tables. Diversionary flows on the p-cycle inherently cease when the global routing update takes effect in response to the failed link or node. The p-cycle thus provides an immediate real-time detour, preventing packet loss, until conventional global routing reconvergence occurs. The aim of the paper is to explain the basic p-cycle concept and its adaptation to both link and node restoration in the IP transport layer, and to outline certain initial results on the problem of optimized design of p-cycle based IP networks.