Abstract
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.
Full paper is available at http://www.cs.umd.edu/projects/smart/papers/multicast.pdf. This research was supported by NSF Awards CCR-9820965 and CCR-0113192.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anderson, E., Hall, J., Hartline, J., Hobbes, M., Karlin, A., Saia, J., Swaminathan, R., Wilkes, J.: An Experimental Study of Data Migration Algorithms. In: Workshop on Algorithm Engineering (2001)
Baker, B., Shostak, R.: Gossips and Telephones. Discrete Mathematics 2, 191–193 (1972)
Bermond, J., Gargano, L., Perennes, S.: Optimal Sequential Gossiping by Short Messages. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, vol. 86 (1998)
Bermond, J., Gargano, L., Rescigno, A.A., Vaccaro, U.: Fast gossiping by short messages. In: International Colloquium on Automata, Languages and Programming (1995)
Berson, S., Ghandeharizadeh, S., Muntz, R.R., Ju, X.: Staggered Striping in Multimedia Information Systems. In: SIGMOD (1994)
Bondy, J.A., Murty, U.S.R.: Graph Theory with applications. American Elsevier, New York (1977)
Bumby, R.T.: A Problem with Telephones. SIAM Journal on Algebraic and Discrete Methods 2(1), 13–18 (1981)
Cockayne, E.J., Thomason, A.G.: Optimal Multi-message Broadcasting in Complete Graphs. Utilitas Mathematica 18, 181–199 (1980)
De Marco, G., Gargano, L., Vaccaro, U.: Concurrent Multicast in Weighted Networks. In: SWAT, pp. 193–204 (1998)
Farley, M.: Broadcast Time in Communication Networks. SIAM Journal on Applied Mathematics 39(2), 385–390 (1980)
Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Discrete Applied Mathematics 53, 79–133 (1994)
Golubchik, L., Khanna, S., Khuller, S., Thurimella, R., Zhu, A.: Approximation Algorithms for Data Placement on Parallel Disks. In: Proc. of ACM-SIAM SODA (2000)
Hall, J., Hartline, J., Karlin, A., Saia, J., Wilkes, J.: On Algorithms for Efficient Data Migration. In: Proc. of ACM-SIAM SODA, pp. 620–629 (2001)
Hajnal, A., Milner, E.C., Szemeredi, E.: A Cure for the Telephone Disease. Canadian Mathematical Bulletin 15(3), 447–450 (1972)
Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.: A Survey of Gossiping and Broadcasting in Communication Networks. Networks 18, 129–134 (1988)
Holyer, I.: The NP-Completeness of Edge-Coloring. SIAM J. on Computing 10(4), 718–720 (1981)
Hromkovic, J., Klasing, R., Monien, B., Peine, R.: Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping). In: Du, D.-Z., Hsu, D.F. (eds.) Combinatorial Network Theory, pp. 125–212. Kluwer Academic Publishers, Netherlands (1996)
Hurkens, C.A.J.: Spreading Gossip Efficiently. Nieuw Archief voor Wiskunde 5(1), 208–210 (2000)
Kashyap, S., Khuller, S.: Algorithms for Non-Uniform Size Data Placement on Parallel Disks (2003) (manuscript)
Khuller, S., Kim, Y.A., Wan, Y.C.: Algorithms for Data Migration with Cloning. In: ACM Symp. on Principles of Database Systems (2003)
Knodel, W.: New gossips and telephones. Discrete Mathematics 13, 95 (1975)
Lee, H.M., Chang, G.J.: Set to Set Broadcasting in Communication Networks. Discrete Applied Mathematics 40, 411–421 (1992)
Liben-Nowell, D.: Gossip is Synteny: Incomplete Gossip and an Exact Algorithm for Syntenic Distance. In: Proc. of ACM-SIAM SODA, pp. 177–185 (2001)
Papadimitriou, C.H.: Computational complexity. Addison-Wesley, Reading (1994)
Richards, D., Liestman, A.L.: Generalizations of Broadcasting and Gossiping. Networks 18, 125–138 (1988)
Shachnai, H., Tamir, T.: On two class-constrained versions of the multiple knapsack problem. Algorithmica 29, 442–467 (2001)
Shachnai, H., Tamir, T.: Polynomial time approximation schemes for classconstrained packing problems. In: Proc. of Workshop on Approximation Algorithms (2000)
Shannon, C.E.: A theorem on colouring lines of a network. J. Math. Phys. 28, 148–151 (1949)
Stonebraker, M.: A Case for Shared Nothing. Database Engineering 9(1) (1986)
Tijdeman, R.: On a Telephone Problem. Nieuw Archief voor Wiskunde 19(3), 188–192 (1971)
Vizing, V.G.: On an estimate of the chromatic class of a p-graph (Russian). Diskret. Analiz. 3, 25–30 (1964)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khuller, S., Kim, YA., Wan, YC.(. (2003). On Generalized Gossiping and Broadcasting. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive