Roger Dingledine commited on 2010-10-27 12:19:37
Zeige 1 geänderte Dateien mit 0 Einfügungen und 13 Löschungen.
... | ... |
@@ -1033,19 +1033,6 @@ |
1033 | 1033 |
by their rotating UserAgents; malicious websites who only attack certain |
1034 | 1034 |
browsers; and whether the answers to question one impact this answer. |
1035 | 1035 |
</li> |
1036 |
- <li>Right now Tor clients are willing to reuse a given circuit for ten |
|
1037 |
- minutes after it's first used. The goal is to avoid loading down the |
|
1038 |
- network with too many circuit extend operations, yet to also avoid having |
|
1039 |
- clients use the same circuit for so long that the exit node can build a |
|
1040 |
- useful pseudonymous profile of them. Alas, ten minutes is probably way |
|
1041 |
- too long, especially if connections from multiple protocols (e.g. IM and |
|
1042 |
- web browsing) are put on the same circuit. If we keep fixed the overall |
|
1043 |
- number of circuit extends that the network needs to do, are there more |
|
1044 |
- efficient and/or safer ways for clients to allocate streams to circuits, |
|
1045 |
- or for clients to build preemptive circuits? Perhaps this research item |
|
1046 |
- needs to start with gathering some traces of what connections typical |
|
1047 |
- clients try to launch, so you have something realistic to try to optimize. |
|
1048 |
- </li> |
|
1049 | 1036 |
<li>How many bridge relays do you need to know to maintain |
1050 | 1037 |
reachability? We should measure the churn in our bridges. If there is |
1051 | 1038 |
lots of churn, are there ways to keep bridge users more likely to stay |
1052 | 1039 |