No Access

Neighbourhood Gossiping in Hypercubes

Department of Electrical Engineering, Faculty of Engineering, Hiroshima University, Kagamiyama 1-4-1, Higashi-Hiroshima, 739, Japan

Research partially supported by the Ministry of Education, Science and Culture of Japan (Grant #08680372).

Search for more papers by this author

Stephane Perennes

INRIA - SLOOP, 2004 Route des Lucioles, B.P 93, F-06902 Sophia-Antipolis, France

Research supported by the European project MAP.

Search for more papers by this author

, and

Joseph G. Peters

School of Computing Science, Simon Fraser University, Burnaby, British Columbia, V5A 1S6, Canada

Research supported by NSERC of Canada and CNRS - France.

Search for more papers by this author

https://doi.org/10.1142/S0129626498000201Cited by:10 (Source: Crossref)

Abstract

In the neighbourhood gossiping problem, each node of a network starts with a unique message and must learn the messages of all of its neighbours. In this paper, we prove upper and lower bounds for neighbourhood gossiping in hypercubes under the single-port half-duplex and single-port full-duplex communication models.

Keywords: