Ezovski, G. Matthew and Anandkumar, Animashree and Tang, A. Kevin and Andrew, Lachlan L. H. (2008) Min-min times in peer-to-peer file sharing networks. In: 46th Annual Allerton Conference on Communication, Control, and Computing. IEEE , Piscataway, NJ, pp. 1487-1494. ISBN 978-1-4244-2925-7. https://resolver.caltech.edu/CaltechAUTHORS:20170810-112107197
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png) |
PDF
- Published Version
See Usage Policy. 314kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20170810-112107197
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.
| Item Type: | Book Section | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Related URLs: |
| |||||||||
| ORCID: |
| |||||||||
| 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. | |||||||||
| Funders: |
| |||||||||
| Subject Keywords: | Peer to peer computing, Scheduling algorithm, Scalability, Algorithm design and analysis, Partitioning algorithms, IP networks, Optimal scheduling, Computer networks, Time sharing computer systems, Computer science | |||||||||
| DOI: | 10.1109/ALLERTON.2008.4797738 | |||||||||
| Record Number: | CaltechAUTHORS:20170810-112107197 | |||||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20170810-112107197 | |||||||||
| Official Citation: | G. M. Ezovski, A. Anandkumar, A. K. Tang and L. L. H. Andrew, "Min-min times in peer-to-peer file sharing networks," 2008 46th Annual Allerton Conference on Communication, Control, and Computing, Urbana-Champaign, IL, 2008, pp. 1487-1494. doi: 10.1109/ALLERTON.2008.4797738 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4797738&isnumber=4797526 | |||||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | |||||||||
| ID Code: | 80111 | |||||||||
| Collection: | CaltechAUTHORS | |||||||||
| Deposited By: | Zhaojian Wang | |||||||||
| Deposited On: | 14 Aug 2017 19:28 | |||||||||
| Last Modified: | 15 Nov 2021 17:52 |
Repository Staff Only: item control page
