Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Maxime Monod"'
Publikováno v:
[Research Report] RR-9039, Inria Rennes Bretagne Atlantique; RR-9039. 2017
HAL
HAL
Video streaming has become a killer application for peer-to-peer technologies. By aggregating scarce resources such as upload bandwidth, decentralized video streaming protocols make it possible to serve a video stream to huge numbers of users while r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f664675dd143016e3e2e05870b2dd62c
https://inria.hal.science/hal-01479885/file/RR-9039.pdf
https://inria.hal.science/hal-01479885/file/RR-9039.pdf
Publikováno v:
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing, 2012, 72 (1), pp.13-26. ⟨10.1016/j.jpdc.2011.09.003⟩
Journal of Parallel and Distributed Computing, Elsevier, 2012, 72 (1), pp.13-26. ⟨10.1016/j.jpdc.2011.09.003⟩
Journal of Parallel and Distributed Computing, 2012, 72 (1), pp.13-26. ⟨10.1016/j.jpdc.2011.09.003⟩
Journal of Parallel and Distributed Computing, Elsevier, 2012, 72 (1), pp.13-26. ⟨10.1016/j.jpdc.2011.09.003⟩
International audience; We consider the polling problem in a social network: participants express support for a given option and expect an outcome reflecting the opinion of the majority. Individuals in a social network care about their reputation: th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::64ef007571ee915fa64d83cc2079de00
https://hal.inria.fr/inria-00629455/document
https://hal.inria.fr/inria-00629455/document
Publikováno v:
P2P 2010
P2P 2010, Aug 2010, Delft, Netherlands
HAL
Peer-to-Peer Computing
P2P 2010, Aug 2010, Delft, Netherlands
HAL
Peer-to-Peer Computing
International audience; Gossip protocols are considered very effective to disseminate information in a large scale dynamic distributed system. Their inherent simplicity makes them easy to implement and deploy. However, whereas their probabilistic gua
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c61f0a7696a8c2e85789cda659d3511f
https://hal.inria.fr/inria-00517384
https://hal.inria.fr/inria-00517384
Autor:
Guerraoui, Rachid, Huguenin, Kévin, Kermarrec, Anne-Marie, Maxime Monod, Maxime, Prusty, Swagatika
Publikováno v:
[Research Report] RR-6913, INRIA. 2010, pp.21
11th ACM/IFIP/USENIX International Middleware Conference (MIDDLEWARE)
11th ACM/IFIP/USENIX International Middleware Conference (MIDDLEWARE), Nov 2010, Bangalore, India. ⟨10.1007/978-3-642-16955-7_16⟩
11th ACM/IFIP/USENIX International Middleware Conference (MIDDLEWARE)
11th ACM/IFIP/USENIX International Middleware Conference (MIDDLEWARE), Nov 2010, Bangalore, India. ⟨10.1007/978-3-642-16955-7_16⟩
International audience; This paper presents LiFTinG, the first protocol to detect freeriders, including colluding ones, in gossip-based content dissemination systems with asymmetric data exchanges. LiFTinG relies on nodes tracking abnormal behaviors
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e20f52387135684c7d38aaa3368b76e3
https://hal.inria.fr/inria-00379408v2/document
https://hal.inria.fr/inria-00379408v2/document
Publikováno v:
23rd International Symposium on Distributed Computing (DISC)
23rd International Symposium on Distributed Computing (DISC), Sep 2009, Elche, Spain. ⟨10.1007/978-3-642-04355-0_25⟩
Lecture Notes in Computer Science ISBN: 9783642043543
DISC
23rd International Symposium on Distributed Computing (DISC), Sep 2009, Elche, Spain. ⟨10.1007/978-3-642-04355-0_25⟩
Lecture Notes in Computer Science ISBN: 9783642043543
DISC
Social networks are growing exponentially, and one of the most celebrated examples, Facebook, currently boasts more than 250 million users. A particularly important task in such networks is polling, such as the recent one about the terms of service o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c07cdf0ca05bb8c25c422d83b3f48530
https://hal.inria.fr/inria-00429676
https://hal.inria.fr/inria-00429676
Publikováno v:
Peer-to-Peer Computing
Peer-to-peer content dissemination applications suffer immensely from freeriders, i.e., nodes that do not provide their fair share. The Tit-for-Tat (TfT) incentives have received much attention as they help make such systems more robust against freer
Publikováno v:
DSN
DSN 2009
DSN 2009, Jun 2009, Estoril, Portugal
HAL
DSN 2009
DSN 2009, Jun 2009, Estoril, Portugal
HAL
International audience; Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. They are also considered highly flexible, namely tunable at will to increase their robustness and adap
Publikováno v:
[Research Report] RR-6890, INRIA. 2009, pp.16
Lecture Notes in Computer Science
13th International Conference On Principles Of Distributed Systems (OPODIS)
13th International Conference On Principles Of Distributed Systems (OPODIS), Dec 2009, Nimes, France. ⟨10.1007/978-3-642-10877-8_13⟩
Lecture Notes in Computer Science ISBN: 9783642108761
OPODIS
Lecture Notes in Computer Science
13th International Conference On Principles Of Distributed Systems (OPODIS)
13th International Conference On Principles Of Distributed Systems (OPODIS), Dec 2009, Nimes, France. ⟨10.1007/978-3-642-10877-8_13⟩
Lecture Notes in Computer Science ISBN: 9783642108761
OPODIS
We consider the polling problem in a social network where respectable participants do care about their reputation: they do not want their vote to be disclosed nor their misbehaving, if any, to be publicly exposed. Assuming this reputation concern, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd70fc4c22f51cd5cf7b998248e94b1a
https://inria.hal.science/inria-00371708
https://inria.hal.science/inria-00371708
Publikováno v:
Large-Scale Distributed Systems and Middleware
Large-Scale Distributed Systems and Middleware, Sep 2008, IBM TJ Watson Research Lab in Yorktown, New York., United States
HAL
Large-Scale Distributed Systems and Middleware, Sep 2008, IBM TJ Watson Research Lab in Yorktown, New York., United States
HAL
International audience; Gossip-based protocols are now acknowledged as a sound basis to implement collaborative high-bandwidth content dissemination: content location is disseminated through gossip, the actual contents being subsequently pulled. Desp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::225997813ea5f1a028ccdeac05d4b9ed
https://hal.inria.fr/inria-00337056/file/ladis.pdf
https://hal.inria.fr/inria-00337056/file/ladis.pdf
Autor:
Davide Frey, Rachid Guerraoui, Anne-Marie Kermarrec, Martin Mogensen, Maxime Monod, Vivien Quéma
Publikováno v:
[Research Report] 2008
HAL
Mogensen, M, Frey, D, Guerraoui, R, Kermarrec, A-M, Monod, M & Quema, V 2008, Gossiping Capabilities . vol. Technical Report LPD-REPORT-2008-010, École Polytechnique Fédérale de Lausanne, infoscience@epfl.ch; HAL-CCSD .
HAL
Mogensen, M, Frey, D, Guerraoui, R, Kermarrec, A-M, Monod, M & Quema, V 2008, Gossiping Capabilities . vol. Technical Report LPD-REPORT-2008-010, École Polytechnique Fédérale de Lausanne, infoscience@epfl.ch; HAL-CCSD .
Gossip-based protocols are now acknowledged as a sound basis to implement collaborative high-bandwidth content dissemination: content location is disseminated through gossip, the actual contents being subsequently pulled. In this paper, we present HE
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ee1ce113908e18305cece2eec04ae639
https://inria.hal.science/inria-00339118
https://inria.hal.science/inria-00339118