Optimal group gossiping in hypercubes under wormhole routing model

Abstract

This paper introduces a new gossiping problem of exchanging tokens among specified nodes. We call this problem the group gossiping problem. The group gossiping problem is a generalization of the usual gossiping problem, which has been investigated extensively during the last decade. In this paper, we consider the gossiping problem in n-cubes under the wormhole routing model, which is a model of the communication by the wormhole switching. We propose an asymptotically optimal group gossiping algorithm for n-cubes under the model.