Which dynamic routing protocol operates using 'routing by rumor'?

The dynamic routing protocol that operates using 'routing by rumor' is known as Distance Vector. This term refers to how the protocol updates its routing tables based on information shared by neighboring routers, rather than having a full view of the network like Link State protocols. Each router in a Distance Vector network sends its entire routing table to its immediate neighbors at regular intervals.

The term 'routing by rumor' emphasizes that a router learns about network paths from what other routers tell it, sometimes leading to outdated or incorrect routing information until updates are received. This method is less efficient and can result in slower convergence compared to other protocols.

Distance Vector protocols make use of metrics such as hop count and can be affected by routing loops and the count-to-infinity problem, which reinforces the idea of 'rumors.' These protocols, examples of which include RIP (Routing Information Protocol) and IGRP (Interior Gateway Routing Protocol), rely on periodic updates from neighbors, which can lead to inconsistent routing information until the entire network is synchronized.

In contrast, Link State protocols, such as OSPF (Open Shortest Path First), create a complete topology of the network and allow routers to independently calculate their routing tables based on the Dijkstra algorithm. Static routing involves manually configured routes