preview

Nt1310 Unit 3 Network Analysis Paper

Satisfactory Essays

This protocol use Dijkstra algorithm. It maintains a complex data base, also called as link state database, which contains full information about the remote routers and the exact network topology. The goal from this protocol is to provide similar information about network connection to each router, so each router can calculate the best route to each network this is happen when each router generates information about itself and pass these information to other routers in the network so each router make a copy of this information without changing it.
 Builds topologies map (Every node knows how to reach to its directly connected neighbors and by making sure that the total of this acknowledge is distributed to every node then every node will have enough information to build a complete map of the network).
…show more content…

 Small routing table.
 Uses metrics (costs) to calculate path.
 Difficult to configure and increased complexity in designing the network.
 Fast loop free convergence protocol.
 Only changes or updates are sent across the network.

What are the differences between link state and distance vector protocol?
Link state Distance vector
Sends only link state information Sends the entire routing table
Knows the entire network topology Doesn’t know it
Fast convergence Slow convergence
Difficult configuration Simple configuration
Multicast routing updates Broadcast routing updates
Less Susceptible to routing

Get Access