一种基于多连接的P2P通信树算法研究

Study on a P2P communication tree algorithm based on multi-link

目的解决节点多连接情况下P2P通信树通信效率问题。方法提出了一种多连接通信树算法,该算法引入节点通信连接数的概念,采用贪婪思想,根据节点通信连接数大小,优先依次选取通信能力强的节点作为通信源,以缩短整个通信过程的并发通信时间。结果模拟结果表明,多连接通信树在通信时间、节点使用率、并发度方面均优于单连接通信树。结论多连接通信树算法可使节点最大限度发挥自己的通信能力,使整个通信过程并发通信,从而提高了通信树的通信效率和并发度。该算法适合于多播通信和网络数据群发。

Aim To solve the communication efficiency problem of P2P communication tree under the multi-link condition.Methods A multi-link communication tree algorithm is proposed.It introduces the concept of node communication link number,uses greedy thinking,and selects the nodes of strong communication capability as the communication sources according to the size of the node communication link number in order to shorten the concurrent communication time.Results Simulation results indicate that a multi-link communication tree is superior to a single-link communication tree in communication time,node utilization ratio and concurrency.Conclusion The algorithm makes the nodes realize their communication capabilities as much as possible and causes the whole communication process concurrency.Thereby communication efficiency and concurrency are improved.The algorithm is suitable for multicast communication and network data mass transmit.