File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Improving file distribution performance by grouping in peer-to-peer networks

TitleImproving file distribution performance by grouping in peer-to-peer networks
Authors
KeywordsFile distribution
Grouping
Peer-to-peer
Bandwidth capacity
Distributed computer systems
Issue Date2009
PublisherIEEE.
Citation
IEEE Transactions on Network and Service Management, 2009, v. 6 n. 3, p. 149-162 How to Cite?
AbstractIt has been shown that the peer-to-peer paradigm is more efficient than the traditional client-server model for file sharing among a large number of users. Given a group of leechers who wants to download a single file and a group of seeds who possesses the whole file, the minimum time needed for distributing the file to all users can be calculated based on their bandwidth availabilities. A scheduling algorithm has been developed so that every leecher can obtain the file within this minimum time. Unfortunately, this mechanism is not optimal with regard to the average download time among the peers. In this paper, we study how to reduce the average download time without prolonging the time needed for all leechers to obtain the file from a theoretical perspective. Based on the bandwidth capacities, the seeds and leechers are divided into different groups. We identify the necessary conditions for grouping to bring about benefits. We also study the impact on performance when leechers leave the system before the downloading process is complete. To evaluate our mechanism, we conduct extensive simulations and compare the performance with a BitTorrentlike file sharing algorithm. The results show that our grouping protocol successfully reduces the average download time over a wide range of system configurations. © 2009 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/155553
ISSN
2015 SCImago Journal Rankings: 1.021
References

 

DC FieldValueLanguage
dc.contributor.authorMa, Len_US
dc.contributor.authorTsang, PSen_US
dc.contributor.authorLui, KSen_US
dc.date.accessioned2012-08-08T08:34:04Z-
dc.date.available2012-08-08T08:34:04Z-
dc.date.issued2009en_US
dc.identifier.citationIEEE Transactions on Network and Service Management, 2009, v. 6 n. 3, p. 149-162en_US
dc.identifier.issn1932-4537en_US
dc.identifier.urihttp://hdl.handle.net/10722/155553-
dc.description.abstractIt has been shown that the peer-to-peer paradigm is more efficient than the traditional client-server model for file sharing among a large number of users. Given a group of leechers who wants to download a single file and a group of seeds who possesses the whole file, the minimum time needed for distributing the file to all users can be calculated based on their bandwidth availabilities. A scheduling algorithm has been developed so that every leecher can obtain the file within this minimum time. Unfortunately, this mechanism is not optimal with regard to the average download time among the peers. In this paper, we study how to reduce the average download time without prolonging the time needed for all leechers to obtain the file from a theoretical perspective. Based on the bandwidth capacities, the seeds and leechers are divided into different groups. We identify the necessary conditions for grouping to bring about benefits. We also study the impact on performance when leechers leave the system before the downloading process is complete. To evaluate our mechanism, we conduct extensive simulations and compare the performance with a BitTorrentlike file sharing algorithm. The results show that our grouping protocol successfully reduces the average download time over a wide range of system configurations. © 2009 IEEE.en_US
dc.languageengen_US
dc.publisherIEEE.-
dc.relation.ispartofIEEE Transactions on Network and Service Managementen_US
dc.rightsIEEE Transactions on Network and Service Management. Copyright © IEEE.-
dc.rights©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectFile distributionen_US
dc.subjectGroupingen_US
dc.subjectPeer-to-peeren_US
dc.subjectBandwidth capacity-
dc.subjectDistributed computer systems-
dc.titleImproving file distribution performance by grouping in peer-to-peer networksen_US
dc.typeArticleen_US
dc.identifier.emailLui, KS: kslui@eee.hku.hken_US
dc.identifier.authorityLui, KS=rp00188en_US
dc.description.naturepublished_or_final_versionen_US
dc.identifier.doi10.1109/TNSM.2009.03.090302en_US
dc.identifier.scopuseid_2-s2.0-75149178599en_US
dc.identifier.hkuros210669-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-75149178599&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume6en_US
dc.identifier.issue3en_US
dc.identifier.spage149en_US
dc.identifier.epage162en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridLui, KS=7103390016en_US
dc.identifier.scopusauthoridTsang, PS=35422976800en_US
dc.identifier.scopusauthoridLingjun, M=7801546489en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats