Peer-assisted file distribution: The minimum distribution time

Rakesh Kumar, Keith Ross

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    With the emergence of BitTorrent, Swarm-cast, and CDNs, peer-assisted file distribution has become a prominent Internet application, both in terms of user popularity and traffic volumes. We consider the following fundamental problem for peer-assisted file distribution. There are seed nodes, each of which has a copy of the file, and leecher nodes, each of which wants a copy the file. The goal is to distribute the file to all the leechers - with the assistance of the upload capacity of the leechers - in order to minimize the time to get the file to all the leechers (the distribution time). We obtain explicit expressions for the minimum distribution time of a general heterogeneous peer-assisted file distribution system. Derived with fluid-flow arguments, the expressions are in terms of the file size, the seeds' upload rates and the leechers' upload and download rates. We demonstrate the utility of the result by comparing the optimal distribution time with the measured distribution time when BitTorrent is used to distribute a file from a seed to ten leechers.

    Original languageEnglish (US)
    Title of host publication2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies, HotWeb
    DOIs
    StatePublished - 2006
    Event2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies, HotWeb - Boston, MA, United States
    Duration: Nov 13 2006Nov 14 2006

    Other

    Other2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies, HotWeb
    CountryUnited States
    CityBoston, MA
    Period11/13/0611/14/06

    Fingerprint

    Seed
    Flow of fluids
    Internet

    ASJC Scopus subject areas

    • Hardware and Architecture
    • Electrical and Electronic Engineering

    Cite this

    Kumar, R., & Ross, K. (2006). Peer-assisted file distribution: The minimum distribution time. In 2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies, HotWeb [4178376] https://doi.org/10.1109/HOTWEB.2006.355259

    Peer-assisted file distribution : The minimum distribution time. / Kumar, Rakesh; Ross, Keith.

    2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies, HotWeb. 2006. 4178376.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Kumar, R & Ross, K 2006, Peer-assisted file distribution: The minimum distribution time. in 2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies, HotWeb., 4178376, 2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies, HotWeb, Boston, MA, United States, 11/13/06. https://doi.org/10.1109/HOTWEB.2006.355259
    Kumar R, Ross K. Peer-assisted file distribution: The minimum distribution time. In 2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies, HotWeb. 2006. 4178376 https://doi.org/10.1109/HOTWEB.2006.355259
    Kumar, Rakesh ; Ross, Keith. / Peer-assisted file distribution : The minimum distribution time. 2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies, HotWeb. 2006.
    @inproceedings{a3bb89f07700454c8cee99435809cb01,
    title = "Peer-assisted file distribution: The minimum distribution time",
    abstract = "With the emergence of BitTorrent, Swarm-cast, and CDNs, peer-assisted file distribution has become a prominent Internet application, both in terms of user popularity and traffic volumes. We consider the following fundamental problem for peer-assisted file distribution. There are seed nodes, each of which has a copy of the file, and leecher nodes, each of which wants a copy the file. The goal is to distribute the file to all the leechers - with the assistance of the upload capacity of the leechers - in order to minimize the time to get the file to all the leechers (the distribution time). We obtain explicit expressions for the minimum distribution time of a general heterogeneous peer-assisted file distribution system. Derived with fluid-flow arguments, the expressions are in terms of the file size, the seeds' upload rates and the leechers' upload and download rates. We demonstrate the utility of the result by comparing the optimal distribution time with the measured distribution time when BitTorrent is used to distribute a file from a seed to ten leechers.",
    author = "Rakesh Kumar and Keith Ross",
    year = "2006",
    doi = "10.1109/HOTWEB.2006.355259",
    language = "English (US)",
    isbn = "1424405955",
    booktitle = "2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies, HotWeb",

    }

    TY - GEN

    T1 - Peer-assisted file distribution

    T2 - The minimum distribution time

    AU - Kumar, Rakesh

    AU - Ross, Keith

    PY - 2006

    Y1 - 2006

    N2 - With the emergence of BitTorrent, Swarm-cast, and CDNs, peer-assisted file distribution has become a prominent Internet application, both in terms of user popularity and traffic volumes. We consider the following fundamental problem for peer-assisted file distribution. There are seed nodes, each of which has a copy of the file, and leecher nodes, each of which wants a copy the file. The goal is to distribute the file to all the leechers - with the assistance of the upload capacity of the leechers - in order to minimize the time to get the file to all the leechers (the distribution time). We obtain explicit expressions for the minimum distribution time of a general heterogeneous peer-assisted file distribution system. Derived with fluid-flow arguments, the expressions are in terms of the file size, the seeds' upload rates and the leechers' upload and download rates. We demonstrate the utility of the result by comparing the optimal distribution time with the measured distribution time when BitTorrent is used to distribute a file from a seed to ten leechers.

    AB - With the emergence of BitTorrent, Swarm-cast, and CDNs, peer-assisted file distribution has become a prominent Internet application, both in terms of user popularity and traffic volumes. We consider the following fundamental problem for peer-assisted file distribution. There are seed nodes, each of which has a copy of the file, and leecher nodes, each of which wants a copy the file. The goal is to distribute the file to all the leechers - with the assistance of the upload capacity of the leechers - in order to minimize the time to get the file to all the leechers (the distribution time). We obtain explicit expressions for the minimum distribution time of a general heterogeneous peer-assisted file distribution system. Derived with fluid-flow arguments, the expressions are in terms of the file size, the seeds' upload rates and the leechers' upload and download rates. We demonstrate the utility of the result by comparing the optimal distribution time with the measured distribution time when BitTorrent is used to distribute a file from a seed to ten leechers.

    UR - http://www.scopus.com/inward/record.url?scp=50049102260&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=50049102260&partnerID=8YFLogxK

    U2 - 10.1109/HOTWEB.2006.355259

    DO - 10.1109/HOTWEB.2006.355259

    M3 - Conference contribution

    SN - 1424405955

    SN - 9781424405954

    BT - 2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies, HotWeb

    ER -