Scalable Link-Based Relay Selection for Anonymous Routing

摘要: The performance of an anonymous path can be described using many network metrics --- e.g., bandwidth, latency, jitter, loss, etc. However, existing relay selection algorithms have focused exclusively on producing paths with high bandwidth. In contrast to traditional node-based techniques in which is biased by relays' node-characteristics (i.e., bandwidth), this paper presents the case for link-based generation weighted favor highest performing links. Link-based supports more flexible routing, enabling low and addition approaches are also secure than techniques, eliminating "hotspots" that attract a disproportionate amount traffic. For example, misbehaving relays cannot advertise themselves as "low-latency" nodes traffic, since latency has meaning only when measured between two endpoints. We argue practical certain anonymity networks, describe mechanisms efficiently storing disseminating link information.