Optimal Sequential Gossiping by Short Messages - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 1998

Optimal Sequential Gossiping by Short Messages

Résumé

Gossiping is the process of information di ffusion in which each node of a network holds a block that must be communicated to all the other nodes in the network. We consider the problem of gossiping in communication networks under the restriction that communicating nodes can exchange up to a fixed number p of blocks during each call. We study the minimum numbers of call necessary to perform gossiping among n processor for any arbitrary fixed upper bound on the message size p.
Fichier principal
Vignette du fichier
117-BGP98-gossipingshortmessages.pdf (207.79 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03762654 , version 1 (28-08-2022)

Identifiants

  • HAL Id : hal-03762654 , version 1

Citer

Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennes. Optimal Sequential Gossiping by Short Messages. Discrete Applied Mathematics, 1998, 86, pp.145-155. ⟨hal-03762654⟩
8 Consultations
12 Téléchargements

Partager

Gmail Facebook X LinkedIn More