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

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

    9 Citations (Scopus)


    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
    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


    Workshop4th IFIP TC 6 International Workshop, IWSOS 2009
    Abbreviated titleIWSOS 2009


    • Distributed p2p file sharing
    • random contact algorithms
    • stability


    Dive into the research topics of 'A stable random-contact algorithm for peer-to-peer file sharing'. Together they form a unique fingerprint.

    Cite this