Open AccessDifferentiation between Bellman-Ford and Dijsktra Algorithm in Routing Protocols
Author(s) -
P Ravi,
P Vln Srinivasa Rao
Publication year - 2020
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.d1882.029420
Subject(s) - computer science , source routing , computer network , network packet , equal cost multi path routing , link state packet , dijkstra's algorithm , routing (electronic design automation) , shortest path problem , distributed computing , routing protocol , algorithm , link state routing protocol , processing delay , transmission delay , theoretical computer science , graph
The modus operandi of congregating data pre-owned by home area network (HAN) protocols in order to deliver data across confined or extensive distance connection and that which is transmittal over a digital network in the form of packets is called as packet switching. Packet switching necessitates packaging of data in meagre units (packets) that are routed through a network, based on destination address contained within each packet and with the usage of network switches and routers. In packet switching networks, routing is the Avant-graded and multifaceted resolution maker, that controls the direction of network packets from their source in the vicinity of their destination through intermediate network nodes by precise packet advancing techniques. Here, in this disquisition we made an interpretation apropos the dyad pre-eminent shortest path (closest distance) searching algorithms, which are used in routing. They’re the BELLMAN-FORD and DIJKSTRA’S algorithm. The anatomization of the differentiation between the two is given concisely.