Routing information protocol updating algorithm

28 Jun

Routing Information Protocol (RIP) Overviewrouter ripdefault-metricdistribute-listecmpenableflash-update-timeignore-host-routesignore-must-be-zeronetworkpreferencequery-authenticationredistributesend-updatessource-Gatewayssplit-horizonterm-updatestimers basictrace filetrace flagtrusted-Gatewaysip rip authenticationip rip enableip rip metric-inip rip metric-outip rip no-receiveip rip no-sendip rip secondary-authenticationip rip versionshow ip rip database One of the most widely used interior gateway protocols is the Routing Information Protocol (RIP).RIP is an implementation of a distance-vector, or Bellman-Ford, algorithm.

routing information protocol updating algorithm-46routing information protocol updating algorithm-31routing information protocol updating algorithm-33

It defines how long an entry can stay in the routing table without being refreshed.

But please understand that I am providing premium content for free that takes hundreds of hours of time to research and write.

I don't want to go to a pay-only model like some sites, but when more and more people block ads, I end up working for free. :) If you like The TCP/IP Guide, please consider the download version.

It stores in its routing table the distance for each network it knows how to reach, along with the address of the "next hop" router -- another router that is on one of the same networks -- through which a packet has to travel to get to that destination.

If it receives an update on a route, and the new path is shorter, it will update its table entry with the length and next-hop address of the shorter path; if the new path is longer, it will wait through a "hold-down" period to see if later updates reflect the higher value as well, and only update the table entry if the new, longer path is stable.