Neighbourhood Gossiping in Hypercubes
Satoshi Fujita, Stéphane Pérennès, Joseph G. Peters · Parallel Processing Letters · 1998
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.