IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v64y2017i4d10.1007_s11235-016-0203-1.html
   My bibliography  Save this article

Design and analysis of parallel file downloading algorithms in peer-to-peer networks

Author

Listed:
  • Keqin Li

    (State University of New York)

Abstract

It is well known that the method of parallel downloading can be used to reduce file download times in a peer-to-peer (P2P) network. There has been little investigation on parallel download and chunk allocation for source peers with random service capacities. The main contribution of this paper is to address the problem of efficient parallel file download in P2P networks with random service capacities. A precise analysis of the expected download time is given when the service capacity of a source peer is a random variable. A general framework is developed for analyzing the expected download time of a parallel download and chunk allocation algorithm, and is applied to the analysis of several algorithms. Two chunk allocation algorithms for parallel download are proposed. It is observed that the performance of parallel download can be significantly improved by using the method of probing high-capacity peers. One such algorithm is proposed and its expected parallel download time is analyzed. The performance of these parallel file download algorithms in P2P networks with random service capacities are compared. The above parallel download algorithms are extended to multiple file download by dividing source peers into clusters. It is noticed that there is an important issue of optimal parallelism which minimizes the combined effect of intracluster and intercluster overhead of parallel download and load imbalance.

Suggested Citation

  • Keqin Li, 2017. "Design and analysis of parallel file downloading algorithms in peer-to-peer networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 64(4), pages 719-734, April.
    • Handle: RePEc:spr:telsys:v:64:y:2017:i:4:d:10.1007_s11235-016-0203-1
    DOI: 10.1007/s11235-016-0203-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-016-0203-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-016-0203-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:64:y:2017:i:4:d:10.1007_s11235-016-0203-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.