In the next set of simulations, we use a real dataset to construct the forwarding cost function \(g(\cdot )\)  for a shortest path query system. In particular, we use a GPS trajectory dataset [1]}[2]}[3]} collected as a part of the Geolife Project by Microsoft Research Asia. This dataset contains 17,621 cab trajectories from Beijing, China, compiled over five years from 2007-12. Using this data, we model a service which when queried with a source-destination pair, returns the shortest path corresponding to that input. As before the goal is to host this service in the most cost-efficient way. Next, we describe how the edge cache size is measured and our algorithm to decide what goes in the cache.
