Two random search techniques, the genetic algorithm (GA) and the simulated annealing (SA) approaches, are used to construct fault-tolerant communication trees with the lowest data transmission time in this paper. Experimental evaluation shows that with reasonably low search time, the GA and SA approaches are able to find more desirable communication trees, i.e., trees with less data transmission time, than the minimal cost approach. Also provided is a distributed approach with two algorithms able to further reduce search time for the GA and SA approaches due to parallel search for communication subtrees in disjoint subcubes.
關聯:
Proceedings of the 2002 International Computer Symposium (Volume I)=二00二年國際計算機會議論文集(I), pp.245-252