A Graph Theoretical Solution for Network Vulnerability Due to ARP Attacks

Provided by: International Journal of Advanced Research in Computer Science and Software Engineering (IJARCSSE)
Topic: Networking
Format: PDF
Fastest growing subject within graph theory is the study of domination. The focus here is to apply it on to reinforce the strength of computer networks by identifying and protecting the crucial points of the network and reducing the network vulnerability. Dominating sets play an important role in the reduction of computer network vulnerability, as in communication networks. Therefore, the work undertaken here is two pronged, one is to develop an algorithm to generate all possible minimal dominating sets for a given undirected graph of any network topology and the next step is to arrest the Address Resolution Protocol (ARP) attacks and reduce network vulnerability by monitoring and protecting the pivotal nodes identified from the minimal dominating sets.

Find By Topic