Interested to Buy Any Domain ? << Click Here >> for more details...
(Accenture)1. Write a distance vector algoritam
2. TCP/IP 3 way hand shake
- 3 Answers
- 8006 Views
- Accenture, I also Faced
- E-Mail Answers
Answer Posted / ba
Distance vector protocol uses the bellman-fort algorithm.
it has 6 steps
1.increments the materic of the incoming route in the
advertisement.(counts the hops values)
2.Compare the n/w address in routing updaate from the
neighbor to wt the router has in the routing table.
3.if the neighbor information is better. it places the new
update in routing table, and delete the old entry.
4.if neighbor's information is worse, it ignors that.
5.if the neighbor update same as in routing table it resets
the timer for entry in the routing table.
6. if the neighbor's information is different path to same
destination, it stores the route in the routing table.
in the distance RIP doesnt support the un-equal paths.
| Is This Answer Correct ? | 6 Yes | 3 No |
Post New Answer View All Answers
Tell me when troubleshooting computer network problems, what common hardware-related problems can occur?
Explain the importance of encryption on a network?
What is star topology?
What is the behavior of the L2 Switch in case of receiving a multicast packet.
Explain netstat?
What is looping and how switching loops are avoided at L2 level?
Can we run STP and RSTP in a same box?
Define ipconfig?
Define peer to peer?
Define wan?
What is the last major networking problem you troubleshot and solved on your own in the last year?
Define tunnel mode?
if one server is down, whenever restart the machine we get ok prompt what is the problem?
What is osi and it's role in computer networking?
Define proxy servers?
