Abstract

Summary form only given. Since network backbones carry huge amounts of traffic, the failure of a single link can result in the loss of service, and consequently revenue. This is why backbone networks are required to be self-healing, and to survive failures. The survivability functionality has traditionally been provided using either restoration or protection techniques, where protection is the faster, and hence the preferred mode of survivable operation. However, proactive protection requires reserving backup resources, which are typically close to two thirds of the resources. This presentation will discuss recent advances in providing the self-healing functionality in networks such that self-healing is both fast, and resource efficient, which is achieved by using the technique of network coding. In this case, one set of protection circuits provides protection for multiple connections, and multiple signals can be transmitted on the same protection circuit simultaneously. This is done by linearly combining those signals using the technique of network coding. The strategy enables the transparent and instantaneous recovery from link failures, similar to proactive protection, but at a reduced cost due to protection circuit sharing. We show how this technique can be implemented to protect against single link failures, and then it can be extended to protect against multiple failures. The advantage of this technique is twofold: failures do not have to be detected, and signals do not have to be rerouted, hence leading to less involvement of the control and management planes, which expedites the error recovery process; also, protection circuits are shared by multiple connections, since multiple signals are linearly combined and transmitted on the same circuit, hence leading to the implementation of protection at a reduced cost. This technique can be implemented in the data forwarding plane, e.g, at the IP or MPLS layers, and can be regarded as a method for implementing Fast IP or MPLS protection, respectively.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.