IT THEORY FUNDAMENTAL

Think first of a network of roads for GPS mapping. Every road whether in a neighborhood or spanning states is included in possible paths. A dirt road is included in the overall network just like a major highway. Clearly, it is impossible to consider every possible path in every GPS mapping decision. If traveling from your house to the nearest grocery store, it is absurd to consider paths that go through another city 800 miles away. If driving from the Empire State building in New York City to the Golden Gate Bridge in San Francisco, a dirt road in Iowa might be close to on the way but doesn’t need to be considered as a path.

The Internet is similar to that mesh of roads with connections ranging from local cable lines to submarine optical cables traversing thousands of kilometers. Just like with the roads, not all possible paths in the network need to be considered for every packet route.

Consider methods to narrow down these paths for GPS mapping or mesh network routing. What strategies and processes might be applied to have a computer algorithmically do what a person glancing at a map does naturally?

For this Discussion:

Choose either the GPS map routing or the Internet routing. Describe an algorithm for quickly determining the best path to take within such a broad mesh. Provide an example to show how the algorithmic process would determine a specific route for an automobile or data packet.