Broadcasting in general networks I: Trees
Broadcasting is the process of information dissemination in communication networks whereby a message originated at one vertex becomes known to all members given that at each unit of time a vertex can pass the message to at most one of its neighbours. In this paper we consider the problem of broadcasting in trees which is a step towards studying broadcasting in general graphs, as oppose to the much studied problem of constructing broadcast graphs having the smallest number of edges in which message can be broadcast in minimum possible (= [log2n]) steps regardless of originator. Trees with the smallest possible broadcast time are exhibited for all n≤326, and for n sufficiently large existence of trees with broadcast time roughly 3/2 log2n is shown. It is also shown that broadcast time of a general tree can be computed in O(n) time.
Unable to display preview. Download preview PDF.
- Farley A.M., Minimum Broadcast Networks, Networks 9 (1979), 313–332.Google Scholar
- Farley A., Hedetniemi S.T., Broadcasting in Grid graphs, Congr. Numer. 21(1978), 275–288.Google Scholar
- Ko C.S., On a Conjecture Concerning Broadcasting in Grid Graphs, Preliminary Report, AMS Notices 1979, 196–197.Google Scholar
- Peck G.W., Optimal Spreading in an n-dimensional Rectilinear Grid, Stud. Appl. Math. 62(1980), 69–74.Google Scholar
- Proskurowski A., Minimum Broadcast Trees, IEEE Transactions on Computers 30 (1981), 363–366.Google Scholar
- Shastri A., “Time-relaxed Broadcasting in Communication Networks”, Discrete Applied Math., submitted.Google Scholar
- Shastri A., Broadcasting in General Networks II: Unicyclic graphs, in preparation.Google Scholar