leyoda/rqbit
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Using response freshness in ordering

Browse source
This commit is contained in:
Igor Katson 2023-11-29 23:57:11 +00:00
parent a5ae2988b8
commit 7d02d79ff5
No known key found for this signature in database
GPG key ID: B4EC22B66D61A3F5
1 changed files with 10 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

11
crates/dht/src/dht.rs
View file

@ -437,7 +437,16 @@ impl<C: RecursiveRequestCallbacks> RecursiveRequest<C> {
let has_returned_peers_desc = Reverse(n.returned_peers); let has_returned_peers_desc = Reverse(n.returned_peers);
let has_responded_desc = Reverse(n.last_response.is_some() as u8); let has_responded_desc = Reverse(n.last_response.is_some() as u8);
let distance = n.id.distance(&self.info_hash); let distance = n.id.distance(&self.info_hash);
(has_returned_peers_desc, has_responded_desc, distance) let freshest_response = n
.last_response
.map(|r| r.elapsed())
.unwrap_or(Duration::MAX);
(
has_returned_peers_desc,
has_responded_desc,
distance,
freshest_response,
)
}); });
if closest_nodes.len() > LIMIT { if closest_nodes.len() > LIMIT {
let popped = closest_nodes.pop().unwrap(); let popped = closest_nodes.pop().unwrap();