Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Safe peer-to-peer self-downloading

Safe peer-to-peer self-downloading Safe Peer-to-Peer Self-Downloading KAJARI GHOSH DASTIDAR and TED HERMAN University of Iowa and COLETTE JOHNEN University of Bordeaux 1 A goal of peer-to-peer applications is to share les between users themselves rather than downloading les from le 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 le downloading, because they only share with other users while connected. Yet, if users continue to arrive at a suf cient rate, self-downloading protocols are possible. One vulnerability of le sharing between users is the possibility that les or segments could be counterfeit or corrupt. Protocols that are d -safe tolerate some number of instances of faulty segments in a le being downloaded, because each segment is downloaded d times before being shared. This article shows that d-safe self-downloading is possible for a suf ciently 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. Categories and Subject Descriptors: C.2.4 [Computer-Communication Networks]: Distributed Systems ”Distributed applications; C.4 [Performance of Systems]: Reliability, http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Autonomous and Adaptive Systems (TAAS) Association for Computing Machinery

Loading next page...
 
/lp/association-for-computing-machinery/safe-peer-to-peer-self-downloading-SnENxlgpoQ

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2008 by ACM Inc.
ISSN
1556-4665
DOI
10.1145/1452001.1452009
Publisher site
See Article on Publisher Site

Abstract

Safe Peer-to-Peer Self-Downloading KAJARI GHOSH DASTIDAR and TED HERMAN University of Iowa and COLETTE JOHNEN University of Bordeaux 1 A goal of peer-to-peer applications is to share les between users themselves rather than downloading les from le 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 le downloading, because they only share with other users while connected. Yet, if users continue to arrive at a suf cient rate, self-downloading protocols are possible. One vulnerability of le sharing between users is the possibility that les or segments could be counterfeit or corrupt. Protocols that are d -safe tolerate some number of instances of faulty segments in a le being downloaded, because each segment is downloaded d times before being shared. This article shows that d-safe self-downloading is possible for a suf ciently 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. Categories and Subject Descriptors: C.2.4 [Computer-Communication Networks]: Distributed Systems ”Distributed applications; C.4 [Performance of Systems]: Reliability,

Journal

ACM Transactions on Autonomous and Adaptive Systems (TAAS)Association for Computing Machinery

Published: Nov 1, 2008

There are no references for this article.