Optimising node selection probabilities in multi-hop M/D/1 queuing networks to reduce latency of Tor
Optimising node selection probabilities in multi-hop M/D/1 queuing networks to reduce latency of Tor
复制标题
优化多跳 M/D/1 排队网络中的节点选择概率以减少 Tor 延迟
DOI：
--
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
E. Punskaya
中科院分区：
文献类型：
--
作者：
Steven Herbert;S. Murdoch;E. Punskaya
推导了多跳M/D/1排队网络中用户按某种分布随机选择节点时的信元期望时延。结果表明，所得到的优化表面是凸的，因此基于梯度的方法可以用来找到最佳的节点分配概率。这是适用于一个典型的快照的Tor匿名网络在50%的使用率，并导致预期的细胞延迟从11.7毫秒减少使用原来的方法分配节点选择概率为1.3毫秒。它还表明，即使使用不完全知道，所提出的方法仍然导致改进。
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.