18.13 Shortest Path Computation In A Graph
{"Image DocumentName": "18.13 Shortest Path Computation In A Graph", "Image ImageDescription": "To use the algorithm for such technologies. each edge in the graph is assigned a weight of 1. In other WAN technologies, weights are assigned to reflect the capacity of the underlying connections. A network manager can assign weights to links to control routing. For example, consider a case where two separate paths exist between a pair of packet switches with. one path designated to be the primary path. and the other designated to be a backup path. To enforce such a policy. a network manager can assign the primary link a low weight and the other link a high weight. Routing software will configure forwarding tables to use the path with low weight. unless the path is not available. in which case routing software will select the alternative path. \u00a9 2009 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}