On the Feasibility and Efficacy of Protection Routing in IP Networks

Date Added: Dec 2009
Format: PDF

The protection routing procedures in IP networks has become a matter of great research and improvement owing to the growing demands of the resources available on the internet. Some of the major improvements have been required owing to the growing demand of quality of the internet services, and that involves the protection of data, and prevention of failures in a network's transmission and communication procedures. The basic idea of protection routing IP networks includes ensuring that a data packet moves in the presence of a "Single Failure". This is often understood as the lack of concurrence of a failure being reported with the data stream. The mechanism of protection routing aims at maximizing protectibility in an NP-Hard problem. One of the major aspects of implementing protection includes understanding the problem and subsequent necessity of protection routing. The important thing to understand is the efficiency of the advantage simple Forwarding Engines (FE) get to benefit from the scheme where protection routing is used with centralized routing. The basic modification also enhances performance, besides contributing to the protection ability of the network. The studies also require developers and implementers of this technology to understand the difficulty in computing PR (Protection Routing), which can be computed by using Greedy Algorithm. The algorithm is also primarily responsible for assuring protectibility and performance, requiring implementers to compute solutions to different requirements of protectibilty.