ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Avoiding Loops and Packet Losses in Internet Service Protocol Networks

Journal: International Journal of Engineering Research (IJER) (Vol.3, No. 1)

Publication Date:

Authors : ;

Page : 26-30

Keywords : ISP networks; OUTFC (Ordered Updating Technique with Fast Convergence); Link Failures; . Reverse Shortest Path Tree (RSPT).;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

Even in well managed Large ISP networks, failures of links and routers are common. Due to these failures the routers update their routing tables. Transient loops can occur in the networks when the routers adapt their forwarding tables. In this paper, a new approach is proposed that lets the network converge to its optimal state without loops and the related packet lossless. The mechanism (OUTFC-Ordered Updating Technique with Fast Convergence) is based on an ordering of the updates of the forwarding tables of the routers and fast convergence. Typically we have chosen a Network consisting of routers and Link costs for simulation. Link failures are simulated. Avoiding transient loops in each case is demonstrated, by constructing a Reverse Shortest Path Tree (RSPT).

Last modified: 2014-01-05 23:14:18