Bi-vector balance hierarchical multicast architecture algorithms for Data Grid

For massive data transmission in Data Grid supporting radio and wireless, a set of novel hierarchical multicast algorithms is proposed to attain higher efficiency of data transfers. The newly-proposed algorithms first form different clusters, second calculate the space weight vector W\´ and the data quantity weight vector W\´\´ in very cluster. Then the algorithms try to find a new vector W composed by linear combination of the two old ones W\´ and W". The space factor and data factor game and balance, and the point of game and balance is ¿_i¿_j=0 ^m-1w_{i, j}\´ = ß_i¿_j=0 ^m-1w_{i, j}" a built a binary simple equation, and we sought linear parameters and generate a least weight path tree, namely multicast tree, which is then constructed by using the newly-proposed algorithms to implement the inter-cluster routing. Extended simulation results indicate that the new algorithms are more suitable for Data Grid.