Ulteriori informazioni
The current trend in the internet working being so rapid, with the automation and increase in speed and sophistication of attack tools, each year doubling of newly discovered vulnerabilities and administrators finding it difficult to keep up to date with patches, increasing permeability of firewalls with firewall friendly protocols that are designed to bypass firewall configurations, increasing threat from infrastructure attacks like Distributed Denial of Service, Worms or attack on Domain Name Server cache and so on, finding generic solutions too is becoming infeasible. The speed with which internetworking and malicious attacks on the internet grows, the cost of cleaning and bringing business critical systems back online is sky-rocketing. The crucial need for internet security from within the organization, gives the thrust for this work that aims to devise a subnet based cost effective, easy to use solution to the vulnerabilities of Address Resolution Protocol (ARP) and to secure the network from ARP attacks using the concept of graph theory, the minimal dominating sets. The focus of this work is on a wired subnet.
Info autore
Dr.S.Vidya has completed M.Sc & M.Phil in Computer Science and the doctoral research in Computer Science under the guidance of Dr.R.Bhaskaran in Madurai Kamaraj University. Currently working as Associate Professor in the Department of Computer Science, Fatima College, Madurai, TamilNadu, India.
