Interested to Buy Any Domain ? << Click Here >> for more details...
Which is not a common problem with Distance-Vector routing?
A.) Slow convergence.
B.) Complex configuration.
C.) Routing loops.
D.) Periodic updates can slow convergence.
E.) Counting to infinity.
- 1 Answers
- 5114 Views
- I also Faced
- E-Mail Answers
Answer Posted / guest
Answer: B
Easy Config:
Router(config)#router rip
Router(config-router)#network 10.0.0.0
Router(config-router)#
That?s it! (Remember that the network is followed by the
CLASSFUL address.)
| Is This Answer Correct ? | 3 Yes | 0 No |
Post New Answer View All Answers
Tell us the name of algorithm of eigrp protocol?
What is the subnet? Why is it used?
Explain on which interface we always apply access-list?
When we use router?
On which base distance vector choose best path?
Mention what does the clock rate do?
What does data packets consist of?
Which peer authentication method and which ipsec mode is used to connect to the branch locations? (Choose two)
What is the cladding?
What is the key advantage of using switches?
Mention what is dhcp?
what is prefix list
How many valid ip will b in /21 in route summarization?
Tell me which protocol comes under hybrid dynamic type?
What is the point-to-point protocol in ccna?
