In what ways does static routing vary from that of dynamic routing? Which dynamic routing method is the most effective, and why

What are the key distinctions between distance vectors, link state vectors, and path vector routing?

Investigate the distinctions and parallels that exist between the three most common approaches of routing. (Distance-vector routing, link-state routing, and path-vector routing are a few examples of routing algorithms.)

Analyse the distinctions and commonalities among the three prevalent routing techniques. Various routing algorithms exist, such as distance-vector routing, link-state routing, and path-vector routing.

Give an example of how route vector routing differs from link state vector routing and distance vector routing.

What are some of the advantages of open shortest path first over other dynamic routing protocols? What are some of the disadvantages of open shortest path first over other dynamic routing protocols?

What are the three main problems that arise from distance vector routing?

Explain the difference between static routing and dynamic routing. When would you use one over the other?

For a rudimentary network, which type of routing path (static or dynamic) would you use? Why would you prefer one to the other?

Analyse the ways in which the three most common routing approaches vary from one another as well as the ways in which they are similar. (Some examples of routing algorithms include the distance-vector routing, the link-state routing, and the path-vector routing.)