What are the main differences between a distance vector routing protocol and a link state routing protocol? Give examples for each type of protocol.
What will be an ideal response?
In a distance vector routing protocol, each node knows the distance to its directly connected neighbors and sends routing updates to its neighbors. Each node depends on its neighbors to update their distances and the routing tables eventually converge. The cost is the number of hops from one node to another and uses the Bellman-Ford algorithm. RIP is this type of protocol. In a link state protocol, each node knows the distance to its neighbors and sends routing updates to all nodes in the network. Each node calculates its routing table independently. The cost is inversely proportional to the bandwidth of the interface and uses Dijkstra’s algorithm. OSPF belongs to this category..
You might also like to view...
Take a picture of something in the physical world that provides a helpful cue to help people make a choice, and be prepared to present it to the class.
What will be an ideal response?
The Show Markup button displays comments and other annotations
Indicate whether the statement is true or false
Explain how design is a plan?
What will be an ideal response?
COGNITIVE ASSESSMENT You recently lost some files that were important to you so you have resolved to back up the contents of your hard disk on a series of rewritable DVDs. What kind of software will you use to do this?
A. media player B. safekeeping C. disc burning D. CBT