| P2P网络通信树群发算法研究 |
| |
| 引用本文： | 王欣. P2P网络通信树群发算法研究[J]. 延安大学学报(自然科学版), 2014, 0(2): 25-27,30 |
| |
| 作者姓名： | 王欣 |
| |
| 作者单位： | 安徽绿海商务职业学院继续教育学院,安徽合肥230601 |
| |
| 摘 要： | 深入分析P2P通信规则,以并发通信时间最短为目标,提出了一种新型的群发通信树构建算法——“困难节点”优先通信树算法.对比支路优先试加节点通信树算法,更加合理的布局各个节点在通信树中的位置,模拟结果表明,“困难节点”优先通信树算法的通信效率优于支路优先试加节点通信树算法.
|
| 关 键 词： | P2P通信树 并发通信 困难节点 |
Research on P2P Network Mass Communication Tree Algorithm |
| |
| WANG XIN. Research on P2P Network Mass Communication Tree Algorithm[J]. Journal of Yan'an University(Natural Science Edition), 2014, 0(2): 25-27,30 |
| |
| Authors: | WANG XIN |
| |
| Affiliation: | WANG XIN (School of Continuing Education, Anhui Lvhai Vocational College of Business, Hefei 230601, China) |
| |
| Abstract: | In depth analysis of P2P communication rules, the concurrent communication time as the target, construetion algorithm is proposed for mass communication tree model -＂ difficult node＂ priority communication tree algorithm. Comparison test and branch priority node communication tree algorithm, position in the communication tree each node in the layout more reasonable, the simulation results show that,＂ the communication efficiency is better than that of hard branch node＂ priority communication tree algorithm first try to add node communication tree algorithm. |
| |
| Keywords: | P2P communication tree concurrent communication nodes difficulties |
| 本文献已被 维普 等数据库收录！ |
|
