DocumentCode
1831549
Title
On tracking freeriders in gossip protocols
Author
Guerraoui, R. ; Huguenin, K. ; Kermarrec, A.-M. ; Monod, M.
Author_Institution
EPFL, Lausanne, Switzerland
fYear
2009
fDate
9-11 Sept. 2009
Firstpage
139
Lastpage
142
Abstract
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. However, these rely on an asymmetric component, namely opportunistic pushes, that let peers receive content without sending anything in return. Opportunistic push constitutes the Achilles´ heel of TfT-based protocols as illustrated by the fact that all known attacks against them exploit it. This problem becomes even more serious when used by colluding freeriders. In this paper, we discuss the possibility of using accountability to secure gossip-based dissemination protocols based on asymmetric exchanges. The fact that gossip protocols are dynamic and randomized makes our approach robust against collusion and alleviates the need for cryptography. We present the challenges raised by an auditing approach and give insights into how to build a freerider-tracking protocol for gossip-based content dissemination.
Keywords
cryptographic protocols; peer-to-peer computing; transport protocols; accountability; asymmetric component; collusion; content dissemination protocols; cryptography; freerider-tracking protocol; freeriders; gossip protocols; peer-to-peer content dissemination; Bandwidth; Collaboration; Cryptographic protocols; Cryptography; Internet; Large-scale systems; Peer to peer computing; Robustness; Scalability;
fLanguage
English
Publisher
ieee
Conference_Titel
Peer-to-Peer Computing, 2009. P2P '09. IEEE Ninth International Conference on
Conference_Location
Seattle, WA
Print_ISBN
978-1-4244-5066-4
Electronic_ISBN
978-1-4244-5067-1
Type
conf
DOI
10.1109/P2P.2009.5284543
Filename
5284543
Link To Document