Min-min times in peer-to-peer file sharing networks
Abstract
Peer-to-peer (P2P) file distribution is a scalable way to disseminate content to a wide audience. This paper presents an algorithm by which download times are sequentially minimized; that is, the first peer's download time is minimized, and subsequent peers' times are minimized conditional on their predecessors' times being minimized. This objective gives robustness to the file distribution in the case that the network may be partitioned. It is also an important step towards the natural objective of minimizing the average download time, which is made challenging by the combinatorial structure of the problem. This optimality result not only provides fundamental insight to scheduling in such P2P systems, but also can serve as a benchmark to evaluate practical algorithms and illustrate the scalability of P2P networks.
Additional Information
© 2008 IEEE. This research was performed under an appointment to the U.S. Department of Homeland Security (DHS) Scholarship and Fellowship Program, administered by the Oak Ridge Institute for Science and Education (ORISE) through an interagency agreement between the U.S. Department of Energy (DOE) and DHS. ORISE is managed by Oak Ridge Associated Universities (ORAU) under DOE contract number DE-AC05- 06OR23100. All opinions expressed in this paper are the author's and do not necessarily reflect the policies and views of DHS, DOE, or ORAU/ORISE.Attached Files
Published - 04797738.pdf
Files
| Name | Size | Download all |
|---|---|---|
|
md5:8da32f420fe82e2f6c5e746788c562aa
|
314.0 kB | Preview Download |
Additional details
- Eprint ID
- 80111
- Resolver ID
- CaltechAUTHORS:20170810-112107197
- Department of Energy (DOE)
- DE-AC05-06OR23100
- Department of Homeland Security
- Created
-
2017-08-14Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field