(Accenture)1. Write a distance vector algoritam
2. TCP/IP 3 way hand shake
Answer Posted / dev kumar
Distance vector-based routing algorithms (also known as
Bellman-Ford algorithms) pass periodic copies of a routing
table from router to router.
When the topology in a distance vector protocol
internetwork changes, routing table updates must occur. As
with the network discovery process, topology change updates
proceed step-by-step from router to router.
When maintaining the routing information, inconsistencies
can occur if the internetwork’s slow convergence on a new
configuration causes incorrect routing entries.
| Is This Answer Correct ? | 9 Yes | 3 No |
Post New Answer View All Answers
What will happen if we send untagged packet to a tagged port
Give the importance of the osi physical layer?
Whether the default hello timer value is same across STP,RSTP and MSTP
Explain sneakernet?
What is tunnel mode?
Give the importance of implementing a fault tolerance system? Are there limitations?
How to delete software errors? What is that?
What is the difference between linux server and solaris server?
Explain netstat?
How many types of booting process in Solaris
one server is down it doen't display anything what you do?
Explain subnet mask?
in vcs, which network[private or public] channel bandwidth is high?
Difference b/w SCSI AND IDE
Can you please explain the difference between straight-through and crossover cable?