Gossip in trees under line-communication mode
This paper addresses the problem of performing efficiently an important operation of communication in networks, namely gossip. We study it in the line-communication model that is similar to the circuit-switching technique. We construct algorithms to gossip in any tree network and prove that they are optimal or asymptotically optimal. In all the cases, we show that the difference between lower and upper bounds is constant. In addition, these results give a general method to gossip, since any (connected) network has a spanning tree.
Unable to display preview. Download preview PDF.
- 1.A. Bondy, U. Murty, Graph theory with applications, Mac Millan Press LTD, 1981.Google Scholar
- 2.A. Farley, Minimum-time broadcast networks, Networks 10 (1980) 59–70.Google Scholar
- 4.S. Hedetniemi, S. Hedetniemi, A. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988) 319–349.Google Scholar
- 5.J. Hromkovic, R. Klasing, E. Stöhr, H. Wagener, Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs, Proc. First Annual European Symposium on Algorithms (ESA'93), LNCS 726, Springer Verlag (1993) 200–211.Google Scholar
- 6.J. Hromkovic, R. Klasing, W Unger, H. Wagener, Optimal algorithm for broadcast and gossip in the edge-disjoint path mode. Proc. 4th Scandinavian Workshop on Algorithm Theory (SWAT'94), LNCS 824, Springer-Verlag (1994) 219–230.Google Scholar
- 7.J. Kane, J. Peters, Line broadcasting in cycles, Technical repport number CMPT TR 94-11, School of computing science, Simon Fraser University, Burnaby, Canada.Google Scholar
- 9.C. Laforest, Broadcast and gossip in line-communication mode, Technical repport number 1005, LRI, Bât. 490, Université de Paris-Sud, 91405 Orsay Cedex France (1995).Google Scholar
- 10.J. de Rumeur, Communications dans les réseaux de processeurs. Edition Masson, Etudes et recherches en informatique (1994).Google Scholar