A Technique for Fast Reroute on Data Transmission with Data Protection
M. Nagakannan1, S. Ram Kumar2, K. Sathesh Kumar3, R. Renuga Devi4, S. Krishnaveni5, J. Macklin Abraham Navamani6, P. Sriramakrishnan7
1M. Nagakannan, Department of Computing, Kalasalingam Academy of Research and Education College, Krishnankoil (Tamil Nadu), India.
2S. Ram Kumar, Department of Computing, Kalasalingam Academy of Research and Education College, Krishnankoil (Tamil Nadu), India.
3K. Sathesh Kumar, Department of Computing, Kalasalingam Academy of Research and Education College, Krishnankoil (Tamil Nadu), India.
4R. Renuga Devi, Department of Computing Science, Vels Institute of Science, Technology and Advanced Studies (VISTAS), Pallavarm, Chennai (Tamil Nadu), India.
5S. Krihnaveni, Department of Computer Science, G. Venkataswamy Naidu College (SFC), Kovilpatti (Tamil Nadu), India.
6J. Macklin Abraham Navamani, Department of Computer Applications, Karunya Institute of Technology and Sciences, Coimbatore (Tamil Nadu), India.
7P. Sriramakrishnan, Department of Computing, Kalasalingam Academy of Research and Education College, Krishnankoil (Tamil Nadu), India.
Manuscript received on 01 December 2019 | Revised Manuscript received on 19 December 2019 | Manuscript Published on 31 December 2019 | PP: 524-528 | Volume-8 Issue-4S2 December 2019 | Retrieval Number: D10981284S219/2019©BEIESP | DOI: 10.35940/ijrte.D1098.1284S219
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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.
Keywords: Packets, Grade Diffusion, Directed Diffusion, Block Lists, Fast Reroute.
Scope of the Article: Data Mining