© The Institution of Engineering and Technology
The expected cell latency for multi-hop M/D/1 queuing networks, where users choose nodes randomly according to some distribution, is derived. It is shown that the resulting optimisation surface is convex, and thus gradient-based methods can be used to find the optimal node assignment probabilities. This is applied to a typical snapshot of the Tor anonymity network at 50% usage, and leads to a reduction in expected cell latency from 11.7 ms using the original method of assigning node selection probabilities to 1.3 ms. It is also shown that even if the usage is not known exactly, the proposed method still leads to an improvement.
References
-
-
1)
-
3. Dingledine, R., Murdoch, S.: ‘Performance improvements on Tor, or why Tor is slow and what we're going to do about it’. , 2009.
-
2)
-
2. Murdoch, S., Watson, R.: ‘Metrics for security and performance in low-latency anonymity systems’. Int. Symp. on Privacy Enhancing Technologies, 2008, pp. 115–132.
-
3)
-
4)
-
1. Dingledine, R., Mathewson, N., Syverson, P.: ‘Tor: the second-generation onion router’. USENIX Security Symp., 2004, p. 21.
-
5)
-
4. Kendall, D.: ‘Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain’, Ann. Math. Stat., 1953, pp. 338–354 (doi: 10.1214/aoms/1177728975).
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2014.2136
Related content
content/journals/10.1049/el.2014.2136
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Optimising node selection probabilities in multi-hop M/D/1 queuing networks to reduce latency of Tor