Optimal sequential gossiping by short messages

Algorithms for Data Migration with Cloning

“…The problems of Gossiping and Broadcasting have been the subject of extensive study [18,12,14,3,4,15,7,8]. These play an important role in the design of communication protocols in various kinds of networks.…”

“…Hall et al [10] showed that with the assumption that each disk has one spare unit of storage, very good constant factor approximations can be developed. The algorithms use at most 4 ∆/4 colors with at most n/3 bypass nodes, or at most 6 ∆/4 colors without bypass nodes 3 . On the other hand, to handle high demand for popular objects, new copies will have to be dynamically created and stored on different disks.…”

Approximation Algorithms for Broadcasting and Gossiping

“…This yields a gossiping time of 2n − 2 steps. Also, Bermond et al have shown in [2] that, for any Hamiltonian graph G of n vertices, g (G) = n if n is odd, and g (G) = n − 1 if n is even. During the gossiping DW [C n ] on the even cycle, the first round consists of exchanging one packet, and, during the (n/2)−1 other rounds, two packets are exchanged at each round.…”

Algorithms for data migration with cloning

“…Hall et al [10] showed that with the assumption that each disk has one spare unit of storage, very good constant factor approximations can be developed. The algorithms use at most 4 ∆/4 colors with at most n/3 bypass nodes, or at most 6 ∆/4 colors without bypass nodes 3 .…”