Skip to Main content Skip to Navigation
Conference papers

An Optimal Broadcast Algorithm for Content-Addressable Networks

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 dupli- cated 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 al- gorithm achieves those two goals in the context of CAN. In this sense, the contribution we propose in this paper is threefold. First, we pro- vide 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 [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-00916301
Contributor : Justine Rochas <>
Submitted on : Tuesday, December 10, 2013 - 9:22:47 AM
Last modification on : Wednesday, October 14, 2020 - 4:23:55 AM
Long-term archiving on: : Friday, March 14, 2014 - 9:51:47 AM

File

AnOptimalBroadcastAlgorithmFor...
Files produced by the author(s)

Identifiers

Collections

Citation

Ludovic Henrio, Fabrice Huet, Justine Rochas. An Optimal Broadcast Algorithm for Content-Addressable Networks. OPODIS 2013 - International Conference on Principles of DIstributed Systems, Inria, Dec 2013, Nice, France. pp.176-190, ⟨10.1007/978-3-319-03850-6_13⟩. ⟨hal-00916301⟩

Share

Metrics

Record views

503

Files downloads

380