Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
NP-completeness of some edge-disjoint paths problems
Discrete Applied Mathematics
On the distribution of rank of a random matrix over a finite field
Proceedings of the ninth international conference on on Random structures and algorithms
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Loopback recovery from double-link failures in optical mesh networks
IEEE/ACM Transactions on Networking (TON)
Approximating optimal spare capacity allocation by successive survivable routing
IEEE/ACM Transactions on Networking (TON)
Deterministic network coding by matrix completion
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
1 + N network protection for mesh networks: network coding-based protection using p-cycles
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Information Theory
On the singularity of generalised Vandermonde matrices over finite fields
Finite Fields and Their Applications
IP layer restoration and network planning based on virtual protection cycles
IEEE Journal on Selected Areas in Communications
Backup reprovisioning to remedy the effect of multiple link failures in WDM mesh networks
IEEE Journal on Selected Areas in Communications - Part Supplement
Survivability in optical networks
IEEE Network: The Magazine of Global Internetworking
On the Multiple-Unicast Capacity of 3-Source, 3-Terminal Directed Acyclic Networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
This paper introduces a network coding-based protection scheme against single- and multiple-link failures. The proposed strategy ensures that in a connection, each node receives two copies of the same data unit: one copy on the working circuit and a second copy that can be extracted from linear combinations of data units transmitted on a shared protection path. This guarantees instantaneous recovery of data units upon the failure of a working circuit. The strategy can be implemented at an overlay layer, which makes its deployment simple and scalable. While the proposed strategy is similar in spirit to the work of Kamal in 2007 2010, there are significant differences. In particular, it provides protection against multiple-link failures. The new scheme is simpler, less expensive, and does not require the synchronization required by the original scheme. The sharing of the protection circuit by a number of connections is the key to the reduction of the cost of protection. This paper also conducts a comparison of the cost of the proposed scheme to the 1 + 1 and shared backup path protection (SBPP) strategies and establishes the benefits of our strategy.