Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Network coding: an instant primer
ACM SIGCOMM Computer Communication Review
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory
The generic framing procedure (GFP): an overview
IEEE Communications Magazine
IP layer restoration and network planning based on virtual protection cycles
IEEE Journal on Selected Areas in Communications
Extending the p-cycle concept to path segment protection for span and node failure recovery
IEEE Journal on Selected Areas in Communications
Survivability in optical networks
IEEE Network: The Magazine of Global Internetworking
Two-link failure protection in WDM mesh networks with p-cycles
Computer Networks: The International Journal of Computer and Telecommunications Networking
Overlay protection against link failures using network coding
IEEE/ACM Transactions on Networking (TON)
Network protection codes: Providing self-healing in autonomic networks using network coding
Computer Networks: The International Journal of Computer and Telecommunications Networking
Network-coded multiple-source cooperation aided relaying for free-space optical transmission
International Journal of Communication Systems
Realization strategies of dedicated path protection: A bandwidth cost perspective
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
p-Cycles have been proposed for preprovisioned 1 + N protection in optical mesh networks. Although the protection circuits are preconfigured, the detection of failures and the rerouting of traffic can be a time consuming operation. Another survivable mode of operation is the 1 + 1 protection mode, in which a signal is transmitted to the destination on two link disjoint circuits, hence recovery from failures is expeditious. However, this requires a large number of protection circuits. In this paper, we introduce a new concept in protection: 1 + N protection, in which a p-Cycle, similar to FIPP p-cycles, can be used to protect a number of bidirectional connections, which are mutually link disjoint, and also link disjoint from all links of the p-Cycle. However, data units from different circuits are combined using network coding, which can be implemented in a number of technologies, such as Next Generation SONET (NGS), MPLS/GMPLS, or IP-over-WDM. The maximum outage time under this protection scheme can be limited to no more than the p-Cycle propagation delay. It is also shown how to implement a hybrid 1 + N and 1 + N protection scheme, in which on-cycle links are protected using 1 + N protection, while straddling links, or paths, are protected using 1 + N protection. Extensions of this technique to protect multipoint connections are also introduced. A performance study based on optimal formulations of the 1 + 1, 1 + N and the hybrid scheme is introduced. Although 1 + N speed of recovery is comparable to that of 1 + N protection, numerical results for small networks indicate that 1 + N is about 30% more efficient than 1 + 1 protection, in terms of the amount of protection resources, especially as the network graph density increases.