Broadcast and gossip in line-communication mode

Discrete Applied Mathematics

Volumn 80, Issue 2-3, 1997, Pages 161-176

  Laforest, C ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

Broadcast; Gossip; Line communication; Tree

Indexed keywords

EID: 30244544990     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00054-1     Document Type: Article

References (11)

1. D.P. Bertsekas, C. Özveren, G.D. Stamoulis, P. Tseng, J.N. Tsitsiklis, Optimal communication algorithms for hypercubes, J. Parallel and Distributed Comput. 11 (1991) 263-275.
2. A. Bondy, U. Murty, Graph Theory with Applications, Macmillan, New York, 1981.
3. A. Farley, Minimum-time broadcast networks, Networks 10 (1980) 59-70.
4. P. Fraigniaud, Broadcasting in trees, Technical Report Number 95-26, Laboratoire de l'informatique du parallélisme, Ecole normale supérieure de Lyon, France, October 1995 (revised September 1996).
5. P. Fraigniaud, E. Lazard, Methods and problems of communication in usual networks, Discrete Appl. Math. 53 (1994) 79-133.
6. S. Hedetniemi, S. Hedetniemi, A. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988) 319-349.
7. J. Hromkovič, R. Klasing, E. Stöhr, H. Wagener, Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs, Proceedings of First Annual European Symposium on Algorithms (ESA'93), Lecture Notes in Comput. Sci., 726, Springer, 1993, pp. 200-211.
8. J. Hromkovič, R. Klasing, W. Unger, H. Wagener, Optimal algorithm for broadcast and gossip in the edge-disjoint path mode, Proceedings of 4th Scandinavian Workshop on Algorithm Theory (SWAT'94), Lecture Notes in Comput. Sci., 824, Springer, 1994, pp. 219-230.
9. J. Kane, J. Peters, Line broadcasting in cycles, Technical report number CMPT TR 94-11, School of computing science, Simon Fraser University, Burnaby, Canada, 1994.
10. W. Knödel, New gossips and telephones, Discrete Math. 13 (1975) 95.
11. C. Laforest, Gossip in trees under line-communication mode, Euro-Par'96, Lecture Notes in Comput. Sci., 1123, Springer, Berlin, 1996, pp. 333-340.