nanog mailing list archives
Re: Shortest path to the world
From: Randy Bush <randy () psg com>
Date: Wed, 15 Jul 2009 22:03:56 +0900
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
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)