Algorithms » History » Version 6
Greg Burri, 07/31/2009 09:50 AM
| 1 | 1 | Greg Burri | h1. Algorithms |
|---|---|---|---|
| 2 | |||
| 3 | h2. Searching |
||
| 4 | 2 | Greg Burri | |
| 5 | 3 | Greg Burri | For a functional description see here : [[Functional definition#The-search-window]] |
| 6 | |||
| 7 | 2 | Greg Burri | !aybabtu_search.png! |
| 8 | 4 | Greg Burri | |
| 9 | 5 | Greg Burri | h2. Peer ID |
| 10 | |||
| 11 | 6 | Greg Burri | Each peer owns a peer id which is unique and generated during the first start. This ID is used to identify a peer, it's better than the peer IP. Considering this situation : |
| 12 | 5 | Greg Burri | |
| 13 | * _A_ put in queue a file entry _f_ from _B_, _B_ doesn't know the hashes of this file entry. |
||
| 14 | * _B_ change his IP address. |
||
| 15 | * _A_ want to download _f_, it can ask _B_ for the hashes even _B_'s IP changed. |
||
| 16 | |||
| 17 | |||
| 18 | |||
| 19 | 4 | Greg Burri | h2. Downloading |
| 20 | |||
| 21 | See here : [[Protocol_core-core#Downloading-threads]] |