CaltechAUTHORS
Published June 4, 2007 | Version Published
Book Section - Chapter Open

Optimal Strategies for Efficient Peer-to-Peer File Sharing

Creators

Abstract

We study a model for peer-to-peer file sharing. The goal is to distribute a file from a server to multiple peers. We assume the upload capacity of each peer is the only bottleneck. We examine the finish times of peers under different transmission strategies. Pareto optimality, min-max finish time, and optimal average finish time of the model are studied. We believe the results provide fundamental insights into practical peer-to-peer systems such as BitTorrent.

Additional Information

© Copyright 2008 IEEE. Reprinted with permission. Current Version Published: 2007-06-04. We would like to thank Lachlan Andrew and Aliekber Gurel for helpful discussions.

Attached Files

Published - MEHicassp07.pdf

Files

MEHicassp07.pdf

Files (216.8 kB)

Name Size Download all
md5:04ff81be075089d8d708319802d6ada6
216.8 kB Preview Download

Additional details

Identifiers

Eprint ID
11950
Resolver ID
CaltechAUTHORS:MEHicassp07

Dates

Created
2008-10-13
Created from EPrint's datestamp field
Updated
2021-11-08
Created from EPrint's last_modified field