对等网络Churn问题评估模型与分析  

Evaluating model and simulation analyzing for P2P Churn

作　　者：杨冬[1] 董平[1] 张宏科[1] 

机构地区：[1]北京交通大学电子信息工程学院,北京100044

出　　处：《通信学报》2007年第6期39-47,共9页Journal on Communications

基　　金：国家自然科学基金资助项目(60473001);国家重点基础研究发展计划("973"计划)基金资助项目(2007CB307100;2007CB307101)~~

摘　　要：提出一个Churn问题评估模型,以及基于该模型的2种比较模式和一个公式化描述。使用模型对3种常用对等网络分析得出以下重要结论:Chord算法在Churn环境下性能最优,影响Churn问题众多因素中最重要的是节点平均生存时间,Churn带来的两类影响不可能同时有效解决,二者存在平衡制约关系。评估模型和相关结论可为Churn环境下研究现有对等网络和设计新对等网协议提供分析平台。Most P2P algorithms based on distributed Hash table （DHT） faced Chum, which was caused by the continuous process of node joining and failure. A Chum 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 Chum, the advantage of Chord than others, and the most important factor affecting Chum.

关 键 词：计算机网络 对等网络 评估模型 CHURN 

分 类 号：TP393.02[自动化与计算机技术—计算机应用技术]