An Optimal Broadcast Algorithm for Content-Addressable Networks -- Extended Version - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2013

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


Structured peer-to-peer networks are powerful underlying structures for communication and storage systems in large-scale setting. In the context of the Content-Addressable Network (CAN), this paper addresses the following challenge: how to perform an efficient broadcast while the local view of the network is restricted to a set of neighbours? In existing approaches, either the broadcast is inefficient (there are duplicated messages) or it requires to maintain a particular structure among neighbours, e.g. a spanning tree. We define a new broadcast primitive for CAN that sends a minimum number of messages while covering the whole network, without any global knowledge. Currently, no other algorithm achieves those two goals in the context of CAN. In this sense, the contribution we propose in this paper is threefold. First, we provide an algorithm that sends exactly one message per recipient without building a global view of the network. Second, we prove the absence of duplicated messages and the coverage of the whole network when using this algorithm. Finally, we show the practical benefits of the algorithm throughout experiments.
Ce document présente un nouvel algorithme de broadcast pour réseaux pair-à-pair de type CAN. Cet algorithme de broadcast est optimal dans le sens où tous les pairs ne reçoivent le message qu'une seule fois, sans connaissances globales. Après avoir introduit les étapes fondamentales de cet algorithme, ses principales propriétés sont exposées et prouvées. Des expériences à taille réelle montrent la validité de cet algorithme et ses bénéfices.
Fichier principal
Vignette du fichier
RR-8375.pdf (957.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00866228 , version 1 (26-09-2013)
hal-00866228 , version 2 (08-10-2013)


  • HAL Id : hal-00866228 , version 2


Ludovic Henrio, Fabrice Huet, Justine Rochas. An Optimal Broadcast Algorithm for Content-Addressable Networks -- Extended Version. [Research Report] RR-8375, INRIA. 2013. ⟨hal-00866228v2⟩
369 View
227 Download


Gmail Facebook Twitter LinkedIn More