-
-
Notifications
You must be signed in to change notification settings - Fork 135
/
DHTSettings.java
431 lines (390 loc) · 12.2 KB
/
DHTSettings.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
package com.frostwire.jlibtorrent;
import com.frostwire.jlibtorrent.swig.dht_settings;
/**
* structure used to hold configuration options for the DHT
* <p/>
* The ``dht_settings`` struct used to contain a ``service_port`` member to
* control which port the DHT would listen on and send messages from. This
* field is deprecated and ignored. libtorrent always tries to open the UDP
* socket on the same port as the TCP socket.
*
* @author gubatron
* @author aldenml
*/
public final class DhtSettings {
private final dht_settings s;
public DhtSettings(dht_settings s) {
this.s = s;
}
public dht_settings getSwig() {
return s;
}
/**
* the maximum number of peers to send in a reply to ``get_peers``.
*
* @return
*/
public int maxPeersReply() {
return s.getMax_peers_reply();
}
/**
* the maximum number of peers to send in a reply to ``get_peers``.
*
* @param value
*/
public void maxPeersReply(int value) {
s.setMax_peers_reply(value);
}
/**
* the number of concurrent search request the node will send when
* announcing and refreshing the routing table. This parameter is called
* alpha in the kademlia paper.
*
* @return
*/
public int getSearchBranching() {
return s.getSearch_branching();
}
/**
* the number of concurrent search request the node will send when
* announcing and refreshing the routing table. This parameter is called
* alpha in the kademlia paper.
*
* @param value
*/
public void setSearchBranching(int value) {
s.setSearch_branching(value);
}
/**
* the maximum number of failed tries to contact a node before it is
* removed from the routing table. If there are known working nodes that
* are ready to replace a failing node, it will be replaced immediately,
* this limit is only used to clear out nodes that don't have any node
* that can replace them.
*
* @return
*/
public int getMaxFailCount() {
return s.getMax_fail_count();
}
/**
* the maximum number of failed tries to contact a node before it is
* removed from the routing table. If there are known working nodes that
* are ready to replace a failing node, it will be replaced immediately,
* this limit is only used to clear out nodes that don't have any node
* that can replace them.
*
* @param value
*/
public void setMaxFailCount(int value) {
s.setMax_fail_count(value);
}
/**
* the total number of torrents to track from the DHT. This is simply an
* upper limit to make sure malicious DHT nodes cannot make us allocate
* an unbounded amount of memory.
*
* @return
*/
public int maxTorrents() {
return s.getMax_torrents();
}
/**
* the total number of torrents to track from the DHT. This is simply an
* upper limit to make sure malicious DHT nodes cannot make us allocate
* an unbounded amount of memory.
*
* @param value
*/
public void maxTorrents(int value) {
s.setMax_torrents(value);
}
/**
* max number of items the DHT will store.
*
* @return
*/
public int getMaxDHTItems() {
return s.getMax_dht_items();
}
/**
* max number of items the DHT will store.
*
* @param value
*/
public void setMaxDHTItems(int value) {
s.setMax_dht_items(value);
}
/**
* The max number of peers to store per torrent (for the DHT).
*
* @return
*/
public int maxPeers() {
return s.getMax_peers();
}
/**
* The max number of peers to store per torrent (for the DHT).
*
* @param value
*/
public void maxPeers(int value) {
s.setMax_peers(value);
}
/**
* the max number of torrents to return in a torrent search query to the
* DHT.
*
* @return
*/
public int getMaxTorrentSearchReply() {
return s.getMax_torrent_search_reply();
}
/**
* the max number of torrents to return in a torrent search query to the
* DHT.
*
* @param value
*/
public void setMaxTorrentSearchReply(int value) {
s.setMax_torrent_search_reply(value);
}
/**
* determines if the routing table entries should restrict entries to one
* per IP. This defaults to true, which helps mitigate some attacks on
* the DHT. It prevents adding multiple nodes with IPs with a very close
* CIDR distance.
* <p/>
* when set, nodes whose IP address that's in the same /24 (or /64 for
* IPv6) range in the same routing table bucket. This is an attempt to
* mitigate node ID spoofing attacks also restrict any IP to only have a
* single entry in the whole routing table.
*
* @return
*/
public boolean isRestrictRoutingIPs() {
return s.getRestrict_routing_ips();
}
/**
* determines if the routing table entries should restrict entries to one
* per IP. This defaults to true, which helps mitigate some attacks on
* the DHT. It prevents adding multiple nodes with IPs with a very close
* CIDR distance.
* <p/>
* when set, nodes whose IP address that's in the same /24 (or /64 for
* IPv6) range in the same routing table bucket. This is an attempt to
* mitigate node ID spoofing attacks also restrict any IP to only have a
* single entry in the whole routing table.
*
* @param value
*/
public void setRestrictRoutingIPs(boolean value) {
s.setRestrict_routing_ips(value);
}
/**
* determines if DHT searches should prevent adding nodes with IPs with
* very close CIDR distance. This also defaults to true and helps
* mitigate certain attacks on the DHT.
*
* @return
*/
public boolean isRestrictSearchIPs() {
return s.getRestrict_search_ips();
}
/**
* determines if DHT searches should prevent adding nodes with IPs with
* very close CIDR distance. This also defaults to true and helps
* mitigate certain attacks on the DHT.
*
* @param value
*/
public void setRestrictSearchIPs(boolean value) {
s.setRestrict_search_ips(value);
}
/**
* makes the first buckets in the DHT routing table fit 128, 64, 32 and
* 16 nodes respectively, as opposed to the standard size of 8. All other
* buckets have size 8 still.
*
* @return
*/
public boolean isExtendedRoutingTable() {
return s.getExtended_routing_table();
}
/**
* makes the first buckets in the DHT routing table fit 128, 64, 32 and
* 16 nodes respectively, as opposed to the standard size of 8. All other
* buckets have size 8 still.
*
* @param value
*/
public void setExtendedRoutingTable(boolean value) {
s.setExtended_routing_table(value);
}
/**
* slightly changes the lookup behavior in terms of how many outstanding
* requests we keep. Instead of having branch factor be a hard limit, we
* always keep *branch factor* outstanding requests to the closest nodes.
* i.e. every time we get results back with closer nodes, we query them
* right away. It lowers the lookup times at the cost of more outstanding
* queries.
*
* @return
*/
public boolean isAggressiveLookups() {
return s.getAggressive_lookups();
}
/**
* slightly changes the lookup behavior in terms of how many outstanding
* requests we keep. Instead of having branch factor be a hard limit, we
* always keep *branch factor* outstanding requests to the closest nodes.
* i.e. every time we get results back with closer nodes, we query them
* right away. It lowers the lookup times at the cost of more outstanding
* queries.
*
* @param value
*/
public void getAggressiveLookups(boolean value) {
s.setAggressive_lookups(value);
}
/**
* when set, perform lookups in a way that is slightly more expensive,
* but which minimizes the amount of information leaked about you.
*
* @return
*/
public boolean isPrivacyLookups() {
return s.getPrivacy_lookups();
}
/**
* when set, perform lookups in a way that is slightly more expensive,
* but which minimizes the amount of information leaked about you.
*
* @param value
*/
public void setPrivacyLookups(boolean value) {
s.setPrivacy_lookups(value);
}
/**
* when set, node's whose IDs that are not correctly generated based on
* its external IP are ignored. When a query arrives from such node, an
* error message is returned with a message saying "invalid node ID".
*
* @return
*/
public boolean isEnforceNodeId() {
return s.getEnforce_node_id();
}
/**
* when set, node's whose IDs that are not correctly generated based on
* its external IP are ignored. When a query arrives from such node, an
* error message is returned with a message saying "invalid node ID".
*
* @param value
*/
public void setEnforceNodeId(boolean value) {
s.setEnforce_node_id(value);
}
/**
* ignore DHT messages from parts of the internet we wouldn't expect to
* see any traffic from
*
* @return
*/
public boolean isIgnoreDarkInternet() {
return s.getIgnore_dark_internet();
}
/**
* ignore DHT messages from parts of the internet we wouldn't expect to
* see any traffic from
*
* @param value
*/
public void setIgnoreDarkInternet(boolean value) {
s.setIgnore_dark_internet(value);
}
/**
* The number of seconds a DHT node is banned if it exceeds the rate
* limit. The rate limit is averaged over 10 seconds to allow for bursts
* above the limit.
*
* @return
*/
public int blockTimeout() {
return s.getBlock_timeout();
}
/**
* The number of seconds a DHT node is banned if it exceeds the rate
* limit. The rate limit is averaged over 10 seconds to allow for bursts
* above the limit.
*
* @param value
*/
public void blockTimeout(int value) {
s.setBlock_timeout(value);
}
/**
* The max number of packets per second a DHT node is allowed to send
* without getting banned.
*
* @return
*/
public int blockRatelimit() {
return s.getBlock_ratelimit();
}
/**
* The max number of packets per second a DHT node is allowed to send
* without getting banned.
*
* @param value
*/
public void blockRatelimit(int value) {
s.setBlock_ratelimit(value);
}
/**
* When set, the other nodes won't keep this node in their routing
* tables, it's meant for low-power and/or ephemeral devices that
* cannot support the DHT, it is also useful for mobile devices which
* are sensitive to network traffic and battery life.
* this node no longer responds to 'query' messages, and will place a
* 'ro' key (value = 1) in the top-level message dictionary of outgoing
* query messages.
*
* @return
*/
public boolean readOnly() {
return s.getRead_only();
}
/**
* When set, the other nodes won't keep this node in their routing
* tables, it's meant for low-power and/or ephemeral devices that
* cannot support the DHT, it is also useful for mobile devices which
* are sensitive to network traffic and battery life.
* this node no longer responds to 'query' messages, and will place a
* 'ro' key (value = 1) in the top-level message dictionary of outgoing
* query messages.
*
* @param value
*/
public void readOnly(boolean value) {
s.setRead_only(value);
}
/**
* The number of seconds a immutable/mutable item will be expired.
* default is 0, means never expires.
*
* @return
*/
public int itemLifetime() {
return s.getItem_lifetime();
}
/**
* The number of seconds a immutable/mutable item will be expired.
* default is 0, means never expires.
*
* @param value
*/
public void itemLifetime(int value) {
s.setItem_lifetime(value);
}
}