2. [Intra-Domain Routing] In the inter domain routing scenarios, we have assumed

Question

2. [Intra-Domain Routing]

In the inter 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. (200 words) b) (6 marks) In the case of inter-area routing, OSPF behaves like a distance vector routing protocol. Explain why. (100 words)

Explanation / Answer

Routing is a techinique to give the route to the router of any location which is unknown for that router. The shortest path is define by the least cost between one host to another host and these cost can be calculate by the Hops count , delay in network ,bandwidth of the network. The Routing Strategy may not work when two different LAN of same company connected to an ISP where the Routing strategy does not work because the ISP does not have route of both the network. So we use the GRE tunnel here to communicate with two different LAN.

The open Shortest PAth First is an open standard routing protocol. The OSPF work on Dijkstra Algorithm to find the Shortest path the follow that path. OSPF detect changes into the topology like link failure etc then it send a trigger update instantly to tell all host that there is a link down.The OSPF consist of different typeof states like:-

Related Questions

Navigate

• Browse (All)
• Browse 2
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.