Study on a Concurrent Communication Tree Algorithm of P2P Multi-Link Mode

Based on the concurrent communication tree model, considering the network node communication capability and the communication weights between nodes, according to the importance of the number of node joints (NNJ) and communication weights, this paper proposes the weight first (WFI) communication tree algorithm and the NNJ first (JFI) communication tree algorithm respectively. The results, compared among the WFI, JFI and BFI algorithm, show that under the situation of larger differences among weights, the WFI algorithm is superior to BFI and JFI algorithm in the aspect of communication time and average communication time of branches, and under the situation of smaller differences among weights, the JFI algorithm is superior to the other two algorithms.