Issue No. 09 - September (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.29474
The author establishes the worst-case time complexity of all-to-all broadcast, which involves the simultaneous broadcast of messages from each node in a network to each other node, as with the dissemination of network status information for adaptive routing in ARPANET, by flooding. It it shown to be almost two times the optimum. This suboptimality of flooding results from the selection method p
flooding; communications networks; worst-case time complexity; all-to-all broadcast; simultaneous broadcast; adaptive routing; ARPANET; suboptimality; spanning subtree; FIFO; LIFO; computational complexity; computer networks.
D. Topkis, "All-to-All Broadcast by Flooding in Communications Networks," in IEEE Transactions on Computers, vol. 38, no. , pp. 1330-1333, 1989.