Reducing Latency in Tor
- đ¤ Speaker: Steven Herbert (University of Cambridge)
- đ Date & Time: Monday 19 November 2012, 14:00 - 15:00
- đ Venue: FW11, William Gates Building
Abstract
Since the original implementation of the Tor anonymity network, a number of possible improvements have been identified. Of particular interest to us was the insight that weighting node selection probabilities as proportional to the node bandwidth may not be optimal. Building a purely mathematical queuing model, which we justify as being a good representation of the Tor network, we demonstrate that this is indeed the case, and we derive an optimal solution. Finally we investigate some of the possible problems with deploying the solution to Tor directly.
Series This talk is part of the Computer Laboratory Digital Technology Group (DTG) Meetings series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computer Laboratory Digital Technology Group (DTG) Meetings
- Department of Computer Science and Technology talks and seminars
- FW11, William Gates Building
- Interested Talks
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)


Monday 19 November 2012, 14:00-15:00