nanog mailing list archives
Re: Shortest path to the world
From: Jeroen Massar <jeroen () unfix org>
Date: Wed, 15 Jul 2009 14:18:46 +0200
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?
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. aka ETOOMANYVARIABLES.
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 ;) Greets, Jeroen
Attachment:
signature.asc
Description: OpenPGP digital signature
Current thread:
- Shortest path to the world Sean Donelan (Jul 15)
- Re: Shortest path to the world Jeroen Massar (Jul 15)
- Re: Shortest path to the world Randy Bush (Jul 15)
- Re: Shortest path to the world Sean Donelan (Jul 15)
- Re: Shortest path to the world Leo Bicknell (Jul 15)
- Re: Shortest path to the world Sean Donelan (Jul 15)
- Re: Shortest path to the world Leo Bicknell (Jul 16)
- Re: Shortest path to the world Sean Donelan (Jul 15)
- Re: Shortest path to the world Valdis . Kletnieks (Jul 16)
- Re: Shortest path to the world Martin Hannigan (Jul 16)