Comparison of various Features of Dynamic Routing Algorithms

Authors:

Dr. Yashpaul Singh (Director, AICTE, New Delhi)

Dr. M.K. Soni (Manav Rachna International University, Faridabad)

Dr. A. Swarup (National Institute of Technology, Kurukshetra)

Abstract:

This research paper discusses about the dynamic routing algorithms. The dynamic routing algorithms are mainly classified in two types i.e. Distance Vector routing algorithm (e.g. RIP, IGRP, EIGRP) and Link state routing algorithm (OSPF). The Latest research is giving stress on the adaptability feature and many other features like Scalability, Metric Calculation , Convergence time, Load balancing, Support of VLSM (Variable length subnet masking) and Operational overheads of dynamic routing algorithms. So in this paper the comparison of dynamic routing algorithms will be made in terms of the features. and simulation comparison of single path and multi-path link state routing algorithms using ns-2 (network simulator 2) will also be considered.