Linear Optimal Hierarchical Multicast Tree Algorithms for P2P Database

Abstract

For attained high data multicast efficiency for the P2P database system, the paper proposes a set of novel multicast algorithms. In contrast with the current algorithms, the new algorithms firstly divide the group members into different clusters in terms of static delay distance, then find the central node in the clusters, calculate the space weight of every node, search the data quantity of every node, and find the maximal data quantity node. After obtaining the spatial weight vector and the data quantity weight vector, the algorithms try to find a new vector composed by linear combination of the spatial and data weight vectors. Then the algorithms build binary simple equations between them, seek linear modulus and generate a least weight path tree, namely multicast tree. The multicast tree is then constructed by using the new algorithms. Extended simulation results indicate that these new algorithms are more suitable for P2P Database compared with other well-known existing multicast solutions.