Routing Protocols |
Author(s): |
| Nahush K. Kulkarni , K.J.Somaiya College of Engineering; Rutuja v. Jadhav, Ramrao Adik Institute of Technology |
Keywords: |
| Routing Protocols, RIP, EIGRP, OSPF, VLSM, Bellman-Ford Algorithm, Diffusing Update Algorithm, Dijkstra Shortest Path First |
Abstract |
|
A computer network is a collection of nodes that are dynamically and arbitrarily located in various parts of the world. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. The primary goal of such a network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This article gives an overview of different routing protocols emphasizing more on three different protocols namely Routing Information Protocol (RIP), Enhanced Interior Gateway Routing Protocol (EIGRP) and Open Shortest Path First (OSPF). |
Other Details |
|
Paper ID: IJSRDV4I30951 Published in: Volume : 4, Issue : 3 Publication Date: 01/06/2016 Page(s): 1166-1169 |
Article Preview |
|
|
|
|
