M. Cosnard and A. Ferreira, ON THE REAL POWER OF LOOSELY COUPLED PARALLEL ARCHITECTURES, Parallel Processing Letters, vol.01, issue.02, pp.103-111, 1991.
DOI : 10.1142/S0129626491000057

S. Even and B. Monien, On the number of rounds necessary to disseminate information, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures , SPAA '89, pp.318-327, 1989.
DOI : 10.1145/72935.72969

P. Fraigniaud and E. Lazard, Methods and problems of communication in usual networks, Discrete Applied Mathematics, vol.53, issue.1-3, pp.79-133, 1994.
DOI : 10.1016/0166-218X(94)90180-5

G. Fertin and A. Raspaud, k-neighborhood broadcasting, Proc. International Colloquium on Structural Information and Communication Complexity Vall de Núria Proceedings in Informatics 11, pp.133-146, 2001.

G. Fertin and A. Raspaud, Neighborhood Communications in Networks, Proc. Euroconference on Combinatorics, Graph Theory and Applications (COMB01), 2001.
DOI : 10.1016/S1571-0653(04)00371-3

M. Flammini and S. Pérennes, On the Optimality of General Lower Bounds for Broadcasting and Gossiping, SIAM Journal on Discrete Mathematics, vol.14, issue.2, pp.267-282, 2001.
DOI : 10.1137/S0895480199365397

M. Flammini and S. Pérennes, Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols, SIAM Journal on Discrete Mathematics, vol.17, issue.4, pp.521-540, 2004.
DOI : 10.1137/S0895480101386450
URL : https://hal.archives-ouvertes.fr/inria-00073066

S. Fujita, Neighbourhood information dissemination in the star graph, IEEE Transactions on Computers, vol.49, issue.12, pp.1366-1370, 2000.
DOI : 10.1109/12.895865

S. Fujita, Time-efficient multicast to local vertices in star interconnection networks under the single-port model, IEICE Transactions on Information and Systems E87, pp.315-321, 2004.

S. Fujita, Optimal Neighborhood Broadcast in Star Graphs, Journal of Interconnection Networks, vol.04, issue.04, pp.419-428, 2003.
DOI : 10.1142/S0219265903000957

S. Fujita, S. Pérennes, and J. G. Peters, Neighbourhood Gossiping in Hypercubes, Parallel Processing Letters, vol.08, issue.02, pp.189-195, 1998.
DOI : 10.1142/S0129626498000201

S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks, vol.3, issue.4, pp.319-349, 1986.
DOI : 10.1002/net.3230180406

D. D. Kouvatsos and I. M. Mkwawa, Neighbourhood broadcasting schemes for Cayley graphs with background traffic, Proc. 4 th EPSRC/BCS PG Symposium on the Convergence of Telecommunications, Networking and Broadcasting (PG Net 2003, pp.143-148, 2003.

D. W. Krumme, Fast Gossiping for the Hypercube, SIAM Journal on Computing, vol.21, issue.2, pp.365-380, 1992.
DOI : 10.1137/0221026

D. W. Krumme, G. Cybenko, and K. N. Venkataraman, Gossiping in Minimal Time, SIAM Journal on Computing, vol.21, issue.1, pp.111-139, 1992.
DOI : 10.1137/0221010

I. M. Mkwawa and D. D. Kouvatsos, AN OPTIMAL NEIGHBOURHOOD BROADCASTING SCHEME FOR STAR INTERCONNECTION NETWORKS, Journal of Interconnection Networks, vol.04, issue.01, pp.103-112, 2003.
DOI : 10.1142/S0219265903000751

K. Qiu and S. K. Das, A novel neighbourhood broadcasting algorithm on star graphs, Proc. 9 th International Conference on Parallel and Distributed Systems (ICPADS'02), pp.37-41, 2002.