Skip to main content
Article thumbnail
Location of Repository

Network Recovery of Dual Link Failure for Multiple Drain Nodes

By Brijesh A. Bh and Deepali B. Gothawal

Abstract

Abstract — As the Internet developed gradually into a ubiquitous communication infrastructure and takes an increasingly central role in our communications, the slow convergence of routing protocols after a network failure becomes a major problem. Failures in network usually begin when one of its parts failed. When this happens, nearby nodes connected links must then take up the slack for its failed components. This overloads nodes and links, causing them to fail as well, prompting additional nodes and links to fail in a vicious cycle. To assure fast recovery from link and node failures in IP networks, the paper present a new scheme from failure in IP network with Color tree calculation using generalized colored tree algorithm. The primary scheme provides recovery for up to two link failure along a path with single Drain Node. The proposed technique requires multiple drain networks to recover from dual link failure. The goal of this paper is to embellish the robustness of the network to dual-link failures. Data fusion technique is added to existing method to improve network performance. To this end, a new technique is to be developed that combine the positive aspects of the various single-link and node failure recovery techniques. Paper presents and analyzes its performance with respect to scalability, load distribution, and backup path lengths after a failure. The System provides fast recovery from Single and dual link failure from Multi Drain Network

Topics: Fast Recovery, Colored Trees, SimCT Algorithm, Data Fusion
Year: 2014
OAI identifier: oai:CiteSeerX.psu:10.1.1.413.4244
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ijetae.com/files/Vo... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.