Open AccessA Technique for Fast Reroute on Data Transmission with Data Protection
Author(s) -
M. Nagakannan,
S. Ramkumar,
K. Sathesh Kumar,
R. Santhiya Devi,
S Krihnaveni,
J. Macklin Abraham Navamani,
P. Sriramakrishnan
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.d1098.1284s219
Subject(s) - computer science , network packet , block (permutation group theory) , node (physics) , path (computing) , data transmission , transmission (telecommunications) , state (computer science) , routing (electronic design automation) , computer network , engineering , telecommunications , algorithm , mathematics , geometry , structural engineering
It is always viewed that data transmission get break down which is unique in all the IP sector in networks thus there many ideas which are given for fast rerouting in local areas by giving a high range of speed in data transferring insipte of the break downs. The overall ideas are only used for managing and preventing the single break downs only these ideas can only be used for single where as in multiple break downs they reflect as loops and even drop the data because of multiple non-partisan break downs are not handled by using such idea’s. To safeguard the flow of data even in multiple breaks down we scheme LOLS (Localized On-demand Link State). In LOLS the block list are converted into packets where sets are small in number in which links are failed and come across its path and next node is determined by omitting the block list. A ascendable LOLS is used for protecting and routing the data transmission in multiple break downs. Degrade is used to determine the links in LOLS. In this the world widely used and famous state greater than the current state. In LOLS block lists are in packets and next node is mentioned by running the block list links. This research gives a solution for the path break down occurring in data transmission and also gives protection to the data while they are transferred. Grade diffusion and direct diffusion are the two algorithms which are used in this paper