CaltechAUTHORS
  A Caltech Library Service

Optimal Strategies for Efficient Peer-to-Peer File Sharing

Mehyar, Mortada and Gu, WeiHsin and Low, Steven H. and Effros, Michelle and Ho, Tracey (2007) Optimal Strategies for Efficient Peer-to-Peer File Sharing. In: IEEE International Conference on Acoustics, Speech and Signal Processing, (ICASSP 2007), Honolulu, HI, 15-20 April 2007. Vol.IV. IEEE , Piscataway, NJ, IV-1337. ISBN 1-4244-0728-1. http://resolver.caltech.edu/CaltechAUTHORS:MEHicassp07

[img]
Preview
PDF - Published Version
See Usage Policy.

211Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:MEHicassp07

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.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/ICASSP.2007.367325DOIUNSPECIFIED
http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=4218356PublisherUNSPECIFIED
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.
Subject Keywords:Pareto optimization; minimax techniques; peer-to-peer computing
Record Number:CaltechAUTHORS:MEHicassp07
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:MEHicassp07
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:11950
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:13 Oct 2008 21:50
Last Modified:22 Jun 2016 23:04

Repository Staff Only: item control page