Shi-Heng Zhang

Learn More
ÐGossiping is the communication problem in which each node has a unique message (token) to be transmitted to every other node. The nodes exchange their tokens by packets. A solution to the problem is judged by how many rounds of packet sending it requires. In this paper, we consider the version of the problem in which small-size packets (each carrying(More)
In the gossiping problem, each node in a network possesses a token initiallyy after gossiping, every node has a copy o f e v ery other node's token. The nodes exchange their tokens by p a c kets. A solution to the problem is judged by h o w many rounds of packet sending it requires. In this paper, we consider the version of the problem in which a p a c ket(More)
  • 1