Tor is unfair - And what to do about it

Proceedings - Conference on Local Computer Networks, LCN

Volumn , Issue , 2011, Pages 432-440

  Tschorsch, Florian ^a   Scheuermann, Björn ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANONYMIZATION; CONGESTION FEEDBACK; END-USERS; FAIR RESOURCE ALLOCATION; FAIRNESS MODEL; MAX-MIN FAIRNESS; NEW DESIGN; SCHEDULING MECHANISM; SUB-OPTIMAL PERFORMANCE; UNFAIRNESS PROBLEM; USER PRIVACY;

DESIGN; RESOURCE ALLOCATION; SCHEDULING; TELECOMMUNICATION NETWORKS;

COMPUTER RESOURCE MANAGEMENT;

EID: 84856133258     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LCN.2011.6115503     Document Type: Conference Paper

References (29)

1. R. Dingledine, N. Mathewson, and P. Syverson, "Tor: The secondgeneration onion router," in USENIX Security '04: Proceedings of the 13th USENIX Security Symposium, Aug. 2004.
2. D. L. Chaum, "Untraceable electronic mail, return addresses, and digital pseudonyms," Communications of the ACM, vol. 24, no. 2, Feb. 1981.
3. "Tor metrics portal." [Online]. Available: http://metrics. torproject.org/
4. R. Dingledine and S. J. Murdoch, "Performance improvements on Tor or, why Tor is slow and what we're going to do about it," Mar. 2009. [Online]. Available: https://www.torproject.org/press/presskit/2009-03-11- performance.pdf
5. M. AlSabah, K. Bauer, I. Goldberg, D. Grunwald, D. McCoy, S. Savage, and G. Voelker, "DefenestraTor: Throwing out windows in Tor," Univ. of Waterloo, Tech. Rep. CACR 2011-06, Mar. 2011. [Online]. Available: http://www.cacr.math.uwaterloo.ca/techreports/2011/cacr2011-06.pdf
6. H. T. Kung, T. Blackwell, and A. Chapman, "Credit-based flow control for atm networks: credit update protocol, adaptive credit allocation and statistical multiplexing," in SIGCOMM '94: Proceedings of the 1994 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Aug. 1994.
7. C. Kiraly, G. Bianchi, and R. Lo Cigno, "Solving performance issues in anonymization overlays with a L3 approach," Univ. degli Studi di Trento, Tech. Rep. DISI-08-041, Ver. 1.1, Sept. 2008.
8. R. Snader and N. Borisov, "A tune-up for tor: Improving security and performance in the tor network," in NDSS '08: Proceedings of the Network and Distributed System Security Symposium, Feb. 2008.
9. P. Dhungel, M. Steiner, I. Rimac, V. Hilt, and K. Ross, "Waiting for anonymity: Understanding delays in the Tor overlay," in P2P '10: Proceedings of the 10th IEEE International Conference on Peer-to-Peer Computing, Aug. 2010.
10. J. Reardon and I. Goldberg, "Improving tor using a TCP-over-DTLS tunnel," 18th annual USENIX Security Symposium, 2009.
11. K. Loesing, "Analysis of circuit queues in tor," pp. 1-5, Aug 2009.
12. C. Viecco, "UDP-OR: A fair onion transport design," in PETS '08: Proceedings of the 8th Privacy Enhancing Technologies Symposium, July 2008.
13. C. Tang and I. Goldberg, "An improved algorithm for Tor circuit scheduling," in CCS '10: Proceedings of the 17th ACM Conference on Computer and Communications Security, Oct. 2010.
14. M. Alsabah and I. Goldberg, "Stream starvation in Tor," or-dev mailing list, Nov. 2010. [Online]. Available: http://archives.seul.org/or/dev/ Nov- 2010/msg00039.html
15. S. Mauw, J. Verschuren, and E. D. Vink, "A formalization of anonymity and onion routing," in ESORICS '04: Proceedings of the 9th European Symposium on Research in Computer Security, Sept. 2004, pp. 109-124.
16. J. Camenisch and A. Lysyanskaya, "A formal treatment of onion routing," in CRYPTO '05: Proceedings of the 25th Annual International Cryptology Conference, Aug. 2005, pp. 169-187.
17. J. Feigenbaum, A. Johnson, and P. Syverson, "A model of onion routing with provable anonymity," in FC '07: Proceedings of the 11th International Conference on Financial Cryptography and Data Security, Feb. 2007, pp. 57-71.
18. L. Kalampoukas, A. Varma, and K. K. Ramakrishnan, "An efficient rate allocation algorithm for atm networks providing max-min fairness," in HPN '95: Proceedings of the Sixth International Conference on High Performance Networking, Sept. 1995, pp. 143-154.
19. S. Muddu, C. Tryfonas, F. M. Chiussi, and V. P. Kumar, "Max-min rate control algorithm for available bit rate service in ATM networks,"in ICC '96: Proceedings of the IEEE International Conference on Communications, June 1996, pp. 412-418.
20. Z. Cao and E. W. Zegura, "Utility max-min: An application-oriented bandwidth allocation scheme," in INFOCOM '99: Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies, Mar. 1999.
21. X. Wu and A. A. Chien, "A distributed algorithm for max-min fair bandwidth sharing," University of California, San Diego, Tech. Rep., 2005.
22. D. D. Nguyen, J. Wang, L. Andrew, and S. Chan, "Maxnet: An efficient max-min fair allocation scheme," in ITC '05: Proceedings of the 19th International Teletraffic Congress, Aug. 2005.
23. J. Nagle, "On packet switches with infinite storage," RFC 970, Dec. 1985. [Online]. Available: http://www.ietf.org/rfc/rfc970.txt
24. E. L. Hahne, "Round-robin scheduling for max-min fairness in data networks," IEEE JSAC, vol. 9, pp. 1024-1039, 1991.
25. "Libevent." [Online]. Available: http://monkey.org/ provos/libevent/
26. "ns-3 network simulator." [Online]. Available: http://www.nsnam.org/
27. D. Bertsekas and R. Gallager, Data Networks, 2nd ed. Prentice Hall, 1992.
28. D. Marks, F. Tschorsch, and B. Scheuermann, "Unleashing Tor, BitTorrent & co.: How to relieve TCP deficiencies in overlays," in LCN '10: Proceedings of the 35th Annual IEEE International Conference on Local Computer Networks, Oct. 2010.
29. R. Jain, D. Chiu, and W. Hawe, "A quantitative measure of fairness and discrimination for resource allocation in shared computer systems,"Digital Equipment Corporation, Maynard, MA, USA, DEC Research Report TR-301, Sept. 1984.