They may can use caching technology. They may store more than say 2000 frequent route requests in the server and in case of same source and destination they will not calculate again for that part of data. If they want to store all pair shortest path they may need huge memory and dynamic upgrade is not possible. This is a guess from my point of view.
Roni On Sat, May 23, 2009 at 3:12 PM, Nic Roets <[email protected]> wrote: > Another possibility would be to have a database of traffic jams and then to > generate alternative routes so that they avoid those. > > > _______________________________________________ > Routing mailing list > [email protected] > http://lists.openstreetmap.org/listinfo/routing > > _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/listinfo/routing
