Safe peer-to-peer self-downloading

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Safe peer-to-peer self-downloading

Full text

Pdf (301 KB)

Source

ACM Transactions on Autonomous and Adaptive Systems (TAAS) archive
Volume 3 , Issue 4 (November 2008) table of contents

Article No. 19

Year of Publication: 2008

ISSN:1556-4665

Authors

Kajari Ghosh Dastidar	University of Iowa
Ted Herman	University of Iowa
Colette Johnen	University of Bordeaux 1

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 101, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1452001.1452009 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Adler, S. 1999. The slashdot effect, an analysis of three internet publications. Linux Gaz. 38.
	2	James Aspnes , Gauri Shah, Skip graphs, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14, 2003, Baltimore, Maryland
	3	Baohua Wei , G. Fedak , F. Cappello, Scheduling Independent Tasks Sharing Large Data Distributed with BitTorrent, Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing, p.219-226, November 13-14, 2005 [doi>10.1109/GRID.2005.1542745]
	4	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.
	5	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.
	6	Miguel Castro , Peter Druschel , Anne-Marie Kermarrec , Animesh Nandi , Antony Rowstron , Atul Singh, SplitStream: high-bandwidth multicast in cooperative environments, Proceedings of the nineteenth ACM symposium on Operating systems principles, October 19-22, 2003, Bolton Landing, NY, USA
	7	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.
	8	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.
	9	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.
	10	Ted Herman , Colette Johnen, Strategies for peer-to-peer downloading, Information Processing Letters, v.94 n.5, p.203-209, 15 June 2005 [doi>10.1016/j.ipl.2005.02.012]
	11	Seung Jun , Mustaque Ahamad, Incentives in BitTorrent induce free riding, Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems, August 22-22, 2005, Philadelphia, Pennsylvania, USA [doi>10.1145/1080192.1080199]
	12	Dejan Kostić , Alex C. Snoeren , Amin Vahdat , Ryan Braud , Charles Killian , James W. Anderson , Jeannie Albrecht , Adolfo Rodriguez , Erik Vandekieft, High-bandwidth data dissemination for large-scale distributed systems, ACM Transactions on Computer Systems (TOCS), v.26 n.1, p.1-61, February 2008 [doi>10.1145/1328671.1328674]
	13	Arnaud Legout , Nikitas Liogkas , Eddie Kohler , Lixia Zhang, Clustering and sharing incentives in BitTorrent systems, ACM SIGMETRICS Performance Evaluation Review, v.35 n.1, June 2007
	14	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.
	15	Harry C. Li , Allen Clement , Edmund L. Wong , Jeff Napper , Indrajit Roy , Lorenzo Alvisi , Michael Dahlin, BAR gossip, Proceedings of the 7th symposium on Operating systems design and implementation, November 06-08, 2006, Seattle, Washington
	16	Marciniak, P., Liogkas, N., Legout, A., and Kohler, E. 2008. Small is not always beautiful. Tech. rep. CoRR abs/0802.1015.
	17	J. Mundinger , R. R. Weber , G. Weiss, Analysis of peer-to-peer file dissemination amongst users of different upload capacities, ACM SIGMETRICS Performance Evaluation Review, v.34 n.2, September 2006 [doi>10.1145/1168134.1168138]
	18	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.
	19	Wang, C. and Li, B. 2003. Peer-to-peer overlay networks: a survey. Tech. rep., Department of Computer Science, Hong Kong University.
	20	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.
	21	Haifeng Yu , Phillip B. Gibbons , Michael Kaminsky , Feng Xiao, SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks, Proceedings of the 2008 IEEE Symposium on Security and Privacy (sp 2008), p.3-17, May 18-21, 2008 [doi>10.1109/SP.2008.13]
	22	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.