Impact Factor:6.549
 Scopus Suggested Journal: Tracking ID for this title suggestion is: 55EC484EE39417F0

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Open Access and Multidisciplinary




Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed, Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

Efficient Network Recovery Scheme for a node or Link failure using Multiple Standard Routing Configurations

Sambi Reddy Kalli, Dr G Rama Swamy, , ,
Affiliations
M.Tech (CSE), Priyadarshini Institute of Technology & Science
Professor ( Dept.of CSE), Priyadarshini Institute of Technology & Science
:NOT ASSIGNED


Abstract
As the Internet takes an increasingly central role in our communications infrastructure; the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC). Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. MRC is strictly connectionless, and assumes only destination based hop-by hop forwarding. MRC is based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure. It can be implemented with only minor changes to existing solutions. In this paper we present MRC, and analyze its performance with respect to scalability, backup path lengths, and load distribution after a failure. We also show how an estimate of the traffic demands in the network can be used to improve the distribution of the recovered traffic, and thus reduce the chances of congestion when MRC is used.


Citation
Sambi Reddy Kalli,Dr G Rama Swamy."Efficient Network Recovery Scheme for a node or Link failure using Multiple Standard Routing Configurations". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.862-866, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1210.pdf,


Keywords : Networks Protocols, Routing Protocols, Reliability, Protection

References
[1] S. Bryant, M. Shand, and S. Previdi, “IP fast reroute using not-via addresses,” Internet Draft (work in progress), draft-ietf-rtgwgpfrrnotvia-addresses-01, Jun. 2007. 
[2] P. Francois, M. Shand, and O. Bonaventure, “Disruption free topology reconfiguration in OSPF networks,” in Proc. IEEE INFOCOM, Anchorage, AK, May 2007, pp. 89–97. 
[3] Amund Kvalbein and Audun Fosselie Hansen, Multiple Routing Configurations for Fast IP Network Recovery, in IEEE, VOL. 17, NO. 2, APRIL 2009. 
[4] Relaxed multiple routing configurations for IP fast reroute . Cicic, Tarik ; Hansen, A.F, Publication Year: 2008. 
[5] Relaxed multiple routing configurations: IP fast reroute for single and correlated failures, Kvalbein, Amund, Publication Year: 2009. 
[6] Optimality Principle Based Sink Tree Methodology for Adaptive Static Routing Using Multiple Route Configuration Scheme, Johal, Hartinder Singh, Publication Year: 2008. 
[7] Post-Failure Routing Performance with Multiple Routing Configurations, Kvalbein, Amund, Publication Year: 2007 
[8] On network traffic concentration and updating interval for proactive recovery method against largescale network failures, Kamei, Satoshi.
 [9] Minimum Backup Configuration-Creation Method for IP Fast Reroute ,Pelsser, Cristel, Publication Year: 2009 
[10] Transport Capacity for Wireless Networks with Multi-User Links, Peel, Christian B. Wireless Communications, IEEE Transactions on Volume:11,Issue: 6, Publication Year: 2012


DOI Link : NOT ASSIGNED

Download :
  V2I1210.pdf


Refbacks : Currently there are no Refbacks

Quick Links



DOI:10.22362/ijcert


Science Central

Score: 13.30





Submit your paper to [email protected]