[115989] in North American Network Operators' Group
Re: Shortest path to the world
daemon@ATHENA.MIT.EDU (Randy Bush)
Wed Jul 15 09:04:43 2009
Date: Wed, 15 Jul 2009 22:03:56 +0900
From: Randy Bush <randy@psg.com>
To: Sean Donelan <sean@donelan.com>
In-Reply-To: <200907150743330.32BF5B92.21943@clifden.donelan.com>
Cc: 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?
it would help if you said how you measure 'best' or 'better'.
if you had a completely free hand, what experiment would you set up to
measure this space?
randy
