Skip to Main content Skip to Navigation
Reports

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

Ludovic Henrio 1 Fabrice Huet 1 Justine Rochas 1
1 OASIS - Active objects, semantics, Internet and security
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : 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.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-00866228
Contributor : Justine Rochas <>
Submitted on : Tuesday, October 8, 2013 - 2:46:26 PM
Last modification on : Wednesday, October 14, 2020 - 4:24:00 AM
Long-term archiving on: : Friday, April 7, 2017 - 8:30:52 AM

File

RR-8375.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00866228, version 2

Citation

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

Share

Metrics

Record views

654

Files downloads

449