Routing information protocol updating algorithm

You may want to review the previous lesson about the link-state routing approach that is basis of the OSPF. How do IP routers build and maintain their forwarding tables?This module introduces the link state routing, examines the Dijkstra algorithm for shortest-path routing, and discusses the applications of the distance vector and link state routing in real Internet protocols.

Convergence is speeded up by requiring a router to implement triggered updates.The metrics used in the computation of shortest path is typically configured to be the number of hops.So a maximum number of hops is limited to 15, because RIP is intended for use in local area environments where the diameter of the network is usually quite small.It uses the distance-vector algorithms we discussed in our previous lesson.It runs on top of UDP via a well known port number 520.

Search for routing information protocol updating algorithm:

routing information protocol updating algorithm-59

In this course, we deal with the general issues regarding packet switching networks. One perspective involves external view of the network, and is concerned with services that the network provides to the transport layer that operates above it at the end systems.

Leave a Reply

Your email address will not be published. Required fields are marked *

One thought on “routing information protocol updating algorithm”

  1. The above image is what it will look like once you have joined a chat room, below the Chabazaar logo are the chat navigation links and also includes current chat room's name.