Routing information protocol updating algorithm
Request packets send requests to the neighbouring devices querying their RIP nodes to obtain their specific distance vector table.Within the request it will be specified whether they should return just a specific subset or the entire table content.Since RIP relies on timers to propagate its routing table around the network it can take a long time for full convergence.It cannot support Variable Length Subnet Masking which greatly limits efficient allocation of ip addresses.One of the biggest disadvantages is that it can only allow a maximum hop of 15, which greatly restricts the network size it can be used with.It continuously broadcasts its distance vector table even when no updates are made, which results is increases network resources been used.
These packets can be setup to be sent every 30 seconds, when requested to by another node, when a change is triggered to the local distance vector table. RIP 1 is specified in the RFC1058, and RIP 2 is specified in RFC1723. With every hop the metric is increased by 1and eventually every path will have a count.Due to various companies developing their own version, RFC 1058 unified the various implementations of RIP under once common standard.As the IP based network grew in numbers and size it was realised that the current RIP needed to be updated to accommodate it. This is not an example of the work written by our professional essay writers.Routing Information protocol is one such computer algorithm that is used to allow routers to communicate their routing tables with each other.