NP-completeness of some edge-disjoint paths problems
Discrete Applied Mathematics
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Network coding: an instant primer
ACM SIGCOMM Computer Communication Review
Code Design for Dependable Systems: Theory and Practical Application
Code Design for Dependable Systems: Theory and Practical Application
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
Reinforcement Learning in Autonomic Computing: A Manifesto and Case Studies
IEEE Internet Computing
1 + N network protection for mesh networks: network coding-based protection using p-cycles
IEEE/ACM Transactions on Networking (TON)
AN'06 Proceedings of the First IFIP TC6 international conference on Autonomic Networking
IEEE Transactions on Information Theory
On Quantum and Classical BCH Codes
IEEE Transactions on Information Theory
Survivability in optical networks
IEEE Network: The Magazine of Global Internetworking
Fault-tolerant routing mechanism based on network coding in wireless mesh networks
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Agile recovery from link failures in autonomic communication networks is essential to increase robustness, accessibility, and reliability of data transmission. However, this must be done with the least amount of protection resources, while using simple management plane functionalities. Recently, network coding has been proposed as a solution to provide agile and cost efficient self-healing against link failures, in a manner that does not require data rerouting, packet retransmission, or failure localization, hence leading to simple control and management planes. To achieve this, separate paths have to be provisioned to carry encoded packets, hence requiring either the addition of extra links, or reserving some of the resources for this purpose. In this paper we introduce self-healing strategies for autonomic networks in order to protect against link failures. The strategies are based on network coding and reduced capacity, which is a technique that we call network protection codes (NPC). In these strategies, an autonomic network is able to provide self-healing from various network failures affecting network operation. Also, network protection codes are extended to provide self-healing from multiple link failures in autonomic networks. Although this leads to reducing the network capacity, the network capacity reduction is asymptotically small in most cases of practical interest. We provide implementation aspects of the proposed strategies, derive bounds and show how to construct network protection code. The paper also develops an Integer Linear Program formulation to evaluate the cost of provisioning connections using the proposed strategies, and uses results from this formulation to show that it is more resource efficient than 1+1 protection. A simulation study to evaluate the recovery times, and the buffering requirements due to network coding is also conducted using the OPNET simulator.