Title :
Security methods in fault tolerant modified line graph based networks
Author :
Joshi, Prashant D. ; Hamdioui, Said
Abstract :
Many routing protocols make some assumptions on the correctness of the routing information in the router. This at times allows faults and malicious attacks in the networks. This paper describes a class of networks based on modified line graphs with many features to authenticate the data and controls of the message routing, and having properties of the shortest diameters and easy shortest path calculations. We describe this class of fault tolerant networks and the relevant properties. This helps understand the security mechanism, WISH (´What I See and Hear´) that probes the data and the routing information to reduce the possibility of router problems, malicious or otherwise.
Keywords :
cryptographic protocols; network theory (graphs); routing protocols; WISH security mechanism; data authenticate; easy shortest path calculation; fault tolerant modified line graph based networks; fault tolerant networks; malicious attacks; message routing control; routing information; routing protocols; security methods; shortest diameter calculation; Discrete Fourier transforms; Fault tolerance; Fault tolerant systems; Nanotechnology; Very large scale integration; Line Graphs; Node naming; Route determination; Secure networks; Shortest Path; control and data plane checks;
Conference_Titel :
Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT), 2014 IEEE International Symposium on
Conference_Location :
Amsterdam
Print_ISBN :
978-1-4799-6154-2
DOI :
10.1109/DFT.2014.6962104