Efficient Broadcasting Algorithm in Harary-like Networks}

Puspal Bhabak, Hovhannes Harutyunyan & Peter Kropf

Résumé In this paper, we analyze the properties of Harary graphs and some derivatives with respect to the achievable performance of communication within network structures based on these graphs. In particular we defined Cordal-Haray graphs on n nodes which can be constructed for any even n for any odd degree between 3 and 2[log n] - 1. We also present a simple algorithm for fast message broadcasting in this network. Our analysis show that when nodes of a Cordal-Harary Graph have logarithmic degree then the broadcasting time will be as small as [log n] which is the minimum possible value for a network on n nodes. All this properties show that Cordal-Harary is a very good network architecture for parallel processing.
Citation P. Bhabak, et al., "Efficient Broadcasting Algorithm in Harary-like Networks}," in 46th International Conference on Parallel Processing Workshops, ICPPW, Bristol, 2017, p. 162-170.
Type Actes de congrès (Anglais)
Nom de la conférence 46th International Conference on Parallel Processing Workshops, ICPPW (Bristol)
Date de la conférence 1-8-2017
Pages 162-170
URL https://doi.org/10.1109/ICPPW.2017.34