1 | 20 September 2009: dht-0.9 |
---|
2 | |
---|
3 | * Fixed incorrect computation of number of nodes. |
---|
4 | * Made the initial bucket split eagerly (speeds up bootstrapping). |
---|
5 | * Fixed initial filling of search buckets (speeds up searches). |
---|
6 | |
---|
7 | 28 July 2009: dht-0.8 |
---|
8 | |
---|
9 | * Fixed a crash when expiring the first search on the list. |
---|
10 | * Fixed freeing of the search list when uniniting with dofree = 1. |
---|
11 | |
---|
12 | 24 June 2009: dht-0.7 |
---|
13 | |
---|
14 | * Removed the fixed limit on the number of concurrent searches, we now |
---|
15 | use a linked list. |
---|
16 | * Fixed build on FreeBSD (thanks to Humihara and Charles Kerr). |
---|
17 | |
---|
18 | 22 May 2009: dht-0.6 |
---|
19 | |
---|
20 | * Fixed a buffer overflow (when reading) in parse_message. |
---|
21 | * Fixed slightly inacurrate metric computation when searching. |
---|
22 | * Removed a slightly inaccurate shortcut when responding to find_nodes. |
---|
23 | * Relaxed the rate-limiting parameters to 4 requests per second. |
---|
24 | |
---|
25 | 19 May 2009: dht-0.5 |
---|
26 | |
---|
27 | * Made reading of /dev/urandom a function provided by the user. |
---|
28 | * Implemented the ``v'' extension that identifies node implementations. |
---|
29 | |
---|
30 | 18 May 2009: dht-0.4 |
---|
31 | |
---|
32 | * Fixed the handling of tokens in announce_peer messages. |
---|
33 | * Implemented backtracking during search when nodes turn out to be dead. |
---|
34 | |
---|
35 | 17 May 2009: dht-0.3 |
---|
36 | |
---|
37 | * Fixed a number of incorrectly formatted messages. |
---|
38 | * Changed reply to find_peers to spread the load more uniformly. |
---|
39 | * Fixed a bug that could cause premature splitting. |
---|
40 | * Implemented rate limiting. |
---|
41 | * Changed some time constants to be less chatty. |
---|
42 | * When determining if a bucket is fresh enough, we now only take replies |
---|
43 | into account. |
---|
44 | * dht_get_nodes now returns nodes starting with our own bucket. |
---|
45 | * Tweaked the memory allocation strategy for stored peers. |
---|
46 | |
---|
47 | 17 May 2009: dht-0.2 |
---|
48 | |
---|
49 | * Fixed a crash in dht_uninit. |
---|
50 | * Added support for saving the list of known-good nodes. |
---|
51 | * Changed the interface of dht_nodes to provide the number of nodes that |
---|
52 | recently sent incoming requests. |
---|
53 | |
---|
54 | 13 May 2009: dht-0.1 |
---|
55 | |
---|
56 | * Initial public release. |
---|