Afficher la notice abrégée

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.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorBONICHON, Nicolas
hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorEYRAUD-DUBOIS, Lionel
hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorUZNANSKI, P.
dc.contributor.editorIEEE
dc.date.accessioned2024-04-15T09:47:00Z
dc.date.available2024-04-15T09:47:00Z
dc.date.created2011
dc.date.issued2011-12
dc.date.conference2011-12
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198056
dc.description.abstractEnWe consider the classical problem of broadcasting a large message at an optimal rate in a large scale distributed network. The main novelty of our approach is that we consider that the set of participating nodes can be split into two parts: "green" nodes that stay in the open-Internet and "red" nodes that lie behind firewalls or NATs. Two red nodes cannot communicate directly, but rather need to use a green node as a gateway for transmitting a message. In this context, we are interested in both maximizing the throughput (\ie the rate at which nodes receive the message) and minimizing the degree at the participating nodes, \ie the number of TCP connections they must handle simultaneously. We both consider cyclic and acyclic solutions for the flow graph. In the cyclic case, our main contributions are a closed form formula for the optimal cyclic throughput and the proof that the optimal solution may require arbitrarily large degrees. In the acyclic case, we prove that it is possible to achieve the optimal throughput with low degree. Then, we prove a worst case ratio between the optimal acyclic and cyclic throughput and show through simulations that this ratio is on average very close to 1, which makes acyclic solutions efficient both in terms of the throughput and the number of connections.
dc.description.sponsorshipSimulation extrêmement extensible avec SimGrid - ANR-08-SEGI-0022
dc.language.isoen
dc.subject.enBroadcast
dc.subject.enScheduling
dc.subject.enResource Augmentation
dc.subject.enfirewall
dc.subject.enApproximation Algorithms
dc.subject.enCommunication modeling
dc.title.enBroadcasting on Large Scale Heterogeneous Platforms with connectivity artifacts under the Bounded Multi-Port Model
dc.typeCommunication dans un congrès
dc.subject.halInformatique [cs]/Calcul parallèle, distribué et partagé [cs.DC]
bordeaux.page173-180
bordeaux.volumeProceeding of ICPADS 2011
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleICPADS 2011 - 17th Internation Conference on Parallel and Distributed Systems
bordeaux.countryTW
bordeaux.conference.cityTaïnan
bordeaux.peerReviewedoui
hal.identifierinria-00618784
hal.version1
hal.invitednon
hal.proceedingsoui
hal.conference.organizerIEEE
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//inria-00618784v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2011-12&rft.volume=Proceeding%20of%20ICPADS%202011&rft.spage=173-180&rft.epage=173-180&rft.au=BEAUMONT,%20Olivier&BONICHON,%20Nicolas&EYRAUD-DUBOIS,%20Lionel&UZNANSKI,%20P.&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