Running the dynamic programming algorithm discovered ways to cut the total traffic gigabyte hops by half using 42 caches. This is 10 fewer caches than a greedy placement and it is also a point at which extra caches give little benefit. With 200 caches, the simultaneous placement algorithm was able to reduce the traffic to 4 Gigabyte-ASHops.
Perhaps the most useful value to the simultaneous placement algorithm
is the shape of the graph of diminishing returns. By running the algorithm once, the analyst can see
what the optimal result is for the entire range of 
to 
caches and compare the benefits to the cost
per cache.