| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2025-06-29 | Free the nodeid label | Jesper Jensen | |
| 2025-06-23 | Print the invalid dest_len | Jesper Jensen | |
| 2025-06-19 | Correct duplicate check | Jesper Jensen | |
| I though it was a cool feature that C allowed you to implicitly memcmp statically sized arrays. It turns out it doesn't, it was just comparing their pointers which are obviously not equal. | |||
| 2025-05-10 | Run the lookup once in a while | Jesper Jensen | |
| 2025-05-10 | Run the lookup on startup | Jesper Jensen | |
| 2025-05-10 | Remove the routing table rebuild | Jesper Jensen | |
| 2025-05-10 | Rebuild the rounting table on startup | Jesper Jensen | |
| 2025-05-07 | Transfer the id after loading it | Jesper Jensen | |
| 2025-05-06 | Reset the expire time of routing table on startup | Jesper Jensen | |
| 2025-05-04 | Use atomic-rename trick to avoid clobbering state | Jesper Jensen | |
| 2025-05-04 | Add some check for expiry time | Jesper Jensen | |
| 2025-05-04 | Remove some noisy debug tracing | Jesper Jensen | |
| 2025-05-04 | Set the metrics AFTER initializing SMH | Jesper Jensen | |
| 2025-05-04 | Refactor lookup init and add routing table metric | Jesper Jensen | |
| I think it would be nice to see the detailed routing table occupancy. I've added a metric that exposes the current occupancy of each bucket. That should provide me some insight into the current distribution of nodes and if we need to find a way to keep the closer buckets alive. | |||
| 2025-04-26 | Add end timeout to lookup function | Jesper Jensen | |
| 2025-04-16 | Add a first approximation of a lookup algorithm | Jesper Jensen | |
| This isn't really "correct" but it's probably going to work. It's a rough implementation of the Kademlia lookup algorithm, with the modification that we don't keep track of anything behind the frontier. We are therefore counting on peers being ok with us potentially sending them the "same" request multiple times. If they respond in a reasonable time, the double request rate _should_ be minimal, but that of course carries the risk that an already overloaded peer would get even more queries. I don't know. It's a first try at something. I need to see it work before I write it off completely. | |||
| 2025-04-14 | Flush config more often to recover from crashes | Jesper Jensen | |
| We sometimes crash on bad input. While I fix that, it makes sense to at least be able to recover | |||
| 2025-04-12 | Add a docker container | Jesper Jensen | |
| 2025-04-12 | Add prometheus monitoring | Jesper Jensen | |
| 2025-04-12 | I don't know | Jesper Jensen | |
| 2025-04-12 | I don't remember | Jesper Jensen | |
| 2021-10-16 | Flush in main | Jesper Jensen | |
| 2021-10-05 | Add getclient timeout | Jesper Jensen | |
| 2021-10-02 | Add timeout handling | Jesper Jensen | |
| 2021-09-25 | Add timeout | Jesper Jensen | |
| 2021-09-19 | Add general tests | Jesper Jensen | |
| 2021-09-05 | Add error support | Jesper Jensen | |
| 2021-09-03 | Add ping support | Jesper Jensen | |
| 2021-08-29 | Add formal benc cursor | Jesper Jensen | |
| 2021-08-28 | Initial fanout implemented | Jesper Jensen | |
| 2021-06-22 | Move the comment into routing | Jesper Jensen | |
| 2021-06-17 | Add tests and test running | Jesper Jensen | |
| 2021-06-16 | INITIAL COMMIT | Jesper Jensen | |
 |
index : dht.git | |
| BitTorrent DHT peer |
| summaryrefslogtreecommitdiff |