Dynamic Routing I: Concepts and RIP

What is RIP's maximum valid hop count, and what does the next value mean?

Which RIP timer, at 240 seconds, removes an invalid route from the table?

Which loop-prevention rule says a route must not be advertised back to the neighbour it was learned from?

Which multicast address does RIPv2 use for its updates?

Why can a classful routing protocol not support VLSM?

Which algorithm does a distance vector protocol use?

In a link state protocol, what is the root of the SPF tree?

Which metric does OSPF use by default?

Which command is required, alongside `version 2`, for VLSM to work correctly in RIP?

Which range is reserved for private 16-bit Autonomous System Numbers?

Dynamic routing adapts to topology changes without manual administrator intervention.

An IGP routes between Autonomous Systems, while an EGP routes within one.

RIP sends its full routing table every 30 seconds even when the topology is stable.

All routers in the same link state area hold an identical, synchronized LSDB.

Transient routing loops or black holes may exist while a network is converging.

Distance vector routing is described as "routing by rumour" because a router trusts its neighbour's advertisements.

OSPF supports unequal-cost load balancing through the variance feature.

A passive interface stops routing updates from being sent out of that interface.

RIPv1 includes the subnet mask in its updates and supports VLSM.

For a multi-vendor network, OSPF is recommended because it is an open standard.

Match each RIP timer with its default value.

Match each loop-prevention mechanism with what it does.

Match each protocol with its metric.

Match each protocol with its update behaviour.

Match each protocol with its loop detection mechanism.