A new heuristic for broadcasting in cluster of clusters

This paper deals with the problem of broadcasting for cluster of clusters The construction of partial minimum spanning trees being NP-complete, several heuristic algorithms have been already formulated Many of these heuristics (like the heuristic of Kruskal) use the shortest path to connect the components of the tree They are not relevant in case of forwarding or overlapping communication during a step of the algorithm In this paper, we study a new heuristic for the minimum broadcasting tree and we evaluate it through simulations with different communication parameters and also through real experimentation over the Grid'5000 testbed.