Paper Info
Title
Scalable Link-Based Relay Selection for Anonymous Routing
Abstract
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 path techniques in which relay selection is biased by relays' node-characteristics (i.e., bandwidth), this paper presents the case for link-based path generation in which relay selection is weighted in favor of the highest performing links. Link-based relay selection supports more flexible routing, enabling anonymous paths with low latency, jitter, and loss, in addition to high bandwidth. Link-based approaches are also more secure than node-based techniques, eliminating "hotspots" in the network that attract a disproportionate amount of traffic. For example, misbehaving relays cannot advertise themselves as "low-latency" nodes to attract traffic, since latency has meaning only when measured between two endpoints. We argue that link-based path selection is practical for certain anonymity networks, and describe mechanisms for efficiently storing and disseminating link information.
Year
DOI
Venue
2009
10.1007/978-3-642-03168-7_5
Privacy Enhancing Technologies
Keywords
Field
DocType
misbehaving relay,low latency,anonymous path,link-based path generation,scalable link-based relay selection,certain anonymity network,link-based path selection,link-based approach,anonymous routing,traditional node-based path technique,selection algorithm,high bandwidth
Computer science,Latency (engineering),Computer network,Bandwidth (signal processing),Anonymity,Jitter,Latency (engineering),Relay,Metrics,Distributed computing,Scalability
Conference
Volume
ISSN
Citations 
5672
0302-9743
25
PageRank 
References 
Authors
0.93
32
3
Name
Order
Citations
PageRank
Micah Sherr162544.49
matt blaze23189381.70
Boon Thau Loo32118131.09