Evaluating model and simulation analyzing for P2P Churn
Most P2P algorithms based on distributed Hash table（DHT） faced Churn,which was caused by the continuous process of node joining and failure.A Churn evaluating model was proposed and its formulized description,which could give some important instructions for analyzing current P2P algorithms and desig...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2007-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74658111/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Most P2P algorithms based on distributed Hash table（DHT） faced Churn,which was caused by the continuous process of node joining and failure.A Churn evaluating model was proposed and its formulized description,which could give some important instructions for analyzing current P2P algorithms and designing new algorithms.Using this model,a simulation including three P2P algorithm Chord,Kelips,and Tapestry was done.The experiment results show the capability of these algorithms under Churn,the advantage of Chord than others,and the most important factor affecting Churn. |
|---|---|
| ISSN: | 1000-436X |