Routing Information Protocol (RIP) protocol are the intradomain (interior) routing protocol which is based on distance vector routing and it is used inside an autonomous system.Routers and network links are called node. The first column of routing table is destination address. The cost of metric in this protocol is hop count which is number of network which need to be passed to reach destination. Here infinity is defined by a fixed number which is 16 it means that using a Rip, network cannot have more than 15 hops.
It is an open standard protocol means it works on the various vendors routers. It works on most of the router, it is classful routing protocol. Updates are broadcasted. Its administrative distance value is 120, it means it is not reliable, The lesser the administrative distance value the reliability is much more. Its metric is hop count and max hop count is 15. There will be total 16 router in the network. When there will be the same number of hop to reach destination, Rip starts to perform load balancing. Load balancing means if there are three ways to reach the destination and each way has same number of routers then packets will be sent to each path to reach the destination. This reduces traffic and also the load is balanced. It is used in small companies, in this protocol routing tables are updated in each 30 sec. Whenever link breaks rip trace out another path to reach the destination. It is one of the slowest protocol.
Advantages of RIP ver1 –
- Easy to configure, static router are complex.
- Less overhead
- No complexity.
Disadvantage of RIP ver1 –
- Bandwidth utilization is very high as broadcast for every 30 seconds.
- It works only on hop count.
- It is not scalable as hop count is only 15. If there will be requirement of more routers in the network it would be a problem .
- Convergence is very slow, wastes a lot of time in finding alternate path.
Due to some deficiencies in the original RIP specification, RIP version 2 was developed in 1993. It supports classless Inter-Domain Routing (CIDR) and has ability to carry subnet information, its metric is also hop count and max hop count 15 is same as rip version 1. It support authentication and does subnetting and multicasting. Auto summary can be done on every router. In RIPv2 Subnet masks are included in the routing update. RIPv2 multicasts the entire routing table to all adjacent routers at the address 220.127.116.11, as opposed to RIPv1 which uses broadcast (255.255.255.255).
Advantages of RIP ver2 –
- It’s a standardized protocol.
- It’s VLSM compliant.
- Provides fast convergence.
- It sends triggered updates when the network changes.
- Works with snapshot routing – making it ideal for dial networks.
Disadvantage of RIP ver2 – There lies some disadvantages as well:
- Max hopcount of 15, due to the ‘count-to-infinity’ vulnerability.
- No concept of neighbours.
- Exchanges entire table with all neighbours every 30 seconds (except in the case of a triggered update).
RIP ver1 versus RIP ver2:
|RIP Ver1||RIP Ver2|
|RIP v1 uses what is known as classful routing||RIP v2 is a classless protocol and it supports variable-length subnet masking (VLSM), CIDR, and route summarization|
|RIPv1 routing updates are broadcasted||RIP v2 routing updates are multicasted|
|RIPv1 has no authentication||RIP v2 supports authentication|
|RIP v1 does not carry mask in updates||RIP v2 does carry mask in updates, so it supports for VLSM|
|RIP v1 is an older, no longer much used routing protocol||IP v2 can be useful in small, flat networks or at the edge of larger networks because of its simplicity in configuration and usage|
- Computer Network | Routing Information Protocol (RIP)
- Computer Network | Features of Enhanced Interior Gateway Routing Protocol (EIGRP)
- Computer Network | Distance vector routing v/s Link state routing
- Computer Network | Routing Protocols Set 1 (Distance Vector Routing)
- Computer Networks | Unicast Routing - Link State Routing
- Hot Standby Router Protocol (HSRP) and Virtual Router Redundancy Protocol (VRRP)
- Onion Routing
- Computer Network | Types of routing
- Computer Network | Classification of Routing Algorithms
- Inter VLAN Routing by Layer 3 Switch
- Computer Network | Routing v/s Routed Protocols
- Computer Network | Securing Routing Protocols
- Computer Network | Classes of routing protocols
- Computer Network | Fixed and Flooding Routing algorithms
- Probabilistic shortest path routing algorithm for optical networks
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.