Link Failure and Recovery in wired network

Source can deliver the data to the destination via the forwarding link. Failure of the forwarding link affects the packet delivery and creates the packet loss. Data need rerouting on such condition over alternative link called backup link. Link failure in the network may due to several reasons.
  • dual-link failures

  • single-node failures create the packet loss.


Protection graph provides recovery solution for the link failure. A single node has three protection graphs for rerouting. It uses two trees namely red tree and blue tree. The first approach is referred to as the red tree first (RTF), where every packet is forwarded along the red tree. The second approach is referred to as the shortest tree first (STF), where a packet is forwarded along the tree that provides the shortest path to the root of the tree.

NS2 Solution:

  • ARPANET is constructed with 20 nodes and each node is connected with minimum three links.

  • Single link failure, dual link failure and single node failure is created in the network.

  • Algorithm for protection graph is implemented using the construction code for red tree, blue tree.

  • Data rerouting is carried out over the constructed tree that is having the shortest path length.

  • Performance is evaluated in terms of path length calculation during each failure category.

Related Titles:

  • Fast Recovery from Dual-Link or Single-Node Failures in IP Networks Using Tunneling IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 18, NO. 6, DECEMBER 2010.