File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Performance comparison of scheduling algorithms for peer-to-peer collaborative file distribution

TitlePerformance comparison of scheduling algorithms for peer-to-peer collaborative file distribution
Authors
KeywordsData distribution
File sharing
P2P
Peer-to-Peer
Scheduling algorithms
Issue Date2007
PublisherIEEE.
Citation
Ieee Journal On Selected Areas In Communications, 2007, v. 25 n. 1, p. 146-154 How to Cite?
AbstractPeer-to-Peer file sharing applications in the Internet, such as BitTorrent, Gnutella, etc., have been immensely popular. Prior research mainly focuses on peer and content discovery, overlay topology formation, fairness and incentive issues, etc. However, little attention has been paid to investigate the data distribution problem which is also a core component of any file sharing application. In this paper, we present the first effort in addressing this collaborative file distribution problem and formally define the scheduling problem in a simplified context. We develop several algorithms to solve the problem and study their performance. We deduce a theoretical bound on the minimum download time experienced by users and also perform simulations to evaluate our algorithms. Simulation results show that our graph-based dynamically weighted maximum-flow algorithm outperforms all other algorithms. Therefore, we believe our algorithm is a promising solution to be employed as the core scheduling module in P2P file sharing applications. © 2007 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/44744
ISSN
2015 Impact Factor: 3.672
2015 SCImago Journal Rankings: 2.915
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorChan, JSKen_HK
dc.contributor.authorLi, VOKen_HK
dc.contributor.authorLui, KSen_HK
dc.date.accessioned2007-10-30T06:09:15Z-
dc.date.available2007-10-30T06:09:15Z-
dc.date.issued2007en_HK
dc.identifier.citationIeee Journal On Selected Areas In Communications, 2007, v. 25 n. 1, p. 146-154en_HK
dc.identifier.issn0733-8716en_HK
dc.identifier.urihttp://hdl.handle.net/10722/44744-
dc.description.abstractPeer-to-Peer file sharing applications in the Internet, such as BitTorrent, Gnutella, etc., have been immensely popular. Prior research mainly focuses on peer and content discovery, overlay topology formation, fairness and incentive issues, etc. However, little attention has been paid to investigate the data distribution problem which is also a core component of any file sharing application. In this paper, we present the first effort in addressing this collaborative file distribution problem and formally define the scheduling problem in a simplified context. We develop several algorithms to solve the problem and study their performance. We deduce a theoretical bound on the minimum download time experienced by users and also perform simulations to evaluate our algorithms. Simulation results show that our graph-based dynamically weighted maximum-flow algorithm outperforms all other algorithms. Therefore, we believe our algorithm is a promising solution to be employed as the core scheduling module in P2P file sharing applications. © 2007 IEEE.en_HK
dc.format.extent1179908 bytes-
dc.format.extent4152649 bytes-
dc.format.extent1802 bytes-
dc.format.extent23319 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofIEEE Journal on Selected Areas in Communicationsen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2007 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.en_HK
dc.subjectData distributionen_HK
dc.subjectFile sharingen_HK
dc.subjectP2Pen_HK
dc.subjectPeer-to-Peeren_HK
dc.subjectScheduling algorithmsen_HK
dc.titlePerformance comparison of scheduling algorithms for peer-to-peer collaborative file distributionen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0733-8716&volume=25&issue=1&spage=146&epage=154&date=2007&atitle=Performance+comparison+of+scheduling+algorithms+for+peer-to-peer+collaborative+file+distributionen_HK
dc.identifier.emailLi, VOK:vli@eee.hku.hken_HK
dc.identifier.emailLui, KS:kslui@eee.hku.hken_HK
dc.identifier.authorityLi, VOK=rp00150en_HK
dc.identifier.authorityLui, KS=rp00188en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/JSAC.2007.070115en_HK
dc.identifier.scopuseid_2-s2.0-33846598454en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33846598454&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume25en_HK
dc.identifier.issue1en_HK
dc.identifier.spage146en_HK
dc.identifier.epage154en_HK
dc.identifier.isiWOS:000243597900015-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridChan, JSK=53869863000en_HK
dc.identifier.scopusauthoridLi, VOK=7202621685en_HK
dc.identifier.scopusauthoridLui, KS=7103390016en_HK
dc.identifier.citeulike2986067-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats