1. [ Intra-Domain Routing ] a) So far in this lecture series, for intra domain r
ID: 3866173 • Letter: 1
Question
1. [Intra-Domain Routing]
a) So far in this lecture series, for intra domain routing scenarios, we have assumed that the shortest path is the least cost path where cost may be defined in terms of number of hops, delay etc. This scheme simply builds the overall cost of a path by adding individual link costs along the path until all links for the path are considered. There are many networking environments in which this strategy of selecting the best path using least cost is not applicable. Identify and explain one scenario where this routing strategy may not work.
b) In the case of inter-area routing, OSPF behaves like a distance vector routing protocol. Explain why.
Explanation / Answer
a)
Consider a scenario where we have same number of hops and the same link bandwidth. In this scenario, the number of hops to reach the destination are same and the link bandwidth is same thus, there would be same delay and same number of intermediate nodes for every path from the source to destination. Thus, the cost will be same and other factors are taken in consideration of a routing protocol such as OSPF, EIGRP for the route selection.
b)
In case of inter routing in OSPF two different network of different owners are exposed to each other. To preserve the crucial information of the organization the organization uses various network security policies due to which the triggered update in OSPF fails, and the update are delayed and some functionality of link state routing is disturbed and thus OSPF behaves as the distance vector routing protocol.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.