Set to set broadcasting in communication networks
Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Staggered striping in multimedia information systems
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Optimal sequential gossiping by short messages
Discrete Applied Mathematics
Approximation algorithms for data placement on parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On algorithms for efficient data migration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Concurrent Multicast in Weighted Networks
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
Fast Gossiping by Short Messages
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Algorithms for Data Migration with Cloning
SIAM Journal on Computing
Graph Theory With Applications
Graph Theory With Applications
| Hi-index | 0.00 |
The problems of gossiping and broadcasting have been widely studied. The basic gossip problem is defined as follows: there are n individuals, with each individual having an item of gossip. The goal is to communicate each item of gossip to every other individual. Communication typically proceeds in rounds, with the objective of minimizing the number of rounds. One popular model, called the telephone call model, allows for communication to take place on any chosen matching between the individuals in each round. Each individual may send (receive) a single item of gossip in a round to (from) another individual. In the broadcasting problem, one individual wishes to broadcast an item of gossip to everyone else. In this paper, we study generalizations of gossiping and broadcasting. The basic extensions are: (a) each item of gossip needs to be broadcast to a specified subset of individuals and (b) several items of gossip may be known to a single individual. We study several problems in this framework that generalize gossiping and broadcasting. Our study of these generalizations was motivated by the problem of managing data on storage devices, typically a set of parallel disks. For initial data distribution, or for creating an initial data layout we may need to distribute data from a single server or from a collection of sources.