• Aucun résultat trouvé

An Optimal Broadcast Algorithm for Content-Addressable Networks -- Extended Version

N/A
N/A
Protected

Academic year: 2021

Partager "An Optimal Broadcast Algorithm for Content-Addressable Networks -- Extended Version"

Copied!
20
0
0

Texte intégral

Loading

Figure

Figure 1: M-CAN - Message forwarding
Figure 2: Efficient broadcast in 2D
Figure 5: Average execution time and speed up from the naive broadcast
Figure 6: Average number of messages and optimal number of messages with 100 peers

Références

Documents relatifs

Second, as for topic B1 the highest level of agreement be- tween the assessor and the users is on the end points of the relevance scale: E3S3 (43%) and E0S0 (58%), although the

We next define a subclass of ‘good’ hierarchies that is sufficiently small to allow us to use the union bound (see Lemma 5.9), but sufficiently large so that every internally

We have analyzed the general structure of the scalar sector of logarithmic CFT underlying the critical point of the Potts model in arbitrary dimension, and a remarkable feature of

Based on this previous work, we have introduced two latent variables, one which synthesises an individual need for mobility (“individual” effect) and one which synthesises the

Consequently, the property of Edwards curves does not protect Pairing Based Cryptography in Edwards coordinates toward fault attack.. A discussion about weakness to this fault attack

(C–E) Charts showing the quantification of TUNEL-positive cells in the three cerebellar layers (mean ± SEM). An increase in the number of apoptotic cells can be observed from P22

La réflexion que nous venons de mener sur la protection et l’incitation industrielles en Afrique de l’Ouest, dont le champ d’investigation est le Niger (à travers

Soleil levant sur les Monts d’Aubrac , Immensité du baiser de la Terre et du Ciel , Parfums de fleurs entre les bois de mélèzes , Sur cette route de Saint Jacques de Compostelle