Afficher la notice abrégée

hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
dc.contributor.authorBEAUMONT, Olivier
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
dc.contributor.authorDUCHON, Philippe
hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
dc.contributor.authorKORZENIOWSKI, Miroslaw
dc.date.accessioned2024-04-15T09:56:44Z
dc.date.available2024-04-15T09:56:44Z
dc.date.issued2008
dc.date.conference2008-04-15
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198862
dc.description.abstractEnIn 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.
dc.description.sponsorshipALgorithmique des Plates-formes A Grande Echelle - ANR-05-MMSA-0006
dc.language.isoen
dc.publisherIEEE
dc.subject.enrandomized algorithms
dc.subject.endistributed algorithms rumor spreading heterogeneous platforms
dc.title.enHeterogenous dating service with application to rumor spreading
dc.typeCommunication dans un congrès
dc.identifier.doi10.1109/IPDPS.2008.4536294
dc.subject.halInformatique [cs]/Calcul parallèle, distribué et partagé [cs.DC]
dc.subject.halInformatique [cs]/Algorithme et structure de données [cs.DS]
bordeaux.pagepp 1--10
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleIEEE International Symposium on Parallel and Distributed Processing, 2008. IPDPS 2008.
bordeaux.countryUS
bordeaux.conference.cityMiami, FL
bordeaux.peerReviewedoui
bordeaux.type.reportrr
hal.identifierinria-00142778
hal.version1
hal.invitednon
hal.proceedingsoui
hal.conference.organizerIEEE
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//inria-00142778v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2008&rft.spage=pp%201--10&rft.epage=pp%201--10&rft.au=BEAUMONT,%20Olivier&DUCHON,%20Philippe&KORZENIOWSKI,%20Miroslaw&rft.genre=unknown


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée