Shortest path to the world
jeroen at unfix.org
Wed Jul 15 07:18:46 CDT 2009
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
Depends completely on what the data is and why you want to send them
from A to B and if A and B are inside your network or not etc etc etc etc.
> And what data do you have to prove the choices are best?
Depends of course on what you want to 'prove'
But things that come into mind are possibly:
- Netflow/sFlow and other such data
- latency tests (simple pings from A to B to global services
that check latency, eg RIPE TTM boxes)
- Cost for circuits
- and lots lots more.
It all depends, thus also how you combine the above ;)
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 187 bytes
Desc: OpenPGP digital signature
More information about the NANOG