On tracking freeriders in gossip protocols

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

doi:10.1109/p2p.2009.5284543

Cited by 8 publications

(5 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Likewise, the very fact that nodes advertise their capabilities may trigger freeriding vocations, where nodes would pretend to be poor in order not to contribute to the dissemination. We are working towards a freerider-tracking protocol for gossip in order to detect and punish freeriding behaviors [11].…”

Section: Discussionmentioning

confidence: 99%

Heterogeneous Gossip

et al. 2009

Self Cite

View full text Add to dashboard Cite

Abstract. Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. Loadbalancing is inherent in these protocols as the dissemination work is evenly spread among all nodes. Yet, large-scale distributed systems are usually heterogeneous with respect to network capabilities such as bandwidth. In practice, a blind load-balancing strategy might significantly hamper the performance of the gossip dissemination.This paper presents HEAP, HEterogeneity-Aware gossip Protocol, where nodes dynamically adapt their contribution to the gossip dissemination according to their bandwidth capabilities. Using a continuous, itself gossip-based, approximation of relative bandwidth capabilities, HEAP dynamically leverages the most capable nodes by increasing their fanout, while decreasing by the same proportion that of less capable nodes. HEAP preserves the simple and proactive (churn adaptation) nature of gossip, while significantly improving its effectiveness. We extensively evaluate HEAP in the context of a video streaming application on a testbed of 270 PlanetLab nodes. Our results show that HEAP significantly improves the quality of the streaming over standard homogeneous gossip protocols, especially when the stream rate is close to the average available bandwidth.

show abstract

Section: Discussionmentioning

confidence: 99%

Heterogeneous Gossip

et al. 2009

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, gossip++ cannot do anything in the case of scarce bandwidth, i.e., when the stream rate is very close to the outgoing bandwidth capability. We therefore recognize the need for detecting freeriders as in [17], [36], [37] and plan to complement gossip++ with a lightweight mechanism to detect and expel freeriders.…”

Section: B Hostile Nodesmentioning

confidence: 99%

Boosting Gossip for Live Streaming

Frey

Guerraoui

Kermarrec

et al. 2010

2010 IEEE Tenth International Conference on Peer-to-Peer Computing (P2P)

View full text Add to dashboard Cite

Abstract-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 disseminate data in the context of lowbandwidth applications, they typically do not suffice for highbandwidth content dissemination: missing 1% is unacceptable for live streaming.In this paper, we show how the combination of two simple mechanisms copes with this seemingly inherent deficiency of gossip: (i) codec, an erasure coding scheme, and (ii) claim 2°, a content-request scheme that leverages gossip duplication to diversify the retransmission sources of missing information. We show how these mechanisms can effectively complement each other in a new gossip protocol, gossip++, which retains the simplicity of deployment of plain gossip. In a realistic setting with an average bandwidth capability (800 kbps) close to the stream rate (680 kbps) and 1% message loss, plain gossip can provide at most 99% of the stream. Using gossip++, on the other hand, all nodes can view a perfectly clear stream.

show abstract

“…In peer-to-peer file sharing networks, for example, it is required that (at least a proportion of) peers provide files in response to the requests of others, while in wireless sensor networks nodes must share information with others for the system to determine global properties of the environment. However, there is typically a temptation in such settings for individuals to deviate from the desired behaviour, which is known as the free rider problem [24,29,60]. For example, to save bandwidth, peers may choose not to provide files, and to conserve energy, the nodes in a sensor network may choose not to share information.…”

Section: Introductionmentioning

confidence: 99%

Establishing norms with metanorms in distributed computational systems

et al. 2015

View full text Add to dashboard Cite

Norms provide a valuable mechanism for establishing coherent cooperative behaviour in decentralised systems in which there is no central authority. One of the most influential formulations of norm emergence was proposed by Axelrod [2]. This paper provides an empirical analysis of aspects of Axelrod's approach, by exploring some of the key assumptions made in previous evaluations of the model. We explore the dynamics of norm emergence and the occurrence of norm collapse when applying the model over extended durations. It is this phenomenon of norm collapse that can motivate the emergence of a central authority to enforce laws and so preserve the norms, rather than relying on individuals to punish defection. Our findings identify characteristics that significantly influence norm establishment using Axelrod's formulation, but are likely to be of importance for norm establishment more generally. Moreover, Axelrod's model suffers from significant limitations in assuming that private strategies of individuals are available to others, and that agents are omniscient in being aware of all norm violations and punishments. Because this is an unreasonable expectation, the approach does not lend itself to modelling real-world systems such as online networks or electronic markets. In response, the paper proposes alternatives to Axelrod's model, by replacing the evolutionary approach, enabling agents to learn, and by restricting the metapunishment of agents to cases where the original defection is observed, in order to be able to apply the model to real-world domains. This work

show abstract

On tracking freeriders in gossip protocols

Abstract: Abstract

Cited by 8 publications

References 11 publications

Heterogeneous Gossip

Heterogeneous Gossip

Boosting Gossip for Live Streaming

Establishing norms with metanorms in distributed computational systems

Contact Info

Product

Resources

About