[115988] in North American Network Operators' Group
Re: Shortest path to the world
daemon@ATHENA.MIT.EDU (Jeroen Massar)
Wed Jul 15 08:24:44 2009
Date: Wed, 15 Jul 2009 14:18:46 +0200
From: Jeroen Massar <jeroen@unfix.org>
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
This is an OpenPGP/MIME signed message (RFC 2440 and 3156)
--------------enigF75808AE08C713CA41B4C393
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
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 the=
y
> 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=
=2E
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
--------------enigF75808AE08C713CA41B4C393
Content-Type: application/pgp-signature; name="signature.asc"
Content-Description: OpenPGP digital signature
Content-Disposition: attachment; filename="signature.asc"
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.7 (MingW32)
iD8DBQFKXckmKaooUjM+fCMRAixQAJ9PTeql6FcUwbQhZhByz5U1OaukIgCgrfGy
ArPywH/2OATJenQ99Dva68U=
=AIBv
-----END PGP SIGNATURE-----
--------------enigF75808AE08C713CA41B4C393--
