Mostrar el registro sencillo del ítem

Fast Generation and Mixing of Random Graphs in Peer-to-Peer Networks

hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorBEAUMONT, Olivier
hal.structure.identifierInstitute of Mathematics and Computer Science [Wroclaw] [IMCS]
dc.contributor.authorDOJWA, Marcin
hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorDUCHON, Philippe
hal.structure.identifierInstitute for Computer Science
dc.contributor.authorELSÄSSER, Robert
hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorKLASING, Ralf
hal.structure.identifierInstitute of Mathematics and Computer Science
dc.contributor.authorKORZENIOWSKI, Miroslaw
dc.date.accessioned2024-04-15T09:46:51Z
dc.date.available2024-04-15T09:46:51Z
dc.date.created2011-10-01
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198045
dc.description.abstractEnIn this work we show how to quickly generate and rapidly mix uniform random graphs in a model where incoming and outgoing degrees of nodes are defined in advance. We show how to use a previous result on Dating Service working on top of any Distributed Hash Table so that a random graph is generated in logarithmic number of rounds and mixed so that two snapshots of the graph taken in logarithmic time distance are independent with high probability. We consider two models of graphs: directed graphs and undirected graphs where some nodes are behind firewalls. We consider a synchronized model of computation but show how to adapt it to a highly dynamic and asynchronous environment such as peer-to-peer networks.
dc.language.isoen
dc.subject.enpeer-to-peer
dc.subject.endistributed hash tables
dc.subject.enheterogeneous p2p
dc.subject.enrandom graph generation and mixing
dc.title.enFast Generation and Mixing of Random Graphs in Peer-to-Peer Networks
dc.typeDocument de travail - Pré-publication
dc.subject.halInformatique [cs]/Calcul parallèle, distribué et partagé [cs.DC]
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
hal.identifierinria-00628312
hal.version1
hal.audienceNon spécifiée
hal.origin.linkhttps://hal.archives-ouvertes.fr//inria-00628312v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.au=BEAUMONT,%20Olivier&DOJWA,%20Marcin&DUCHON,%20Philippe&ELS%C3%84SSER,%20Robert&KLASING,%20Ralf&rft.genre=preprint


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem