141-jit-sd-downloads.txt 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325
  1. Filename: 141-jit-sd-downloads.txt
  2. Title: Download server descriptors on demand
  3. Version: $Revision$
  4. Last-Modified: $Date$
  5. Author: Peter Palfrader
  6. Created: 15-Jun-2008
  7. Status: Draft
  8. 1. Overview
  9. Downloading all server descriptors is the most expensive part
  10. of bootstrapping a Tor client. These server descriptors currently
  11. amount to about 1.5 Megabytes of data, and this size will grow
  12. linearly with network size.
  13. Fetching all these server descriptors takes a long while for people
  14. behind slow network connections. It is also a considerable load on
  15. our network of directory mirrors.
  16. This document describes proposed changes to the Tor network and
  17. directory protocol so that clients will no longer need to download
  18. all server descriptors.
  19. These changes consist of moving load balancing information into
  20. network status documents, implementing a means to download server
  21. descriptors on demand in an anonymity-preserving way, and dealing
  22. with exit node selection.
  23. 2. What is in a server descriptor
  24. When a Tor client starts the first thing it will try to get is a
  25. current network status document: a consensus signed by a majority
  26. of directory authorities. This document is currently about 100
  27. Kilobytes in size, tho it will grow linearly with network size.
  28. This document lists all servers currently running on the network.
  29. The Tor client will then try to get a server descriptor for each
  30. of the running servers. All server descriptors currently amount
  31. to about 1.5 Megabytes of downloads.
  32. A Tor client learns several things about a server from its descriptor.
  33. Some of these it already learned from the network status document
  34. published by the authorities, but the server descriptor contains it
  35. again in a single statement signed by the server itself, not just by
  36. the directory authorities.
  37. Tor clients use the information from server descriptors for
  38. different purposes, which are considered in the following sections.
  39. #three ways: One, to determine if a server will be able to handle
  40. #this client's request; two, to actually communicate or use the server;
  41. #three, for load balancing decisions.
  42. #
  43. #These three points are considered in the following subsections.
  44. 2.1 Load balancing
  45. The Tor load balancing mechanism is quite complex in its details, but
  46. it has a simple goal: The more traffic a server can handle the more
  47. traffic it should get. That means the more traffic a server can
  48. handle the more likely a client will use it.
  49. For this purpose each server descriptor has bandwidth information
  50. which tries to convey a server's capacity to clients.
  51. Currently we weigh servers differently for different purposes. There
  52. is a weigh for when we use a server as a guard node (our entry to the
  53. Tor network), there is one weigh we assign servers for exit duties,
  54. and a third for when we need intermediate (middle) nodes.
  55. 2.2 Exit information
  56. When a Tor wants to exit to some resource on the internet it will
  57. build a circuit to an exit node that allows access to that resource's
  58. IP address and TCP Port.
  59. When building that circuit the client can make sure that the circuit
  60. ends at a server that will be able to fulfill the request because the
  61. client already learned of all the servers' exit policies from their
  62. descriptors.
  63. 2.3 Capability information
  64. Server descriptors contain information about the specific version or
  65. the Tor protocol they understand [proposal 105].
  66. Furthermore the server descriptor also contains the exact version of
  67. the Tor software that the server is running and some decisions are
  68. made based on the server version number (for instance a Tor client
  69. will only make conditional consensus requests [proposal 139] when
  70. talking to Tor servers version 0.2.1.1-alpha or later).
  71. 2.4 Contact/key information
  72. A server descriptor lists a server's IP address and TCP ports on which
  73. it accepts onion and directory connections. Furthermore it contains
  74. the onion key (a short lived RSA key to which clients encrypt CREATE
  75. cells).
  76. 2.5 Identity information
  77. A Tor client learns the digest of a server's key from the network
  78. status document. Once it has a server descriptor this descriptor
  79. contains the full RSA identity key of the server. Clients verify
  80. that 1) the digest of the identity key matches the expected digest
  81. it got from the consensus, and 2) that the signature on the descriptor
  82. from that key is valid.
  83. 3. No longer require clients to have copies of all SDs
  84. 3.1 Load balancing info in consensus documents
  85. One of the reasons why clients download all server descriptors is for
  86. doing load proper load balancing as described in 2.1. In order for
  87. clients to not require all server descriptors this information will
  88. have to move into the network status document.
  89. Consensus documents will have a new line per router similar
  90. to the "r", "s", and "v" lines that already exist. This line
  91. will convey weight information to clients.
  92. "w Bandwidth=193"
  93. The bandwidth number is the lesser of observed bandwidth and bandwidth
  94. rate limit from the server descriptor that the "r" line referenced by
  95. digest (1st and 3rd field of the bandwidth line in the descriptor).
  96. It is given in kilobytes per second so the byte value in the
  97. descriptor has to be divided by 1024 (and is then truncated, i.e.
  98. rounded down).
  99. Authorities will cap the bandwidth number at some arbitrary value,
  100. currently 10MB/sec. If a router claims a larger bandwidth an
  101. authority's vote will still only show Bandwidth=10240.
  102. The consensus value for bandwidth is the median of all bandwidth
  103. numbers given in votes. In case of an even number of votes we use
  104. the lower median. (Using this procedure allows us to change the
  105. cap value more easily.)
  106. Clients should believe the bandwidth as presented in the consensus,
  107. not capping it again.
  108. 3.2 Fetching descriptors on demand
  109. As described in 2.4 a descriptor lists IP address, OR- and Dir-Port,
  110. and the onion key for a server.
  111. A client already knows the IP address and the ports from the consensus
  112. documents, but without the onion key it will not be able to send
  113. CREATE/EXTEND cells for that server. Since the client needs the onion
  114. key it needs the descriptor.
  115. If a client only downloaded a few descriptors in an observable manner
  116. then that would leak which nodes it was going to use.
  117. This proposal suggests the following:
  118. 1) when connecting to a guard node for which the client does not
  119. yet have a cached descriptor it requests the descriptor it
  120. expects by hash. (The consensus document that the client holds
  121. has a hash for the descriptor of this server. We want exactly
  122. that descriptor, not a different one.)
  123. It does that by sending a RELAY_REQUEST_SD cell.
  124. A client MAY cache the descriptor of the guard node so that it does
  125. not need to request it every single time it contacts the guard.
  126. 2) when a client wants to extend a circuit that currently ends in
  127. server B to a new next server C, the client will send a
  128. RELAY_REQUEST_SD cell to server B. This cell contains in its
  129. payload the hash of a server descriptor the client would like
  130. to obtain (C's server descriptor). The server sends back the
  131. descriptor and the client can now form a valid EXTEND/CREATE cell
  132. encrypted to C's onion key.
  133. Clients MUST NOT cache such descriptors. If they did they might
  134. leak that they already extended to that server at least once
  135. before.
  136. Replies to RELAY_REQUEST_SD requests need to be padded to some
  137. constant upper limit in order to conceal a client's destination
  138. from anybody who might be counting cells/bytes.
  139. RELAY_REQUEST_SD cells contain the following information:
  140. - hash of the server descriptor requested
  141. - hash of the identity digest of the server for which we want the SD
  142. - IP address and OR-port or the server for which we want the SD
  143. - padding factor - the number of cells we want the answer
  144. padded to.
  145. [XXX this just occured to me and it might be smart. or it might
  146. be stupid. clients would learn the padding factor they want
  147. to use from the consensus document. This allows us to grow
  148. the replies later on should SDs become larger.]
  149. [XXX: figure out a decent padding size]
  150. 3.3 Protocol versions
  151. Server descriptors contain optional information of supported
  152. link-level and circuit-level protocols in the form of
  153. "opt protocols Link 1 2 Circuit 1". These are not currently needed
  154. and will probably eventually move into the "v" (version) line in
  155. the consensus. This proposal does not deal with them.
  156. Similarly a server descriptor contains the version number of
  157. a Tor node. This information is already present in the consensus
  158. and is thus available to all clients immediately.
  159. 3.4 Exit selection
  160. Currently finding an appropriate exit node for a user's request is
  161. easy for a client because it has complete knowledge of all the exit
  162. policies of all servers on the network.
  163. The consensus document will once again be extended to contain the
  164. information required by clients. This information will be a summary
  165. of each node's exit policy. The exit policy summary will only contain
  166. the list of ports to which a node exits to most destination IP
  167. addresses.
  168. A summary should claim a router exits to a specific TCP port if,
  169. ignoring private IP addresses, the exit policy indicates that the
  170. router would exit to this port to most IP address. either two /8
  171. netblocks, or one /8 and a couple of /12s or any other combination).
  172. The exact algorith used is this: Going through all exit policy items
  173. - ignore any accept that is not for all IP addresses ("*"),
  174. - ignore rejects for these netblocks (exactly, no subnetting):
  175. 0.0.0.0/8, 169.254.0.0/16, 127.0.0.0/8, 192.168.0.0/16, 10.0.0.0/8,
  176. and 172.16.0.0/12m
  177. - for each reject count the number of IP addresses rejected against
  178. the affected ports,
  179. - once we hit an accept for all IP addresses ("*") add the ports in
  180. that policy item to the list of accepted ports, if they don't have
  181. more than 2^25 IP addresses (that's two /8 networks) counted
  182. against them (i.e. if the router exits to a port to everywhere but
  183. at most two /8 networks).
  184. An exit policy summary will be included in votes and consensus as a
  185. new line attached to each exit node. The line will have the format
  186. "p" <space> "accept"|"reject" <portlist>
  187. where portlist is a comma seperated list of single port numbers or
  188. portranges (e.g. "22,80-88,1024-6000,6667").
  189. Whether the summary shows the list of accepted ports or the list of
  190. rejected ports depends on which list is shorter (has a shorter string
  191. representation). In case of ties we choose the list of accepted
  192. ports. As an exception to this rule an allow-all policy is
  193. represented as "accept 1-65535" instead of "reject " and a reject-all
  194. policy is similarly given as "reject 1-65535".
  195. Summary items are compressed, that is instead of "80-88,89-100" there
  196. only is a single item of "80-100", similarly instead of "20,21" a
  197. summary will say "20-21".
  198. Port lists are sorted in ascending order.
  199. The maximum allowed length of a policy summary (including the "accept "
  200. or "reject ") is 1000 characters. If a summary exceeds that length we
  201. use an accept-style summary and list as much of the port list as is
  202. possible within these 1000 bytes.
  203. 3.4.1 Consensus selection
  204. When building a consensus, authorities have to agree on a digest of
  205. the server descriptor to list in the router line for each router.
  206. This is documented in dir-spec section 3.4.
  207. All authorities that listed that agreed upon descriptor digest in
  208. their vote should also list the same exit policy summary - or list
  209. none at all if the authority has not been upgraded to list that
  210. information in their vote.
  211. If we have votes with matching server descriptor digest of which at
  212. least one of them has an exit policy then we differ between two cases:
  213. a) all authorities agree (or abstained) on the policy summary, and we
  214. use the exit policy summary that they all listed in their vote,
  215. b) something went wrong (or some authority is playing foul) and we
  216. have different policy summaries. In that case we pick the one
  217. that is most commonly listed in votes with the matching
  218. descriptor. We break ties in favour of the lexigraphically larger
  219. vote.
  220. If none one of the votes with a matching server descriptor digest has
  221. an exit policy summary we use the most commonly listed one in all
  222. votes, breaking ties like in case b above.
  223. 3.4.2 Client behaviour
  224. When choosing an exit node for a specific request a Tor client will
  225. choose from the list of nodes that exit to the requested port as given
  226. by the consensus document. If a client has additional knowledge (like
  227. cached full descriptors) that indicates the so chosen exit node will
  228. reject the request then it MAY use that knowledge (or not include such
  229. nodes in the selection to begin with). However, clients MUST NOT use
  230. nodes that do not list the port as accepted in the summary (but for
  231. which they know that the node would exit to that address from other
  232. sources, like a cached descriptor).
  233. An exception to this is exit enclave behaviour: A client MAY use the
  234. node at a specific IP address to exit to any port on the same address
  235. even if that node is not listed as exiting to the port in the summary.
  236. 4. Migration
  237. 4.1 Consensus document changes.
  238. The consensus will need to include
  239. - bandwidth information (see 3.1)
  240. - exit policy summaries (3.4)
  241. A new consensus method (number TBD) will be chosen for this.
  242. 5. Future possibilities
  243. This proposal still requires that all servers have the descriptors of
  244. every other node in the network in order to answer RELAY_REQUEST_SD
  245. cells. These cells are sent when a circuit is extended from ending at
  246. node B to a new node C. In that case B would have to answer a
  247. RELAY_REQUEST_SD cell that asks for C's server descriptor (by SD digest).
  248. In order to answer that request B obviously needs a copy of C's server
  249. descriptor. The RELAY_REQUEST_SD cell already has all the info that
  250. B needs to contact C so it can ask about the descriptor before passing it
  251. back to the client.