File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Scheduling algorithms for peer-to-peer collaborative file distribution

TitleScheduling algorithms for peer-to-peer collaborative file distribution
Authors
Issue Date2005
PublisherIEEE.
Citation
2005 International Conference On Collaborative Computing: Networking, Applications And Worksharing, 2005, v. 2005 How to Cite?
AbstractPeer-to-Peer file sharing applications on 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, but seldom investigates 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 suggest several types of algorithms, including a novel Bipartite Matching algorithm, for solving the problem. Simulation results show that our weighted bipartite algorithm finds an optimal solution for all cases tested. Therefore, we believe our algorithm is a promising solution to be employed as the core scheduling module in P2P file sharing applications, shortening the total download time experienced by users. © 2005 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/45942
References

 

DC FieldValueLanguage
dc.contributor.authorChan, JSKen_HK
dc.contributor.authorLi, VOKen_HK
dc.contributor.authorLui, KSen_HK
dc.date.accessioned2007-10-30T06:39:06Z-
dc.date.available2007-10-30T06:39:06Z-
dc.date.issued2005en_HK
dc.identifier.citation2005 International Conference On Collaborative Computing: Networking, Applications And Worksharing, 2005, v. 2005en_HK
dc.identifier.urihttp://hdl.handle.net/10722/45942-
dc.description.abstractPeer-to-Peer file sharing applications on 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, but seldom investigates 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 suggest several types of algorithms, including a novel Bipartite Matching algorithm, for solving the problem. Simulation results show that our weighted bipartite algorithm finds an optimal solution for all cases tested. Therefore, we believe our algorithm is a promising solution to be employed as the core scheduling module in P2P file sharing applications, shortening the total download time experienced by users. © 2005 IEEE.en_HK
dc.format.extent322903 bytes-
dc.format.extent4152649 bytes-
dc.format.extent4014 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.ispartof2005 International Conference on Collaborative Computing: Networking, Applications and Worksharingen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2005 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.titleScheduling algorithms for peer-to-peer collaborative file distributionen_HK
dc.typeConference_Paperen_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/COLCOM.2005.1651215en_HK
dc.identifier.scopuseid_2-s2.0-33947648376en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33947648376&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume2005en_HK
dc.identifier.scopusauthoridChan, JSK=53869863000en_HK
dc.identifier.scopusauthoridLi, VOK=7202621685en_HK
dc.identifier.scopusauthoridLui, KS=7103390016en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats