Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Network convergence as the process of synchronizing network forwarding tables after a topology change.Please can some explain clearly what are the steps in OSPF Convergence and how is it better than RIP Convergence ?
OSPF is link-state algorithm (it uses Dijkstra’s shortest path algorithm) hence has the view of entire network. This ensures that every router in the network know the full network topology and can decide which routes to use to different destinations (subnets). Convergence of OSPF is dependent on OSPF timers (for better understanding http://www2.ensc.sfu.ca/~ljilja/cnl/pdf/hubert.pdf , this has details on convergence tests).
RIP is a distance vector protocol and distance vector has count-to-infinity problem. RIP uses network diameter concept to avoid this problem. The maximum network diameter can be 15 in RIP hence hop count (measure of distance in RIP) is limited to 15 and this avoids count-to-infinity problem. Convergence of RIP is hence (in worst case) equal to network-diameter or 15 to be precise.
Hope this helps.