期刊名称：International Journal of Computer Science and Network
印刷版ISSN：2277-5420
出版年度：2014
卷号：3
期号：4
页码：247-252
出版社：IJCSN publisher
摘要：In Distance Vector Routing (DVR), each node maintains a list of all destinations that only contains the cost of getting to that destination, and the next node to send the messages to. Thus, the source node only knows to which node to hand the packet, which in turn knows the next node. This approach has an advantage of massively reduced storage costs compared to link-state algorithms. DVR algorithms are easier to implement and required less amount of required storage space and the actual determination of the route is based on the Bellman-Ford algorithm. Our motive was primarily intended to remove the weaknesses inherent in the widely used DVR based algorithm, which was established on the well-known Bellman- Ford shortest path algorithm. In this paper, we proposed a new routing approach named as component based neighbour routing (CBNR) that uses to create the distance vector routing table (DVRT) that would be truly dynamic, robust and free from the various limitations that have been discussed
