2014 IEEE 28th International Conference on Advanced Information Networking and Applications (AINA) (2014)
Victoria, BC, Canada
May 13, 2014 to May 16, 2014
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AINA.2014.63
In this paper, we present a new heuristic that generates broadcast schemes in arbitrary networks. The heuristic gives optimal broadcast time for HyperCube, and best results for Cube-Connected Cycles and large Shuffle-Exchange graphs. Extensive simulations show that our new heuristic outperforms the best known broadcast algorithms for two different network models representing Internet generated using BRITE (Boston university Representative Internet Topology gEnerator). It also has a low time complexity, O(Elog V), which is lower compared to the complexities of most of the other good algorithms. The last advantage of the heuristic is that approximately one half of the nodes are informed via a shortest path from the originator, while the rest of the vertices receive the message via a path at most three hops longer.
Complexity theory, Broadcasting, Multiprocessor interconnection, Heuristic algorithms, Network topology, Topology, Computer science
H. A. Harutyunyan and C. Jimborean, "New Heuristic for Message Broadcasting in Networks," 2014 IEEE 28th International Conference on Advanced Information Networking and Applications (AINA), Victoria, BC, Canada, 2014, pp. 517-524.