(Accenture)1. Write a distance vector algoritam
2. TCP/IP 3 way hand shake
- 3 Answers
- 6654 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
What is star topology?
Explain the maximum length allowed for a utp cable?
Describe point to point link?
Define mac addresses?
Tell me what advantages does fiber optics have over other media?
Define dhcp?
Explain routers?
Is it possible to connect two computers for file sharing without using a hub or router?
Define the role of ieee in computer networking?
Explain the role of ieee in computer networking?
Explain the importance of implementing a fault tolerance system? Are there limitations?
Explain sneakernet?
How to perform system maintenance?
List the advantage of address sharing?
I am using solaris box, I need to delete a file from path /usr/tmp/ which r older than 24 hours?
