On 4/18/06, Anthony DeRobertis <[EMAIL PROTECTED]> wrote: > > Divide the world into areas (e.g., every 2 deg. lat/long). Pre-compute the > closest servers for each of those areas. Now the math is just a few > compares and a hash table lookup. > > [Honestly, I suspect this problem is not CPU-constrained]
Good point. Two degrees might be a little coarse (over 200 km), but pre-computation as a batch process would reduce the issue to a few database index operations per DNS query. I do wonder, though, how well geo-location will work for "island" areas of the wold (in terms of physical or network topology). For example, I would imagine the northern peninsula of Denmark has better network connectivity to Northern Germany than Southern Norway, even though Norway is geographically much closer. Regards, -- RPM _______________________________________________ timekeepers mailing list [email protected] https://fortytwo.ch/mailman/cgi-bin/listinfo/timekeepers
