Gossiping in cayley graphs by packets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1120, Issue , 1996, Pages 301-315

  Bermond, Jean Claude ^a   Kodate, Takako ^a   Pérennes, Stéphane ^a  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS;

ALL-TO-ALL COMMUNICATION; CAYLEY GRAPHS; GOSSIPING PROTOCOLS; INFORMATION DIFFUSION; MINIMUM DEGREE; STORE AND FORWARD; SYMMETRIC DIGRAPHS; TOTAL EXCHANGE;

GRAPH DATABASES;

EID: 84947940848     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61576-8_91     Document Type: Conference Paper

References (14)

1. A. Bagchi, E.F. Schmeichel and S.L. Hakimi.: Parallel Information Dissemination by Packets. SIAM Journal of Computing, 23 (1994) 355-372
2. J.-C. Bermond, L.Gargano, A. Rescigno and U. Vaccaro.: Fast Gossiping by Short Messages. Proc. 22nd ICALP 95, Szeged, Hungary, Lecture Notes in Computer Science, Springer-Verlag, 944(1995) 135-146. An extended version should appear in: SIAM Journal of Computing.
3. D. P. Bertsekas and J. N. Tsitsildis.: Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Englewood Cliffs, N J, (1989)
4. J. de RUMEUR.: Communications dans les réseaux de processeurs. Masson Paris, (1994)
5. P. Fragopoulou.: Communication and Fault Tolerance Algorithms on a Class of Interconnection Networks. Ph.D. Thesis, Department of Computing and Information Science, Queen’s University, Kingston, ON, Canada, (1995)
6. P. Fragopoulou and S.G. Ald.: A Framework for Optimal Communication on a Subclass of the Cayley Glass Based Networks. Proc. 14th Annual IEEE International Phoenix Conference on Computers and Communications (IPCCC-95), Phoenix, AR, U.S.A. (1995) 241-248
7. P. Fragopoulou, S.G. Aid and H. Meijer.: Optimal Communication Primitives on the Generalized Hypercube Network. Journal of Parallel and Distributed Computing, 32(2) (1996) 173-187
8. P. Fraigniaud and E. Lazard.: Methods and Problems of Communication in Usual Networks. Discrete Applied Mathematics 53 (1994) 79-134
9. S.M. Hedetniemi, S.T. Hedetniemi and A.L. Liestman.: A Survey of Gossiping and Broadcasting in Communication Networks. NETWORKS, 18 (1988) 319-:]49
10. A. Hily and D. Sotteau.: Communications in Bus Networks. Parallel and Distributed Computing, Lectures Notes in Computer Science, Springer-Verlag, 805 (1994) 197-206
11. J. Hromkovič, R. Klasing, B. Monien and R. Peine.: Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping). To appear in: F. Hsu, D.-Z. Du (Eds.) Combinatorial Network Theory, Science Press & AMS
12. J.-C. König, P.S. Rao, and D. Trystram.: Analysis of Gossiping Algorithms in Torus with Restricted Bufferization. Capabilities. Technical Report IMAG Grenoble, (1994)
13. M. Mahéo and J.-F. Saclé.: Note on the Problem of Gossiping in Multidimensional ’ Grids. Discrete Applied Mathematicw 53 (1994) 287-290
14. N. Marlin.: Rapport de DEA (1996)