Whether you need to trade-up to a shiny new Firebox or just ready to upgrade from whatever appliance you're using now, WatchGuard has the right appliance for you! Find your perfect Firebox today with appliance sizing tool!
Course Of The Month
Become a Premium Member and unlock a new, free course in leading technologies each month.
Solved
RIP Number of update rounds until convergence
Posted on 2011-09-06
This question is pretty straightforward.
Given X number of routers all using RIP, how many rounds of updates are needed until all routers have a converged routing table ?
Is there a formula for this ?
Also I am interested in how to calculate the time required until RIP has converged.
I know that this is a distance vector routing protocol and most of the info on the net tells of slow convergence time but no info on how to calculate this.
Thanks.
Given X number of routers all using RIP, how many rounds of updates are needed until all routers have a converged routing table ?
Is there a formula for this ?
Also I am interested in how to calculate the time required until RIP has converged.
I know that this is a distance vector routing protocol and most of the info on the net tells of slow convergence time but no info on how to calculate this.
Thanks.
[X]
Welcome to Experts Exchange
Add your voice to the tech community where 5M+ people just like you are talking about what matters.
- Help others & share knowledge
- Earn cash & points
- Learn & ask questions
3-
3
6 Comments
Active today
>Is there a formula for this ?
I can't see how you could get a one size fits all formula since it would depend on the topology. Also, the definition of "rounds of updates", could also affect the answer since a RIP update can only hold 25 entries.
I can't see how you could get a one size fits all formula since it would depend on the topology. Also, the definition of "rounds of updates", could also affect the answer since a RIP update can only hold 25 entries.
As I understand it the time a network takes to converge is directly proportional to the size of the network.
Yes topology is important but I am only interested in a basic flat topology since RIP does not scale well and as you said only 25 entries are allowed for RIP
Here's an example:
R1---R2---R3---R4---R5---R
You have 6 routers.
I want to know:
How much time does it take for rip to converge ?
How many rounds of updates are needed ?
And I want to know how to calculate this for 3 routers for instance if i need to.
Yes topology is important but I am only interested in a basic flat topology since RIP does not scale well and as you said only 25 entries are allowed for RIP
Here's an example:
R1---R2---R3---R4---R5---R
You have 6 routers.
I want to know:
How much time does it take for rip to converge ?
How many rounds of updates are needed ?
And I want to know how to calculate this for 3 routers for instance if i need to.
Active today
>How much time does it take for rip to converge ?
Depends on the implementation of RIP. Could be 2:30 if triggered updates aren't used. Could be 5 seconds if they are. Or anywhere in between.
>How many rounds of updates are needed ?
What's your definition of "round"?
>And I want to know how to calculate this for 3 routers for instance if i need to.
Whenever a router has a link with another router, there will be an exchange of routing updates. So when the link between R1 and R2 is active, there will be a pair of updates (one in each direction). So that's two updates.
When the R2 - R3 link comes up, there will be an exchange there PLUS an update from R2 to R1. So now you're up to 5 updates overall.
When the R3 - R4 link comes up, there will be an exchange there PLUS an update from R3 to R2 and R2 to R1. So now you're up to 9 updates overall. And so on.
Depends on the implementation of RIP. Could be 2:30 if triggered updates aren't used. Could be 5 seconds if they are. Or anywhere in between.
>How many rounds of updates are needed ?
What's your definition of "round"?
>And I want to know how to calculate this for 3 routers for instance if i need to.
Whenever a router has a link with another router, there will be an exchange of routing updates. So when the link between R1 and R2 is active, there will be a pair of updates (one in each direction). So that's two updates.
When the R2 - R3 link comes up, there will be an exchange there PLUS an update from R2 to R1. So now you're up to 5 updates overall.
When the R3 - R4 link comes up, there will be an exchange there PLUS an update from R3 to R2 and R2 to R1. So now you're up to 9 updates overall. And so on.
There was a question in one of the exams I took and said something along the line of
"If all routers are running RIP, how many rounds of updates will occur before all routers know all networks?"
This is a packet tracer topology of the question.
Now I looked for the answer and it's 3.
But I never understood WHY it's 3.
Now you say it's 9 :)
I think that the number of updates needed is n-1 where n is the number of routers.
So if I have 4 routers in this flat topology there would be 4-1 rounds of updates. If you have 8 it's 7 rounds of update untill all routers know about all networks.
Now this is a simple example but this is a more complex example
Here it would take 5 updates to have a fully converged network.
The routing information is propagated faster when there are more interfaces.
Also you said it would take 2:30 (I don't think triggered updates are used by default on cisco routers) but there are 6 routers.
Would it not take 3 minutes ? 6 routers x 30 sec.
Active today
>But I never understood WHY it's 3. Now you say it's 9 :)
We're back to the definition of "round". If it's an exchange of updates between two peers, then for the first pair of routers, it would be 1. Then add 1 for every additional pair. So if we follow that definition, for the four routers in your first diagram, the answer would be 3.
But it would be technically incorrect.
>I think that the number of updates needed is n-1 where n is the number of routers.
That would be my interpretation of the (incorrect) methodology. :-)
>Would it not take 3 minutes ? 6 routers x 30 sec.
Triggered updates have been in used on Cisco's implementation of RIP for a long time. At least 15 years. The problem is that even if it's not, it comes down to chance. From the time R2 learns routes from R1, how long will it be before R2's 30 second update times expires? It could be 1 second or it could be 30 seconds. So for four routers, the convergence time (once again using the methodology above) could be as short as a couple seconds or as long as 90 seconds. Or somewhere in between.
Bottom line is this: You seem to have a pretty good handle on how Distance Vector Routing Protocols work. Now move on. Don't get bogged down in trying to figure out some screwy interpretation of an exam prep question. Because, for the most part, the real exam questions won't go there.
We're back to the definition of "round". If it's an exchange of updates between two peers, then for the first pair of routers, it would be 1. Then add 1 for every additional pair. So if we follow that definition, for the four routers in your first diagram, the answer would be 3.
But it would be technically incorrect.
>I think that the number of updates needed is n-1 where n is the number of routers.
That would be my interpretation of the (incorrect) methodology. :-)
>Would it not take 3 minutes ? 6 routers x 30 sec.
Triggered updates have been in used on Cisco's implementation of RIP for a long time. At least 15 years. The problem is that even if it's not, it comes down to chance. From the time R2 learns routes from R1, how long will it be before R2's 30 second update times expires? It could be 1 second or it could be 30 seconds. So for four routers, the convergence time (once again using the methodology above) could be as short as a couple seconds or as long as 90 seconds. Or somewhere in between.
Bottom line is this: You seem to have a pretty good handle on how Distance Vector Routing Protocols work. Now move on. Don't get bogged down in trying to figure out some screwy interpretation of an exam prep question. Because, for the most part, the real exam questions won't go there.
Featured Post
It's inevitable. People leave organizations creating a gap in your service. That's where Percona comes in.
See how Pepper.com relies on Percona to:
-Manage their database
-Guarantee data safety and protection
-Provide database expertise that is available for any situation
Question has a verified solution.
If you are experiencing a similar issue, please ask a related question
ADCs have gained traction within the last decade, largely due to increased demand for legacy load balancing appliances to handle more advanced application delivery requirements and improve application performance.
When it comes to security, there are always trade-offs between security and convenience/ease of administration. This article examines some of the main pros and cons of using key authentication vs password authentication for hosting an SFTP server.
Here's a very brief overview of the methods PRTG Network Monitor (https://www.paessler.com/prtg) offers for monitoring bandwidth, to help you decide which methods you´d like to investigate in more detail. The methods are covered in more detail in o…
Michael from AdRem Software explains how to view the most utilized and worst performing nodes in your network, by accessing the Top Charts view in NetCrunch network monitor (https://www.adremsoft.com/). Top Charts is a view in which you can set seve…
Suggested Courses
Earn Certification
HTML5 Specialist - Certification
Free withPremium
Course of the Month5 days, 17 hours left to enroll
Earn Certification
Cisco CCNA Data Center: DCICT
$197.00$177.30
626 members asked questions and received personalized solutions in the past 7 days.
Join the community of 500,000 technology professionals and ask your questions.