In a vector routing protocol, the routers exchange network reachability information with their nearest neighbors. In other words, the routers communicate to each other the sets of destinations "address prefixes" that they can reach, and the next hop address to which data should be sent in order to reach those destinations.
This contrasts with link-state IGPs; vectoring protocols exchange routes with one another, whereas link state routers exchange topology information, and calculate their own routes locally.
A vector routing protocol floods reachability information throughout all routers participating in the protocol, so that every router has a routing table containing the complete set of destinations known to the participating routers.
RIP also includes some optimizations of this basic algorithm to improve stabilization of the routing database and to eliminate routing loops. Skip to Content. A Microsoft Company. Was this article helpful? Yes No 3 people found this helpful in last 30 days. Routing Information Protocol RIP is a protocol that routers can use to exchange network topology information. It is characterized as an interior gateway protocol, and is typically used in small to medium-sized networks. A router running RIP sends the contents of its routing table to each of its adjacent routers every 30 seconds.
When a route is removed from the routing table, it is flagged as unusable by the receiving routers after seconds, and removed from their tables after an additional seconds. In a network, two routers: A and B are connected. An administrator configures the RIP routing protocol on both routers. After configuration, the RIP routing protocol of both routers automatically exchanges the information of locally available networks.
This way, an administrator only needs to provide information about locally available networks once. After that, the RIP protocol automatically manages all changes in the network. To share the paths' information, the RIP protocol uses broadcast messages.
RIP protocol periodically reads the routing table and shares it with neighbors through a broadcast message. Upon receiving a broadcast message from a neighbor, the RIP protocol reads the broadcast message and updates the routing table accordingly.
For example, if the broadcast message contains information about a new path, the RIP protocol adds that path in the routing table or if the broadcast message contains information that an existing path has gone down, the RIP protocol removes that path from the routing table or marks that path unusable in the routing table.
When a router running RIP protocol broadcasts the routing table, it not only broadcasts the information about the locally connected networks but also broadcasts the information about the networks that it has learned from its neighbors through the previously received broadcasts. This update sequence eventually allows all routers to learn all paths. Suppose, in a network, four routers: A, B, C, and D are connected in a sequence. All four routers are using the RIP routing protocol. So whenever we want to access any server, the link between our computer and server is established through these routers only.
But how the routers are selected so that the distance between our computer and the server is minimum? This is what RIP does. It selects the shortest path between the computer and the remote server. Now, let's get down to the nitty and gritty of the RIP and discuss it in more detail. It is a vector routing protocol that uses the hop count as the routing unit for finding the most suitable path between the source and the destination.
Now, let us understand the meaning of the terms used in the definition of RIP. In a vector routing protocol, the routers interchange the network accessibility information with the nearest neighbours. They interchange the information of the set of destinations that they can reach and the next-hop address to which the data packet should be sent so that the data reaches the destination. Hop count is the number of routers that are between the source and the destination in a network. RIP considers the path with the shortest number of hops as the best path to a remote network hence placed in the routing table.
0コメント