A Peer Selection Scheme Using Cache and Measurement in P2P
Fu Jianming, Sun Fangqi · Dianzi xuebao · 2006
In order to solve peer selection problem in unstructured P2P,size-Varied Measurement(VM) and size-Fixed Measurement(FM) using cache are provided.Moreover,four caching strategies are investigated: Random Drop(RD),Largest Latency Drop(LLD),Earliest Timestamp Drop(ED) and Least Use Drop(LUD).Finally,our experimental results show the following observations: FM greatly outperforms VM,LLD and LUD are prior to others,our schemes are stable when the rate of topology change is below 5%,and concurrent measurement can sharply reduce the peer selection latency.