published_or_final_version / Electrical and Electronic Engineering / Master / Master of Philosophy

Fan Bin. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves 72-76). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Motivation --- p.3 / Chapter 1.3 --- Our Contribution --- p.5 / Chapter 1.4 --- Structure of the thesis --- p.7 / Chapter 2 --- Related Work --- p.8 / Chapter 2.1 --- Measurement Based Studies --- p.8 / Chapter 2.2 --- Analytical Modeling of Bit Torrent System --- p.9 / Chapter 2.3 --- Fairness and Incentive Mechanism --- p.11 / Chapter 3 --- Scalability --- p.12 / Chapter 3.1 --- Analytical Model --- p.12 / Chapter 3.2 --- Steady-State Performance Measures --- p.18 / Chapter 3.3 --- Model Validation and Evaluation --- p.22 / Chapter 3.4 --- Model Extension For Peers behind Firewalls --- p.28 / Chapter 3.5 --- Summary --- p.32 / Chapter 4 --- File Availability --- p.33 / Chapter 4.1 --- Modeling the File Availability --- p.34 / Chapter 4.2 --- Performance of Different Chunk Selection Algorithms --- p.38 / Chapter 4.3 --- Summary --- p.42 / Chapter 5 --- Fairness --- p.44 / Chapter 5.1 --- Mathematical Model --- p.45 / Chapter 5.1.1 --- The Generic Model of Uplink Sharing --- p.45 / Chapter 5.1.2 --- A Dynamic Model of Multiple Classes of Peers --- p.46 / Chapter 5.1.3 --- Performance Metric --- p.47 / Chapter 5.1.4 --- Fairness Metric --- p.49 / Chapter 5.2 --- Rate Assignment Strategies --- p.51 / Chapter 5.2.1 --- Uploading Rate --- p.51 / Chapter 5.2.2 --- Rate Assignment for Optimal Downloading Time --- p.51 / Chapter 5.2.3 --- Rate Assignment for Optimal Fairness --- p.53 / Chapter 5.2.4 --- Rate Assignment for Max-min Allocation --- p.54 / Chapter 5.2.5 --- Performance and Fairness Comparison --- p.56 / Chapter 5.3 --- A Family of Distributed Algorithms --- p.58 / Chapter 5.3.1 --- Selective Uploading --- p.60 / Chapter 5.3.2 --- Non-discriminative Uploading --- p.62 / Chapter 5.3.3 --- Design Knobs --- p.63 / Chapter 5.4 --- Performance Evaluation --- p.63 / Chapter 5.5 --- Summary --- p.69 / Chapter 6 --- Conclusion --- p.70 / Bibliography --- p.72 / Chapter A --- Proof of Theorem 3.1 --- p.77 / Chapter B --- Proof of Theorem 5.2 --- p.81

Thesis (Ph. D.)--School of Electrical and Computer Engineering, Georgia Institute of Technology, 2004. Directed by John A. Copeland. / Includes bibliographical references (leaves 79-86).

Peer-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. / published_or_final_version / Electrical and Electronic Engineering / Master / Master of Philosophy

Thesis (M. Phil.)--University of Hong Kong, 2008. / Includes bibliographical references (leaf 70-72) Also available in print.

Thesis (M.F.A.)--Rochester Institute of Technology, 2009. / Typescript. Includes bibliographical references (leaves 54-55).

Includes bibliographical references (p. 59-60).

Thesis (M.A.)--City University of Hong Kong, 2007. / "Master of Arts in arbitration and dispute resolution dissertation, City University of Hong Kong" Title from PDF t.p. (viewed on May 22, 2007) Includes bibliographical references.

No description available.

Thesis (LL. M.)--University of Toronto, 2005.