Security methods in fault tolerant modified line graph based networks

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.