File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Scheduling in P2P file distribution - On reducing the average distribution time

TitleScheduling in P2P file distribution - On reducing the average distribution time
Authors
Ma, LLui, KS
Issue Date2008
Citation
2008 5Th Ieee Consumer Communications And Networking Conference, Ccnc 2008, 2008, p. 521-522 How to Cite?
DOI: http://dx.doi.org/10.1109/ccnc08.2007.121
AbstractWe study in this paper the scheduling problem in P2P file distribution. Our aim is to reduce the average distribution time. We present two distribution mechanisms: distributing the rarest pieces first and distributing to the least demanding nodes first. The new algorithm, Rarest-Piece-First and Most-Demanding-Node-Last-Piece-Oriented, is developed and we demonstrate by simulation its effectiveness over some related algorithms. © IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/158561
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorMa, Len_US
dc.contributor.authorLui, KSen_US
dc.date.accessioned2012-08-08T09:00:16Z-
dc.date.available2012-08-08T09:00:16Z-
dc.date.issued2008en_US
dc.identifier.citation2008 5Th Ieee Consumer Communications And Networking Conference, Ccnc 2008, 2008, p. 521-522en_US
dc.identifier.urihttp://hdl.handle.net/10722/158561-
dc.description.abstractWe study in this paper the scheduling problem in P2P file distribution. Our aim is to reduce the average distribution time. We present two distribution mechanisms: distributing the rarest pieces first and distributing to the least demanding nodes first. The new algorithm, Rarest-Piece-First and Most-Demanding-Node-Last-Piece-Oriented, is developed and we demonstrate by simulation its effectiveness over some related algorithms. © IEEE.en_US
dc.languageengen_US
dc.relation.ispartof2008 5th IEEE Consumer Communications and Networking Conference, CCNC 2008en_US
dc.titleScheduling in P2P file distribution - On reducing the average distribution timeen_US
dc.typeConference_Paperen_US
dc.identifier.emailLui, KS:kslui@eee.hku.hken_US
dc.identifier.authorityLui, KS=rp00188en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/ccnc08.2007.121en_US
dc.identifier.scopuseid_2-s2.0-51949114149en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-51949114149&selection=ref&src=s&origin=recordpageen_US
dc.identifier.spage521en_US
dc.identifier.epage522en_US
dc.identifier.scopusauthoridMa, L=15923137600en_US
dc.identifier.scopusauthoridLui, KS=7103390016en_US

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats