Shortest path to the world

Randy Bush randy at
Wed Jul 15 13:03:56 UTC 2009

> 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?


More information about the NANOG mailing list