Broadcasting in Trees with Multiple Originators
Authors:
- Arthur M. FarleyAFArthur M. Farley
- Andrzej ProskurowskiAPAndrzej Proskurowski
- 1 December 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 2 (4) , 381-386
Abstract
Broadcasting is the information dissemination process in a communication network whereby all sites of the network become informed of a given message by calls made over lines of the network. We present an algorithm which, given a tree network and a time, determines a smallest set of subtrees covering sites of the network such that broadcast can be completed within the given time in each subtree. Information developed by the algorithm is sufficient to determine a satisfactory originator and calling scheme within each subtree.Keywords
This publication has 7 references indexed in Scilit:
- Information Dissemination in TreesSIAM Journal on Computing, 1981
- Minimum Broadcast TreesIEEE Transactions on Computers, 1981
- Partitioning trees: Matching, domination, and maximum diameterInternational Journal of Parallel Programming, 1981
- Broadcast Time in Communication NetworksSIAM Journal on Applied Mathematics, 1980
- An Algorithmic Approach to Network Location Problems. I: Thep-CentersSIAM Journal on Applied Mathematics, 1979
- Minimal broadcast networksNetworks, 1979
- Minimum broadcast graphsDiscrete Mathematics, 1979