Safe peer-to-peer self-downloading

Authors:
Kajari Ghosh Dastidar;Ted Herman;Colette Johnen
Affiliations:
Department of Computer Science, University of Iowa;Department of Computer Science, University of Iowa;LRI-CNRS, Université Paris-Sud 11, Orsay cedex, France
Venue:
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Year:
2006

Citing 5
Cited 0

Skip graphs

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Incentives in BitTorrent induce free riding

Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Scheduling Independent Tasks Sharing Large Data Distributed with BitTorrent

GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Strategies for peer-to-peer downloading

Information Processing Letters
Striped replication from multiple sites in the grid environment

EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Peer-to-peer applications share files between users them selves rather than downloading files from file servers. Self-downloading protocols have the property that eventually, every user downloads only from other users. This paper considers efficient ways of dividing files into segments so that users can exit the system as soon as file downloading is complete. One vulnerability of file sharing between peers is the possibility that files or segments could be counterfeit or corrupt. Protocols that are d-safe tolerate some number of instances of faulty segments in a file being downloaded, because each segment is downloaded d times before being uploadable. It is shown that d-safe self-downloading is possible for a sufficiently large arrival rate of users to the system. In addition, the paper presents upper and lower connectivity and sharing bounds for d = 2.