SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Incentives in BitTorrent induce free riding
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Strategies for peer-to-peer downloading
Information Processing Letters
Analysis of peer-to-peer file dissemination amongst users of different upload capacities
ACM SIGMETRICS Performance Evaluation Review
Scheduling Independent Tasks Sharing Large Data Distributed with BitTorrent
GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Clustering and sharing incentives in BitTorrent systems
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
High-bandwidth data dissemination for large-scale distributed systems
ACM Transactions on Computer Systems (TOCS)
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Striped replication from multiple sites in the grid environment
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
| Hi-index | 0.00 |
A goal of peer-to-peer applications is to share files between users themselves rather than downloading files from file servers. Self-downloading protocols have the property that, eventually, every user downloads only from other users. Self-downloading is problematic if users disconnect from the system upon completing file downloading, because they only share with other users while connected. Yet, if users continue to arrive at a sufficient rate, self-downloading protocols are possible. One vulnerability of file sharing between users 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 shared. This article shows that d-safe self-downloading is possible for a sufficiently large arrival rate of users to the system. Upper and lower connectivity and sharing bounds are given for d = 2, and simulation results show effects of relaxing assumptions about arrival rates and bandwidth.