In this paper, we introduce a new information dissemination problem in which gossiping is to occur continuously but with restricted use of the network. In this problem, information continues to be generated by each member of the network and, thus, the gossip process must be ongoing. However, in order to allow the network to be used for other purposes, the communications used by the gossip process are limited to k calls per time unit. We present some preliminary results on this new problem.
CITATION STYLE
Liestman, A. L., & Richards, D. (1993). An introduction to perpetual gossiping. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 762 LNCS, pp. 259–266). Springer Verlag. https://doi.org/10.1007/3-540-57568-5_256
Mendeley helps you to discover research relevant for your work.