Bellman Ford algorithm - In Routing Information Protocol (RIP)

9Citations
Citations of this article
47Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In a large scale network need a routing that can handle a lot number of users, one of the solutions to cope with large scale network is by using a routing protocol, There are 2 types of routing protocol that is static and dynamic, Static routing is manually route input based on network admin, while dynamic routing is automatically route input formed based on existing network. Dynamic routing is efficient used to network extensively because of the input of route automatic formed, Routing Information Protocol (RIP) is one of dynamic routing that uses the bellman-ford algorithm where this algorithm will search for the best path that traversed the network by leveraging the value of each link, so with the bellman-ford algorithm owned by RIP can optimize existing networks.

Cite

CITATION STYLE

APA

Sulaiman, O. K., Siregar, A. M., Nasution, K., & Haramaini, T. (2018). Bellman Ford algorithm - In Routing Information Protocol (RIP). In Journal of Physics: Conference Series (Vol. 1007). Institute of Physics Publishing. https://doi.org/10.1088/1742-6596/1007/1/012009

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free