A Comparison between Bellman-Ford and Dijkstra Algorithms

Abstract

This article presents the powerful tool of Bellman Ford and Dijkstra Algorithms to solve most of the various limited routing problems in the computer network, as well as to compare the two algorithms. We measure the efficiency of such routing algorithms in terms of attenuation and throughput. Those algorithms were written and simulated using Microsoft Visual Studio C++ 2008 Express version. They wrote and simulated these algorithms. Our findings show that for the best traffic effort, using the shortest wider path algorithm for assured traffic routing would result in relatively low throughput. While these algorithms are polynomial, they are often shown to have much greater computational complexity than the algorithms used on the Internet today by Bellman Ford. We recommend approximation algorithms which have a run time within a constant factor of that of the Bellman Ford algorithm without losing network throughput.