[116011] in North American Network Operators' Group

home help back first fref pref prev next nref lref last post

Re: Shortest path to the world

daemon@ATHENA.MIT.EDU (Michiel Klaver)
Thu Jul 16 04:15:13 2009

Date: Thu, 16 Jul 2009 10:14:20 +0200
From: Michiel Klaver <michiel@klaver.it>
To: Sean Donelan <sean@donelan.com>, NANOG <nanog@nanog.org>
In-Reply-To: <200907150743330.32BF5B92.21943@clifden.donelan.com>
Reply-To: michiel@klaver.it
Errors-To: nanog-bounces+nanog.discuss=bloom-picayune.mit.edu@nanog.org


Sean Donelan wrote:
> The typical network architecture problem, what are the best (shortest latency, greatest bandwidth, etc) locations to connect to the every nation in the world?  As you increase the number of locations, how do the choices change?
> 
> If you only had small (2 3 5 7 11) number of locations, where would they be?
> 
> And what data do you have to prove the choices are best? 


Just a quick wikipedia and google search would provide you the answers
to that:

http://en.wikipedia.org/wiki/List_of_countries_by_number_of_Internet_users

http://en.wikipedia.org/wiki/List_of_Internet_exchange_points_by_size

http://www.internetworldstats.com/stats.htm
http://www.internetworldstats.com/stats1.htm
http://www.internetworldstats.com/stats4.htm
etc...

have fun with all that data!

Kind regards,

Michiel Klaver
IT Professional


home help back first fref pref prev next nref lref last post