]> Sergey Matveev's repositories - btrtrc.git/commit
projects / btrtrc.git / commit
summary | shortlog | log | commit | commitdiff | tree
(parent: bdb33ef) | patch
Use relative availabilities to determine piece request order
authorMatt Joiner <anacrolix@gmail.com>
Fri, 17 Dec 2021 11:06:21 +0000 (22:06 +1100)
committerMatt Joiner <anacrolix@gmail.com>
Thu, 23 Dec 2021 03:00:00 +0000 (14:00 +1100)
commit506ff8d037f4e88d9ca8b8ce04e2cfb81a004da8
tree4078dc95a15ee3502cbf9e4d92c0dee79403b270tree
parentbdb33ef9f784ed847e285f08da359f02b4e8f91ecommit | diff
Use relative availabilities to determine piece request order

Most overhead comes from peers that connect that have everything, and we just increment every single piece's availability. There may be some unresolved determinism with torrents that share the same ordering.
client_test.go diff | blob | history
misc.go diff | blob | history
peerconn.go diff | blob | history
peerconn_test.go diff | blob | history
piece.go diff | blob | history
request-strategy/order.go diff | blob | history
request-strategy/piece-request-order.go diff | blob | history
requesting.go diff | blob | history
torrent.go diff | blob | history
Better BitTorrent client