H.A. Harutyunyan and B. Shao (Canada)
Algorithms, IP, ATM, Internet
In this paper, we present a heuristic algorithm for broadcasting in an arbitrary network. In practice, the heuristic works very well, and also runs very fast. The time complexity of the algorithm is O(Rm), where R represents the rounds of broadcasting, and m stands for the total number of communication links in the net work. Our experimental result is the following: Our al gorithm outperforms best known broadcast algorithms for three different network design models. For only one graph, out of 200, the performance of our algorithm is not the best. In 40% of the cases, our algorithm gives a better broadcast time than other algorithms.
Important Links:
Go Back
