Which two statements are characteristics of a distance vector routing protocol?(choose two)
A.
RIP is an example of distance vector routing protocols.
B.
Updates are periodic and include the entire routing table.
C.
Routing updates are sent only after topology changes
D.
The protocol can be useful in hub-and-spoke and hierarchical networks.
E.
Convergence is usually faster than with link state protocols
F.
Each router has its own view of the topology
A B are right
the rest are false.
when they say the whole routing table is sent in updates …they mean everything but the split horizon stuff..
but i can see why you put false.
D the protocol can be useful in a hub and spoke …..yes.
but it all depends on how you build the hub and spoke….if you use frame relay then yes.
other than that i would say no.
and hierarchical networks…..i wouldnt say hierarchical…so answer false to this.
And each router doesnt have a clue about topology….it just has a set of routes and that is it.
topology means it knows about all routers and subnets etc.
distace vector doesnt know this info
and yes your right it is a complete waste of resources.
eigrp is really distance vector too…but doesnt work like a standard distance vector …so im not taking it into consideration for this question
0
0
RIP is not really a “characteristic” of distance vector protocols, however, it is an example of that kind. Odd the way some questions are phrased!
0
0