A stable random-contact algorithm for peer-to-peer file sharing

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

7 Citations (Scopus)

Abstract

We consider a BitTorrent type file sharing algorithm with randomized chunk copying process. The system functions in completely distributed way without any 'Tracker', just relying on randomness. In such case the stability becomes an issue. It may happen, say, that some chunk becomes rare. This problem can persist and cause accumulation of peers in the system, resulting in unstable system. The considered algorithms result in processes similar to urn-processes. The rare chunk phenomenon corresponds to Polya-urn type process, where common chunks are favored. However, some urn-processes like the Friedman-urn can provide good balance by favoring rare chunks in copying process. Recently, we showed that an algorithm based on Friedman-urn is efficient in two chunk case. We generalize this algorithm for the more realistic case of many chunks. It shows good performance in terms of balance of chunks in an open system with constant flow of incoming peers.
Original languageEnglish
Title of host publicationSelf-Organizing Systems, IWSOS 2009
Place of PublicationBerlin / Heidelberg
PublisherSpringer
Pages185-192
DOIs
Publication statusPublished - 2009
MoE publication typeA4 Article in a conference publication
Event4th IFIP TC 6 International Workshop, IWSOS 2009 - Zurich, Switzerland
Duration: 9 Dec 200911 Dec 2009

Publication series

SeriesLecture Notes in Computer Science
Number5918
ISSN0302-9743

Workshop

Workshop4th IFIP TC 6 International Workshop, IWSOS 2009
Abbreviated titleIWSOS 2009
CountrySwitzerland
CityZurich
Period9/12/0911/12/09

Fingerprint

Copying
Open systems

Keywords

  • Distributed p2p file sharing
  • random contact algorithms
  • stability

Cite this

Reittu, H. (2009). A stable random-contact algorithm for peer-to-peer file sharing. In Self-Organizing Systems, IWSOS 2009 (pp. 185-192). Berlin / Heidelberg: Springer. Lecture Notes in Computer Science, No. 5918 https://doi.org/10.1007/978-3-642-10865-5_16
Reittu, Hannu. / A stable random-contact algorithm for peer-to-peer file sharing. Self-Organizing Systems, IWSOS 2009. Berlin / Heidelberg : Springer, 2009. pp. 185-192 (Lecture Notes in Computer Science; No. 5918).
@inproceedings{14b202baee42436e9d7c0869983a8d08,
title = "A stable random-contact algorithm for peer-to-peer file sharing",
abstract = "We consider a BitTorrent type file sharing algorithm with randomized chunk copying process. The system functions in completely distributed way without any 'Tracker', just relying on randomness. In such case the stability becomes an issue. It may happen, say, that some chunk becomes rare. This problem can persist and cause accumulation of peers in the system, resulting in unstable system. The considered algorithms result in processes similar to urn-processes. The rare chunk phenomenon corresponds to Polya-urn type process, where common chunks are favored. However, some urn-processes like the Friedman-urn can provide good balance by favoring rare chunks in copying process. Recently, we showed that an algorithm based on Friedman-urn is efficient in two chunk case. We generalize this algorithm for the more realistic case of many chunks. It shows good performance in terms of balance of chunks in an open system with constant flow of incoming peers.",
keywords = "Distributed p2p file sharing, random contact algorithms, stability",
author = "Hannu Reittu",
year = "2009",
doi = "10.1007/978-3-642-10865-5_16",
language = "English",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
number = "5918",
pages = "185--192",
booktitle = "Self-Organizing Systems, IWSOS 2009",
address = "Germany",

}

Reittu, H 2009, A stable random-contact algorithm for peer-to-peer file sharing. in Self-Organizing Systems, IWSOS 2009. Springer, Berlin / Heidelberg, Lecture Notes in Computer Science, no. 5918, pp. 185-192, 4th IFIP TC 6 International Workshop, IWSOS 2009, Zurich, Switzerland, 9/12/09. https://doi.org/10.1007/978-3-642-10865-5_16

A stable random-contact algorithm for peer-to-peer file sharing. / Reittu, Hannu.

Self-Organizing Systems, IWSOS 2009. Berlin / Heidelberg : Springer, 2009. p. 185-192 (Lecture Notes in Computer Science; No. 5918).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

TY - GEN

T1 - A stable random-contact algorithm for peer-to-peer file sharing

AU - Reittu, Hannu

PY - 2009

Y1 - 2009

N2 - We consider a BitTorrent type file sharing algorithm with randomized chunk copying process. The system functions in completely distributed way without any 'Tracker', just relying on randomness. In such case the stability becomes an issue. It may happen, say, that some chunk becomes rare. This problem can persist and cause accumulation of peers in the system, resulting in unstable system. The considered algorithms result in processes similar to urn-processes. The rare chunk phenomenon corresponds to Polya-urn type process, where common chunks are favored. However, some urn-processes like the Friedman-urn can provide good balance by favoring rare chunks in copying process. Recently, we showed that an algorithm based on Friedman-urn is efficient in two chunk case. We generalize this algorithm for the more realistic case of many chunks. It shows good performance in terms of balance of chunks in an open system with constant flow of incoming peers.

AB - We consider a BitTorrent type file sharing algorithm with randomized chunk copying process. The system functions in completely distributed way without any 'Tracker', just relying on randomness. In such case the stability becomes an issue. It may happen, say, that some chunk becomes rare. This problem can persist and cause accumulation of peers in the system, resulting in unstable system. The considered algorithms result in processes similar to urn-processes. The rare chunk phenomenon corresponds to Polya-urn type process, where common chunks are favored. However, some urn-processes like the Friedman-urn can provide good balance by favoring rare chunks in copying process. Recently, we showed that an algorithm based on Friedman-urn is efficient in two chunk case. We generalize this algorithm for the more realistic case of many chunks. It shows good performance in terms of balance of chunks in an open system with constant flow of incoming peers.

KW - Distributed p2p file sharing

KW - random contact algorithms

KW - stability

U2 - 10.1007/978-3-642-10865-5_16

DO - 10.1007/978-3-642-10865-5_16

M3 - Conference article in proceedings

T3 - Lecture Notes in Computer Science

SP - 185

EP - 192

BT - Self-Organizing Systems, IWSOS 2009

PB - Springer

CY - Berlin / Heidelberg

ER -

Reittu H. A stable random-contact algorithm for peer-to-peer file sharing. In Self-Organizing Systems, IWSOS 2009. Berlin / Heidelberg: Springer. 2009. p. 185-192. (Lecture Notes in Computer Science; No. 5918). https://doi.org/10.1007/978-3-642-10865-5_16