The system will be going down for regular maintenance. Please save your work and logout.
Heterogenous dating service with application to rumor spreading
BEAUMONT, Olivier
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
DUCHON, Philippe
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
KORZENIOWSKI, Miroslaw
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
BEAUMONT, Olivier
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
DUCHON, Philippe
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
KORZENIOWSKI, Miroslaw
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
< Reduce
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Language
en
Communication dans un congrès
This item was published in
IEEE International Symposium on Parallel and Distributed Processing, 2008. IPDPS 2008., 2008-04-15, Miami, FL. 2008p. pp 1--10
IEEE
English Abstract
In this paper, we describe a fully decentralized algorithm, called "dating service" to organize communications into a fully heterogeneous network, that ensures that communication capabilities of the nodes are not exceeded. ...Read more >
In this paper, we describe a fully decentralized algorithm, called "dating service" to organize communications into a fully heterogeneous network, that ensures that communication capabilities of the nodes are not exceeded. We prove that with high probability, this service ensures that a constant fraction of all possible communications is organized. Interestingly enough, this property holds true even if a node is not able to choose another node uniformly at random. We also present, as an application of the dating service, an algorithm for rumor spreading that enables to broadcast a unit-size message to all the nodes of a P2P system in logarithmic number of steps with high probability.Read less <
English Keywords
randomized algorithms
distributed algorithms rumor spreading heterogeneous platforms
ANR Project
ALgorithmique des Plates-formes A Grande Echelle - ANR-05-MMSA-0006
Origin
Hal imported