Publications de Maxime Monod | EPFL Graph Search

Tracking freeriders in gossip-based content dissemination systems

Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod, Kévin Clément Huguenin

Gossip-based protocols have proven very efficient for disseminating high-bandwidth content such as video streams in a peer-to-peer fashion. However, for the protocols to work, nodes are required to collaborate by devoting a fraction of their upload bandwid ...

Elsevier2014

Decentralized polling with respectable participants

Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod, Kévin Clément Huguenin

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: they do not want their vote to b ...

Elsevier2012

Live Streaming with Gossip

Maxime Monod

Peer-to-peer (P2P) architectures have emerged as a popular paradigm to support the dynamic and scalable nature of distributed systems. This is particularly relevant today, given the tremendous increase in the intensity of information exchanged over the Int ...

EPFL2010

Boosting Gossip for Live Streaming

Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod, Davide Frey

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 guarantees are often enough to di ...

2010

Heterogeneous Gossip

Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod, Davide Frey

Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. Load-balancing is inherent in these protocols as the dissemination work is evenly spread among all nodes. Yet, large-scale distribut ...

Springer2009

Brief Announcement: Towards Secured Distributed Polling in Social Networks

Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod, Kévin Clément Huguenin

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

Decentralized Polling with Respectable Participants

Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod, Kévin Clément Huguenin

We consider the polling problem in a social network where participants 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 show that a simple s ...

2009

Stretching Gossip with Live Streaming

Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod, Davide Frey

Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. They are also considered highly ﬂexible, namely tunable at will to increase their robustness and adapt to churn. So far however, the ...

2009

On Tracking Freeriders in Gossip Protocols

Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod, Kévin Clément Huguenin

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 freeriding. ...

2009

Pervasive Computing with Frugal Objects

Rachid Guerraoui, Maxime Monod, Benoît Garbinato, Jesper Honig Spring

This paper presents a computing model for resource-limited mobile devices that might be ubiquitously deployed in private and business environments. The model integrates a strongly-typed event-based communication paradigm with abstractions for frugal contro ...

2007