(Accenture)1. Write a distance vector algoritam
2. TCP/IP 3 way hand shake
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
Can you please explain the difference between hub and a switch?
Explain backbone network?
What is the difference between linux server and solaris server?
Explain the role of ieee in computer networking?
Which protocol can be applied when you want to transfer files between different platforms, such between unix systems and windows servers?
when affected the system from virus , which paths will be it stored in system ?
Explain the main purpose of ospf?
Describe point to point link?
how to set kernal parameters in solaris 10&9?
Who is network administrator?
Define mac addresses?
Can you please explain the difference between straight-through and crossover cable?
Explain how are ip addresses arranged and displayed?
Define ipv6?
how to merge solaris partition?