@article{MAKHILLAJIT2006565149,
    title = {An Efficient Method for Faulty Update Detection in Distance Vector Protocols},
    journal = {Asian Journal of Information Technology},
    volume = {5},
    number = {6},
    pages = {657-665},
    year = {2006},
    issn = {1682-3915},
    doi = {ajit.2006.657.665},
    url = {https://makhillpublications.co/view-article.php?issn=1682-3915&doi=ajit.2006.657.665},
    author = {R. Sabitha and},
    keywords = {Link state protocols,distance vector protocols,routing information,secure routing protocols,routing security},
    abstract = {The importance of securing the Internet has grown rapidly due to series of attacks that shut down
some of the world’s most high profile Web sites, including Amazon and Yahoo. Most of the research
concerning on securing the Internet focuses on protecting the data using techniques such as authentication
and encryption rather than securing the Internet Infrastructure. This leads to many instances where the
network infrastructure has been compromised by malicious adversaries. Thus, network infrastructure security
is clearly a pressing need, since the attacks have the potential for affecting the entire Internet infrastructure,
which may have serious consequences on the security and economic vitality of society. Among different
network threats, the routing table poisoning attack is the most devasting and least researched topic which
needs immediate research attention. In this paper, we develop an efficient method for faulty update detection
of routing table in distance vector protocols. The method is able to detect faulty updates in the routing table,
by calculating the predecessor information from the routing table at sending node and comparing it with that
of the receiving node.}
    }