Improved bounds for gossiping in mesh bus networks

International audienceImproved bounds for the minimum gossiping time in mesh bus networks of arbitrary dimension for 1-port model are given. More precisely, the gossiping protocol consists of steps during which messages are sent via buses and at the end of the protocol, all the nodes should know all the information. Furthermore, during one step a bus can carry at most one message, and each node can either send or receive (not both) on at most one bus The minimum gossiping time of a bus network G is the minimum number of steps required to perform a gossip under this model. Here we determine almost exactly the minimum gossip time for 2-dimensional mesh bus networks and give tight bounds for d-dimensional mesh bus networks