File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

postgraduate thesis: Bandwidth partition strategies for minimizing peer-to-peer multi-file distribution time

TitleBandwidth partition strategies for minimizing peer-to-peer multi-file distribution time
Authors
Advisors
Advisor(s):Wong, N
Issue Date2013
PublisherThe University of Hong Kong (Pokfulam, Hong Kong)
Citation
Meng, X. [孟翔]. (2013). Bandwidth partition strategies for minimizing peer-to-peer multi-file distribution time. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5089996
AbstractPeer-to-Peer (P2P) technology has been developed rapidly during the past few years. Due to its superiorities on robustness and scalability, P2P technology has been viewed as a promising networking technology and many studies have been done on how to improve P2P technology. P2P file distribution, as a major application of P2P technology, has also been studied a lot. The amount of time required for all peers to get the file has been considered as a major optimization metric, which we refer as the file distribution time. Researchers have proposed protocols to minimize the file distribution time for different cases. However, most of the existing works are based on the single-file scenario. On the other hand, studies show that in a file sharing application, users may download multiple files at the same time. In this thesis, we analyze the file distribution time for the distribution of multiple files in both wired and wireless networks. We develop explicit expressions for lower bound of time needed to distribute multiple files in a heterogeneous P2P fluid model. Unlike the single-file scenario, we demonstrate that the theoretical lower bound in multi-file scenario is not always achievable. With a comprehensive consideration of all the configurations, we develop algorithms to partition the bandwidth of all the peers for a particular file such that the file distribution time is optimal.
DegreeMaster of Philosophy
SubjectPeer-to-peer architecture (Computer networks)
Downloading of data.
Dept/ProgramElectrical and Electronic Engineering
Persistent Identifierhttp://hdl.handle.net/10722/192851

 

DC FieldValueLanguage
dc.contributor.advisorWong, N-
dc.contributor.authorMeng, Xiang-
dc.contributor.author孟翔-
dc.date.accessioned2013-11-24T02:01:12Z-
dc.date.available2013-11-24T02:01:12Z-
dc.date.issued2013-
dc.identifier.citationMeng, X. [孟翔]. (2013). Bandwidth partition strategies for minimizing peer-to-peer multi-file distribution time. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5089996-
dc.identifier.urihttp://hdl.handle.net/10722/192851-
dc.description.abstractPeer-to-Peer (P2P) technology has been developed rapidly during the past few years. Due to its superiorities on robustness and scalability, P2P technology has been viewed as a promising networking technology and many studies have been done on how to improve P2P technology. P2P file distribution, as a major application of P2P technology, has also been studied a lot. The amount of time required for all peers to get the file has been considered as a major optimization metric, which we refer as the file distribution time. Researchers have proposed protocols to minimize the file distribution time for different cases. However, most of the existing works are based on the single-file scenario. On the other hand, studies show that in a file sharing application, users may download multiple files at the same time. In this thesis, we analyze the file distribution time for the distribution of multiple files in both wired and wireless networks. We develop explicit expressions for lower bound of time needed to distribute multiple files in a heterogeneous P2P fluid model. Unlike the single-file scenario, we demonstrate that the theoretical lower bound in multi-file scenario is not always achievable. With a comprehensive consideration of all the configurations, we develop algorithms to partition the bandwidth of all the peers for a particular file such that the file distribution time is optimal.-
dc.languageeng-
dc.publisherThe University of Hong Kong (Pokfulam, Hong Kong)-
dc.relation.ispartofHKU Theses Online (HKUTO)-
dc.rightsThe author retains all proprietary rights, (such as patent rights) and the right to use in future works.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.source.urihttp://hub.hku.hk/bib/B5089996X-
dc.subject.lcshPeer-to-peer architecture (Computer networks)-
dc.subject.lcshDownloading of data.-
dc.titleBandwidth partition strategies for minimizing peer-to-peer multi-file distribution time-
dc.typePG_Thesis-
dc.identifier.hkulb5089996-
dc.description.thesisnameMaster of Philosophy-
dc.description.thesislevelMaster-
dc.description.thesisdisciplineElectrical and Electronic Engineering-
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.5353/th_b5089996-
dc.date.hkucongregation2013-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats