The price of anarchy in Tor latency reduction
Dieter Fiems · Electronics Letters · 2021
Abstract The expected cell latency for multi‐hop M/D/1 queueing networks in Wardrop equilibrium is calculated. The load is balanced such that no user can benefit from unilaterally changing its routes. The results are applied to a typical snapshot of the Tor anonymity network, for which an efficient approach is devised to calculate the equilibrium routing strategy. For this snapshot, latency in the Wardrop equilibrium is numerically compared with the globally optimal latency and the latency of the original routing method of Tor.