greater percentage of bandwidth is needed for routing updates.
and then converge using the new information. Also, as more routes populate
a routing table, it becomes increasingly complex to determine the best path
and next hop for a given destination. The following list summarizes the scal-
ability limitations inherent in distance-vector algorithms:
vector protocols because the algorithm uses a different procedure for route
calculation and advertisement. This enables them to scale along with the
growth of the network.
with directly connected routers that allows for faster route convergence.
They establish peering by exchanging Hello packets during a session, which
cements the neighbor relationship between two directly connected routers.
This relationship expedites network convergence because neighbors are
immediately notified of topology changes. Hello packets are sent at short
intervals (typically every 10 seconds), and if an interface fails to receive Hello
packets from a neighbor within a predetermined hold time, the neighbor is
considered down, and the router will then flood the update out all physical
interfaces. This occurs before the new routing table is calculated, so it saves
time. Neighbors receive the update, copy it, flood it out their interfaces, and
which saves both bandwidth and CPU utilization. Plus, if there aren't any
network changes, updates are sent out only at specified, or default, intervals,