Herbert, SJ;
Murdoch, SJ;
Punskaya, E;
(2014)
Optimising node selection probabilities in multi-hop M/D/1 queuing networks to reduce latency of Tor.
Electronics Letters
, 50
(17)
pp. 1205-1206.
10.1049/el.2014.2136.
Preview |
Text
Murdoch_Optimising node selection probabilities in multi-hop M D 1 queuing networks to reduce latency of Tor_AAM.pdf - Accepted Version Download (118kB) | Preview |
Abstract
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.
| Type: | Article |
|---|---|
| Title: | Optimising node selection probabilities in multi-hop M/D/1 queuing networks to reduce latency of Tor |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1049/el.2014.2136 |
| Publisher version: | https://doi.org/10.1049/el.2014.2136 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| Keywords: | gradient methods, probability, queueing theory |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10074687 |
Archive Staff Only
 |
View Item |
