This Article 
 Bibliographic References 
 Add to: 
Information Dissemination in Trees with Nonuniform Edge Transmission Times
October 1991 (vol. 40 no. 10)
pp. 1174-1177

The information dissemination process in a tree is considered. It is assumed that a vertex can either transmit or receive a message and an informed vertex can transmit it to only one of its neighbors at a time. For the case of uniform edge transmission times, P. Slater et al. (1981) showed that a simple ordering policy achieves the minimum broadcast time and presented an algorithm which determines a set of broadcast centers. It is shown that a simple ordering policy is still optimal for the case of nonuniform edge transmission times, and modifications of the algorithm that enables it to solve this general problem within O(N log N) time are suggested.

[1] A. M. Farley, "Minimal broadcast networks,"Networks, vol. 9, pp. 313- 332, 1979.
[2] A. M. Farley, "Minimum-time line broadcast networks,"Networks, vol. 10, pp. 59-70, 1980.
[3] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[4] P. Slater, E. Cockayne, and S. Hedetniemi, "Information dissemination in trees,"SIAM J. Comput., vol. 10, pp. 692-701, Nov. 1981.

Index Terms:
message transmission; message reception; trees; nonuniform edge transmission times; information dissemination; informed vertex; ordering policy; broadcasting; computational complexity; computer networks; trees (mathematics).
J. Koh, D. Tcha, "Information Dissemination in Trees with Nonuniform Edge Transmission Times," IEEE Transactions on Computers, vol. 40, no. 10, pp. 1174-1177, Oct. 1991, doi:10.1109/12.93751
Usage of this product signifies your acceptance of the Terms of Use.