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...

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 the number of hops, delay etc. These routing techniques first identify all the candidate paths to a target destination. Next, the overall cost of a candidate path is determined by adding individual link costs along the path until all links for the path are considered. Finally the total cost of all candidate paths are compared and the path with the least total cost is selected as the best path. There are many networking environments in which this technique of computing and selecting the best path from a source to a target destination will not be applicable. Identify and explain one such scenario (200 words)