> On 22 Nov 2015, at 02:55, David Goulet wrote:
>
> On 21 Nov (16:26:31), Tim Wilson-Brown - teor wrote:
> ...
>> It would be great to have some stats for typical path lengths, is there an
>> open ticket for this, or should I create one?
>
> That would help us have a better estimate of network
On Fri, Nov 20, 2015 at 01:38:56PM -0500, David Goulet wrote:
> Anyway, if you think this algorithm could be improved, please respond. If you
> think this algorithm is wrong, please respond. If you can reproduce the result
> on your own with this algo, omg please respond! :) The above could be tota
On 24 Nov (10:10:44), Moritz Wedel wrote:
> Hi David,
>
> this sound really interesting!
> Im working on an evaluation of hidden service performance, trying to
> find some improvements. An algorithm to estimate the network capacities
> is a great tool, to evaluate what will happen if we would chan
Hi David,
this sound really interesting!
Im working on an evaluation of hidden service performance, trying to
find some improvements. An algorithm to estimate the network capacities
is a great tool, to evaluate what will happen if we would change some
circuit parameters. This is why I would like t
I'd mentioned before idea of posing question how much HS-to-HS
bandwidth (unused relay mod hopcount) is freely available within tor.
For what this work goes to ansering that, thanks.
___
tor-dev mailing list
tor-dev@lists.torproject.org
https://lists.torp
On 21 Nov (16:26:31), Tim Wilson-Brown - teor wrote:
>
> > On 21 Nov 2015, at 05:38, David Goulet wrote:
> >
> >
> > I know that we have sometimes 1, 4, 5, 6 or 7 hops circuit but the general
> > case
> > is considered here and we have no stats on how frequent those unusual
> > circuits
> > a
> On 21 Nov 2015, at 05:38, David Goulet wrote:
>
>
> I know that we have sometimes 1, 4, 5, 6 or 7 hops circuit but the general
> case
> is considered here and we have no stats on how frequent those unusual circuits
> are.
When I tested hidden service path lengths:
Most clients cannibalize
Hello everyone!
I would like to share this graph I've been working on along side with Aaron
Johnson (thanks to him for the algorithm I'll be describing).
This shows both the maximum additional and total traffic the network can
sustain for both HS and Exit. The "additional" traffic here means that
