| commit | 3f1fd64940be314cb526f56c05ce0a035bdb55f2 | |
| author | upstream svn <svn@amule.org> | |
| Tue, 24 Aug 2010 13:16:06 +0000 (24 13:16 +0000) | ||
| committer | Dévai Tamás <gonosztopi@amule.org> | |
| Tue, 24 Aug 2010 13:33:04 +0000 (24 13:33 +0000) | ||
| tree | 74cf7219a8d5f641d9a1d56106cb3f69b3276d61 | treesnapshot (tar.gz zip) |
| parent | 9cfebaf7623d4a6b048bb0e5df3c05a390652ebc | commitdiff |
Try to find the closest node alive.
In a find lookup, if the best two nodes are dead/unreachable, then try to
discover more close nodes before using our other results. The reason for
this is that we may not have found the closest node alive, due to results
being limited to two contacts, which could very well have been the
duplicates of our dead closest nodes.
Note that this is just a quick intermediate fix to make certain Kad lookups
more reliable, improving the results in some cases [ based on research from
http://www-users.cs.umn.edu/~hopper/kad.pdf ]
In a find lookup, if the best two nodes are dead/unreachable, then try to
discover more close nodes before using our other results. The reason for
this is that we may not have found the closest node alive, due to results
being limited to two contacts, which could very well have been the
duplicates of our dead closest nodes.
Note that this is just a quick intermediate fix to make certain Kad lookups
more reliable, improving the results in some cases [ based on research from
http://www-users.cs.umn.edu/~hopper/kad.pdf ]
| .svn-revision | diffblobblamehistory | |
| src/include/protocol/kad/Constants.h | diffblobblamehistory | |
| src/kademlia/kademlia/Search.cpp | diffblobblamehistory | |
| src/kademlia/kademlia/Search.h | diffblobblamehistory |