A routing loop is a situation that occurs between two or more routers in which a packet is continuously routed between the routers as a result of irregularities from the routing algorithms and/or the routing tables of the routers. (routing loops, 2015).
An example is when three routers are connected in a triangular pattern i.e. router A is connected to router B, router B is connected to router C and router C is connected to router A, when the network is converged, all three routers will have sent their routing tables to their neighbors. If router C goes down and router B tries to send a packet to C at the same time the router went down before it receives an updated table from router A, it will look into its routing table and it sees that router A can get to C, so it will update its route to C through A and will send the packet through router A. the same thing happens when router A receives the packet from router B, since it received no update on a change from B, it also checks its table and sees that B can get to C, so it updates its route to C through B and sends the packet to B and the packet keeps getting sent this way until the maximum hop count is reached…
