Abstract
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.
- Adler, S. 1999. The slashdot effect, an analysis of three internet publications. Linux Gaz. 38.Google Scholar
- Aspnes, J. and Shah, G. 2003. Skip graphs. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industries and Applied Mathematics, Philadelphia, PA, 284--393. Google Scholar
Digital Library
- Baohua, W., Fedak, G., and Cappello, F. 2005. Scheduling independent tasks sharing large data distributed with BitTorrent. In Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing (GRID). IEEE Computer Society, Los Alamitos, CA, 219--226. Google Scholar
Digital Library
- Bickson, D., Dolev, D., and Weiss, Y. 2004. Efficient peer-to-peer content rib. In Proceedings of the 6th Workshop on Distributed Data and Structures (WDAS). Carleton Scientific.Google Scholar
- Byers, J., Luby, M., and Mitzenmacher, M. 1999. Accessing multiple mirror sites in parallel: using tornado codes to speed up downloads. In Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). IEEE Computer Society, Los Alamitos, CA, 275--284.Google Scholar
- Castro, C., Druschel, P., Kermarrec, A., Nandi, A., Rowstron, A., and Singh, A. 2003. Splitstream: high-bandwidth multicast in cooperative environments. In Proceedings of the 19th ACM Symposium on Operating Systems Principles. ACM, New York, NY. Google Scholar
Digital Library
- Ciglan, M., Habala, O., and Hluchy, L. 2005. Striped replication from multiple sites in the grid environment. Lecture Notes in Computer Science, vol. 3470, Springer, Berlin, Germany, 778--785. Google Scholar
Digital Library
- Cohen, B. 2004. Incentives build robustness in BitTorrent. In Proceedings of the 1st Workshop on Economics of Peer-to-Peer Systems. http://www.sims.berkeley.edu/research/conferences/p2pecon.Google Scholar
- Gkantsidis, C. and Rodriguez, P. 2005. Network coding for large scale content distribution. In Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05). IEEE Computer Society, Los Alamitos, CA, 2235--2245.Google Scholar
- Herman, T. and Johnen, C. 2005. Strategies for peer-to-peer downloading. Inform. Process. Lett. 94, 5, 203--209. Google Scholar
Digital Library
- Jun, S. and Ahamad, M. 2005. Incentives in BitTorrent induce free riding. In Proceedings of the ACM SIGCOMM - Workshop on Economics of Peer-to-Peer Systems (P2PECON). ACM, New York, NY, 116--121. Google Scholar
Digital Library
- Kostić, D., Snoeren, A., Vahdat, A., Braud, R., Killian, C., Anderson, J., Albrecht, J., Rodriguez, A., and Vandekieft, E. 2008. High-bandwidth data dissemination for large-scale distributed systems. ACM Trans. Comput. Syst. 20, 1, 3:1--3:61. Google Scholar
Digital Library
- Legout, A., Liogkas, N., Kohler, E., and Zhang, L. 2007. Clustering and sharing incentives in BitTorrent systems. SIGMETRICS Perform. Eval. Rev. 35, 1, 301--312. Google Scholar
Digital Library
- Leibnitz, K., Hoßfeld, T., Wakamiya, N., and Murata, M. 2006. On pollution in eDonkey-like peer-to-peer file-sharing networks. In Proceedings of the 13th GI/ITG Conference on Measurement, Modeling, and Evaluation of Computer and Communication Systems (MMB). 285--302.Google Scholar
- Li, H., Clement, A., Wong, E., Napper, J., Roy, I., Alvisi, L., and Dahlin, M. 2007. BAR gossip. In Proceedings of the 7th Symposium on Operating Systems Design and Implementation (OSDI). USENIX Association, Berkeley, CA, 191--204. Google Scholar
Digital Library
- Marciniak, P., Liogkas, N., Legout, A., and Kohler, E. 2008. Small is not always beautiful. Tech. rep. CoRR abs/0802.1015.Google Scholar
- Mundinger, J., Weber, R., and Weiss, G. 2006. Analysis of peer-to-peer file dissemination amongst users of different upload capacities. SIGMETRICS Perform. Eval. Rev. 34, 2, 5--6. Google Scholar
Digital Library
- Sherwood, R., Braud, R., and Bhattacharjee, B. 2004. Slurpie: a cooperative bulk data transfer protocol. In Proceedings of the 23th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). IEEE Computer Society, Los Alamitos, CA, 941--951.Google Scholar
- Wang, C. and Li, B. 2003. Peer-to-peer overlay networks: a survey. Tech. rep., Department of Computer Science, Hong Kong University.Google Scholar
- Wu, G. and Chiueh, T. 2006. How efficient is BitTorrent? In Proceedings of the IS&T/SPIE Symposium on Electronic Imaging. Multimedia Computing and Networking, vol. 6071. SPIE Press, Bellingham, WA.Google Scholar
- Yu, H., Gibbons, P., Kaminsky, M., and Xiao, F. 2008. SybilLimit: a near-optimal social network defense against sybil attacks. In Proceedings of the IEEE Symposium on Security and Privacy (SP). IEEE Computer Society, Washington, CA. 3--17. Google Scholar
Digital Library
- Zhang, X., Liu, J., Li, B., and Yum, T. 2005. CoolStreaming/DONet: a data-driven overlay network for efficient live media streaming. In Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). IEEE Computer Society, Los Alamitos, CA. 2102--2111.Google Scholar
Index Terms
Safe peer-to-peer self-downloading
Recommendations
Safe peer-to-peer self-downloading
SSS'06: Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systemsPeer-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 ...
Exploiting Proximity in Cooperative Download of Large Files in Peer-to-Peer Networks
ICIW '07: Proceedings of the Second International Conference on Internet and Web Applications and ServicesPeer-to-peer networks have long being used for file-sharing among the connected peers. Recently, the popular BitTorrent tool has permitted the exchange of large sized files by dividing it into fragments, and enabling the peers to exchange the fragments ...






Comments