摘要
研究P2P网络路径优化选取问题,由于网络中用户节点增多,P2P承担发送和接收双重功能。当P2P网络中传输任务过多时,如果路径选择不佳,会导致通信效率过低,传输数据慢的问题。为解决上述问题,提出一种最优路径选取算法,并且利用网络中的节点建立带权完全图,为每条路径计算权值并标号,将路径权值从小到大排列,可以选取权值最小的路径作为最优路径,避免了传统方法逐个遍历网络节点带来的通信效率过低的问题。实验证明,采用用改进方法能够快速选取通信最优路径,有效提高了P2P网络通信效率,取得了满意的结果,为网络快速通信提供了科学依据。
Study the communication problem of P2P networks.When P2P networks are too poor,poor path selection can lead to the problem of low communication efficiency and low data transmission.This paper proposed a method based on the optimal path selection Kruskal by using network nodes algorithm of weighted completely figure,calculated weights for each path and marking it.Arranging the paths in the order of weight values,the path of least weights waw selected as the optimal path,which avoided traversing network nodes as in the traditional method.Experiments show that the method presented in this paper can quickly select communication optimal path,effectively improve the network communication efficiency,and the satisfactory results were obtained.
出处
《计算机仿真》
CSCD
北大核心
2011年第12期126-129,共4页
Computer Simulation
关键词
最优路径
带权完全图
通信效率
Optimal path
Weighted completely figure
Communication efficiency
