[115987] in North American Network Operators' Group
Shortest path to the world
daemon@ATHENA.MIT.EDU (Sean Donelan)
Wed Jul 15 08:07:27 2009
Date: Wed, 15 Jul 2009 08:07:08 -0400 (EDT)
From: Sean Donelan <sean@donelan.com>
To: nanog@nanog.org
Errors-To: nanog-bounces+nanog.discuss=bloom-picayune.mit.edu@nanog.org
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?
