Peer-to-peer networks are a common methodology used for content delivery and data sharing on the Internet. The duration of any particular download session is highly dependent on the capacity of the node servers selected as source peers. Recent investigations have shown that specific total download times may deviate significantly from average total download times. This work investigates a novel approach to selecting download server peers that is intended to reduce average total download times and minimize variance of those times from the overall average of download session durations. Typical algorithms used in today's Peer-to-Peer (P2P) systems have improved from simply connecting to a single source peer for the entire download session to an approach where the download content is divided into chunks and a randomly selected source peer is chosen as the source for each chunk. This limits the possibility of an extremely long download session due to the selection of a low capacity download source peer. Prior work has demonstrated that it is better to divide the download session into time slices and download as much as possible from a randomly selected source peer within each time interval rather than staying connected to a poorly performing source peer for the entire time it takes to download a chunk of the source content. This approach minimizes the time spent with a poorly performing source peer and allows the client to move on to a potentially better performing source after a specific, limited interval. Other work has shown that by keeping a history of node performance, it is possible to recognize a poorly performing partner early in a time slice and depart to a new, and hopefully better performing partner, prior to the completion of a time slice (referred to as "choking" a poorly performing peer). These approaches have been shown to reduce average download times and minimize the variance in duration between download sessions. Prior work has also shown that there is value in the use of parallel download streams. As long as the number of streams is kept small (i.e. 4 to 6), minimizing the overhead of maintaining numerous streams and saturation of the available incoming network bandwidth, average download time can be further reduced. The algorithm described in this investigation uses time-based source peer switching and maintains a small number of parallel download streams. At the end of each time interval, it does not randomly replace all source peers but keeps those source peers that are performing relatively better and replaces those performing relatively poorly with randomly selected new source partners. In this way, as the download progresses, parallel downloading typically progresses from a set of better and better performing source partners, therefore reducing average download times and reducing overall variance between download times. This approach has been shown in simulations to reduce average download times by nearly 20% over parallel versions of basic time-based downloads and 8.7% over time-based downloads with the addition of "choking" poorly performing partners. As file sizes increase and/or the heterogeneity of source node service capacities increase, the benefits of this approach to source peer replacement also increases. These improvements are gained while maintaining or further limiting the variance in performance between download sessions. The reduction in average download times and the decrease in variance between download sessions provided by this approach will improve the user experience for users of P2P content distribution systems. This approach should also be applicable to other data distribution systems such as distributed file systems.

In today's Internet, building overlay structures to provide a service is becoming more and more common. This approach allows for the utilization of client resources, thus being more scalable than a client-server model in this respect. However, in these architectures the quality of the provided service depends on the clients and is therefore more complex to manage. Resource utilization, both at the clients themselves and in the underlying network, determine the efficiency of the overlay application. Here, a trade-off exists between the resource providers and the end users that can be tuned via overlay mechanisms. Thus, resource management and traffic management is always quality-of-service management as well. In this monograph, the three currently significant and most widely used overlay types in the Internet are considered. These overlays are implemented in popular applications which only recently have gained importance. Thus, these overlay networks still face real-world technical challenges which are of high practical relevance. We identify the specific issues for each of the considered overlays, and show how their optimization affects the trade-offs between resource efficiency and service quality. Thus, we supply new insights and system knowledge that is not provided by previous work. / Im heutigen Internet werden immer häufiger Overlay-Strukturen aufgebaut, um eine Dienstleistung zu erbringen. Dieser Ansatz ermöglicht die Nutzung von Client-Ressourcen, so dass er in dieser Hinsicht besser skaliert als das Client-Server-Modell. Die Qualität des zur Verfügung gestellten Dienstes hängt nun aber von den Clients ab und ist daher komplizierter zu steuern. Die Ressourcennutzung, sowohl auf den Clients selbst als auch in dem zugrunde liegenden Netzwerk, bestimmt die Effizienz der Overlay-Anwendung. Hier existiert ein Trade-off zwischen Ressourcen-Anbietern und Endkunden, der über Overlay-Mechanismen geregelt werden kann. Daher ist Ressourcenmanagement und Traffic-Management gleichzeitig immer auch Quality-of-Service-Management. In dieser Arbeit werden die drei derzeit am weitesten im Internet verbreiteten und signifikanten Overlay-Typen berücksichtigt. Diese Overlays sind in populären Anwendungen, die erst vor kurzem an Bedeutung gewonnen haben, implementiert. Daher sind diese Overlay-Netze nach wie vor realen technischen Herausforderungen ausgesetzt, die von hoher praktischer Relevanz sind. Die spezifischen Herausforderungen für jedes der betrachteten Overlays werden identifiziert und es wird gezeigt, wie deren Optimierung den Trade-off zwischen Ressourceneffizienz und Service-Qualität beeinflusst. So werden neue Einsichten und Erkenntnisse über diese Systeme gewonnen, die in früheren Arbeiten nicht existieren.

Thesis advisor: Paul Gray / This dissertation analyzes the field of consumption to provide an analysis of Bourdieusian cultural capital. Bourdieu introduced cultural capital to express the summed effect of intergenerational and personal institutional credentials on economic structure (1986). The three articles of this dissertation – Imagining Class, Precariat Production, and New Cultures of Connection – take up the study of cultural capital in a contemporary, American context among Millennial consumers (Bourdieu 1984, 1993). These cases analyze producer and consumer experiences within the capital markets for durable goods, labor, and a barter market for services. The experiences under analysis include the design and purchase of luxury clothing, the selling of labor to temporary employers, and the barter of unlike services for a like medium of exchange. The analyses build upon Bourdieu’s concept of cultural capital by tracing its role and evolution through producer and consumer exchanges in the “consumer field” (Bourdieu; 1984, 1986, 1993). The analysis of this dissertation relies on semi-structured interview, ethnographic, and survey data. In total, 96 semi-structured interviews were conducted during the data collection for the three articles. Interview data is supported by economic survey and ethnographic data for research participants. Imagining Class melds postmodern and Veblenian consumer theory through informant narratives of the cynical and strategic production of conspicuous consumption enacted by both producers and consumers of the clothing brand Prep Outfitters (Featherstone 1991; Veblen 1899/1994). Upwardly mobile, young consumers believe that performing an elite lifestyle is a condition upon which financial services career success rests. The shared belief is correlated with income increases and results in an environment of aesthetic and lifestyle conformity on Wall Street. Precariat Production analyzes the motivational aspects and economic benefits of collaborative production work within the online platforms of Airbnb, RelayRides, and Taskrabbit and provides insight into the nature of the new working precariat class (Standing 2009). Analysis shows that three central motivational categories drive participation: money, efficiency / environmental, and workplace flexibility. Possession of economic assets prior to beginning work as a collaborative producer is a key characteristic associated with high earning within the precarious, collaborative marketplace, yet cultural capital is not a significant correlate of high income relative to the labor market. Further, those who enjoy the most economic success within the collaborative marketplace as “high earners” are also most likely to express that a motivation of “efficiency environmental” drives their production. The efficiency/environmental motivational finding lend a broader support for the claim of an evolution of high cultural capital expressions of ecohabitus (Bourdieu 1984; Schor et al. 2014). New Cultures of Connection evaluates the exchanges made on an egalitarian barter market through the medium of a local currency, “time dollars.” The study uses Zelizer’s concept of a circuit of commerce (2005) to show that cultural capital limits potential trades available in the time bank and reveals that those with high cultural capital exit the market. Ecohabitus provides one exception to this finding as high cultural capital participants find nonmonetary value in authenticity, localism, environmentalism, holistic wellness and self-reliance. Yet, this new set of high cultural capital preferences does not pair with their exchanges as they demonstrate enduring inclination towards professionalized, market-like services. Disparities in cultural capital challenge the potential of barter networks like the “time bank” to alter the dependence of identities of market practice and success. / Thesis (PhD) — Boston College, 2015. / Submitted to: Boston College. Graduate School of Arts and Sciences. / Discipline: Sociology.

Cheng Chun Kong. / Thesis submitted in: November 2006. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 62-64). / Abstracts in English and Chinese. / Abstract --- p.1 / 槪要 --- p.2 / Acknowledgement --- p.3 / Chapter 1. --- Introduction --- p.5 / Chapter 2. --- Literature Review --- p.10 / Chapter 3. --- Design / Chapter A. --- Overview --- p.22 / Chapter B. --- Basic idea --- p.23 / Chapter C. --- Follow-up design --- p.30 / Chapter D. --- Summary --- p.40 / Chapter 4. --- Experimental Findings / Chapter A. --- Goal --- p.41 / Chapter B. --- Analysis Methodology --- p.41 / Chapter C. --- Validation --- p.47 / Chapter D. --- Results --- p.47 / Chapter 5. --- Deployment / Chapter A. --- Limitations --- p.58 / Chapter B. --- Miscellaneous Design Issues --- p.59 / Chapter 6. --- Future Directions and Conclusions --- p.61 / Reference --- p.62 / Appendix --- p.65

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

Over the last decade, live video streaming applications have gained great popularity among users but put great pressure on video servers and the Internet. In order to satisfy the growing demands for live video streaming, Peer-to-Peer(P2P) has been developed to relieve the video servers of bandwidth bottlenecks and computational load. Furthermore, Network Coding (NC) has been proposed and proved as a significant breakthrough in information theory and coding theory. According to previous research, NC not only brings substantial improvements regarding throughput and delay in data transmission, but also provides innovative solutions for multiple issues related to resource allocation, such as the coupon-collection problem, allocation and scheduling procedure. However, the complex NC-driven P2P streaming network poses substantial challenges to the packet scheduling algorithm. This thesis focuses on the packet scheduling algorithm for video multicast in NC-driven P2P streaming network. It determines how upload bandwidth resources of peer nodes are allocated in different transmission scenarios to achieve a better Quality of Service(QoS). First, an optimized rate allocation algorithm is proposed for scalable video transmission (SVT) in the NC-based lossy streaming network. This algorithm is developed to achieve the tradeoffs between average video distortion and average bandwidth redundancy in each generation. It determines how senders allocate their upload bandwidth to different classes in scalable data so that the sum of the distortion and the weighted redundancy ratio can be minimized. Second, in the NC-based non-scalable video transmission system, the bandwidth ineffi- ciency which is caused by the asynchronization communication among peers is reduced. First, a scalable compensation model and an adaptive push algorithm are proposed to reduce the unrecoverable transmission caused by network loss and insufficient bandwidth resources. Then a centralized packet scheduling algorithm is proposed to reduce the unin- formative transmission caused by the asynchronized communication among sender nodes. Subsequently, we further propose a distributed packet scheduling algorithm, which adds a critical scalability property to the packet scheduling model. Third, the bandwidth resource scheduling for SVT is further studied. A novel multiple- generation scheduling algorithm is proposed to determine the quality classes that the receiver node can subscribe to so that the overall perceived video quality can be maxi- mized. A single generation scheduling algorithm for SVT is also proposed to provide a faster and easier solution to the video quality maximization function. Thorough theoretical analysis is conducted in the development of all proposed algorithms, and their performance is evaluated via comprehensive simulations. We have demon- strated, by adjusting the conventional transmission model and involving new packet scheduling models, the overall QoS and bandwidth efficiency are dramatically improved. In non-scalable video streaming system, the maximum video quality gain can be around 5dB compared with the random push method, and the overall uninformative transmiss- sion ratio are reduced to 1% - 2%. In scalable video streaming system, the maximum video quality gain can be around 7dB, and the overall uninformative transmission ratio are reduced to 2% - 3%.

Wong Wan Yeung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references (leaves 118-122). / Abstracts in English and Chinese. / Chapter 1. --- Introduction --- p.1 / Chapter 1.1 --- Problem Definition --- p.1 / Chapter 1.2 --- Major Contributions --- p.5 / Chapter 1.2.1 --- S2S Searching --- p.6 / Chapter 1.2.2 --- GAroute --- p.8 / Chapter 1.3 --- Thesis Chapter Organization --- p.10 / Chapter 2. --- Related Work --- p.11 / Chapter 2.1 --- P2P Networks --- p.11 / Chapter 2.2 --- Query Routing Strategies --- p.20 / Chapter 2.3 --- P2P Network Security --- p.22 / Chapter 3. --- S2S Searching --- p.24 / Chapter 3.1 --- System Architecture --- p.24 / Chapter 3.1.1 --- Administration Module --- p.24 / Chapter 3.1.2 --- Search Module --- p.27 / Chapter 3.2 --- Indexing and Matching --- p.32 / Chapter 3.2.1 --- Background of Indexing and Matching --- p.32 / Chapter 3.2.2 --- Indexing Algorithm --- p.33 / Chapter 3.2.3 --- Matching Algorithm --- p.34 / Chapter 3.3 --- Query Routing --- p.36 / Chapter 3.3.1 --- Background of Query Routing --- p.36 / Chapter 3.3.2 --- Distributed Registrars and Content Summary --- p.38 / Chapter 3.3.3 --- Query Routing Algorithm --- p.41 / Chapter 3.3.4 --- Registrar Maintenance --- p.44 / Chapter 3.4 --- Communication Protocol --- p.45 / Chapter 3.4.1 --- Starting CGI --- p.46 / Chapter 3.4.2 --- Searching CGI --- p.47 / Chapter 3.4.3 --- Pinging CGI --- p.48 / Chapter 3.4.4 --- Joining CGI --- p.48 / Chapter 3.4.5 --- Leaving CGI --- p.48 / Chapter 3.4.6 --- Updating CGI --- p.49 / Chapter 3.5 --- Experiments and Discussions --- p.49 / Chapter 3.5.1 --- Performance of Indexing --- p.50 / Chapter 3.5.2 --- Performance of Matching --- p.52 / Chapter 3.5.3 --- Performance of S2S Searching --- p.54 / Chapter 3.5.4 --- Quality of Content Summary --- p.57 / Chapter 4. --- GAroute --- p.59 / Chapter 4.1 --- Proposed Hybrid P2P Network Model --- p.59 / Chapter 4.1.1 --- Background of Hybrid P2P Networks --- p.60 / Chapter 4.1.2 --- Roles of Zone Managers --- p.62 / Chapter 4.2 --- Proposed GAroute --- p.65 / Chapter 4.2.1 --- Genetic Representation --- p.69 / Chapter 4.2.2 --- Population Initialization --- p.70 / Chapter 4.2.3 --- Mutation --- p.72 / Chapter 4.2.4 --- Crossover --- p.74 / Chapter 4.2.5 --- Fission --- p.77 / Chapter 4.2.6 --- Creation --- p.80 / Chapter 4.2.7 --- Selection --- p.81 / Chapter 4.2.8 --- Stopping Criteria --- p.83 / Chapter 4.2.9 --- Optimization --- p.86 / Chapter 4.3 --- Experiments and Discussions --- p.89 / Chapter 4.3.1 --- Property of Different Topologies --- p.91 / Chapter 4.3.2 --- Scalability and Quality in Different Topologies --- p.92 / Chapter 4.3.3 --- Scalability and Quality in Different Quantities --- p.96 / Chapter 4.3.4 --- Verification of Lower Bandwidth Consumption --- p.101 / Chapter 4.3.5 --- Verification of Better Parallel Search --- p.105 / Chapter 5. --- Discussion --- p.110 / Chapter 6. --- Conclusion --- p.114 / Chapter 7. --- Bibliography --- p.118 / Chapter 8. --- Appendix --- p.123 / Chapter 8.1 --- S2S Search Engine --- p.123 / Chapter 8.1.1 --- Site Owner Perspective --- p.123 / Chapter 8.1.2 --- Search Engine User Perspective --- p.128 / Chapter 8.2 --- GAroute Library --- p.129

In this thesis, we attempt to revisit the problem of multi-party conferencing from a practical perspective, and tore think the design space involved in this problem. We believe that an emphasis on low end-to-end delays between any two parties in the conference is a must, and the source sending rate in a session should adapt to bandwidth availability and congestion. We present Celerity, a multi-party conferencing solution specifically designed to achieve our objectives. It is entirely Peer-to-Peer(P2P), and as such eliminating the cost of maintaining centrally administered servers. It is designed to deliver video with low end-to-end delays, at quality levels commensurate with available network resources over arbitrary network topologies where bottlenecks can be anywhere in the network. This is in contrast to commonly assumed P2P scenarios where bandwidth bottlenecks reside only at the edge of the network. The highlight in our design is a distributed and adaptive rate control protocol, that can discover and adapt to arbitrary topologies and network conditions quickly, converging to efficient link rate allocations allowed by the underlying network. In accordance with adaptive link rate control, source video encoding rates are also dynamically controlled to op-timize video quality in arbitrary and unpredictable network conditions. Celerity runs on the application layer and uses UDP to deliver the data. With the distributed rate control protocol, Celerity can deliver video at quality levels without the acknowledge of the underlying network topology, bandwidth, and the routing. We have implemented Celerity in a prototype system, and demonstrateits su¬perior performance over existing solutions in a local experimental test bed and over the Internet. In addition, using Celerity we have developed a multi-party conferencing system which provides real-time video and audio communication and allows users to dynamically join and leave, it achieves better user experience(low delay and high throughput) than existing products. / Chen, Xiangwen. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2012. / Includes bibliographical references (leaves 66-68). / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.1 / Chapter 1.2 --- Contribution --- p.2 / Chapter 1.3 --- Thesis Organization --- p.4 / Chapter 2 --- Related Work --- p.5 / Chapter 3 --- Problem Formulation and Celerity Overview --- p.7 / Chapter 3.1 --- Settings --- p.7 / Chapter 3.2 --- Problem Formulation --- p.9 / Chapter 3.3 --- Celerity Overview --- p.10 / Chapter 4 --- Packing Delay-bounded Trees --- p.13 / Chapter 5 --- Overlay Link Rate Control --- p.18 / Chapter 5.1 --- Considering Both Delay and Loss --- p.18 / Chapter 5.2 --- A Loss-Delay Based Primal-Subgradient-Dual Algorithm --- p.20 / Chapter 5.3 --- Computing Subgradients of R{U+2098}(c{U+2098}, D) --- p.23 / Chapter 6 --- PRACTICAL IMPLEMENTATION --- p.26 / Chapter 6.1 --- Peer Functionality --- p.26 / Chapter 6.2 --- Critical Cut Calculation --- p.29 / Chapter 6.3 --- Utility Function --- p.29 / Chapter 6.4 --- Opportunistic Local Loss Recovery --- p.29 / Chapter 6.5 --- Fast Bootstrapping --- p.30 / Chapter 6.6 --- Operation Overhead --- p.30 / Chapter 6.7 --- Peer Computation Overhead --- p.31 / Chapter 6.8 --- System Implementation --- p.32 / Chapter 7 --- Experiments --- p.34 / Chapter 7.1 --- LAN Testbed Experiments --- p.34 / Chapter 7.1.1 --- Absence of Network Dynamics --- p.36 / Chapter 7.1.2 --- Cross Traffic --- p.39 / Chapter 7.1.3 --- Link Failure --- p.40 / Chapter 7.2 --- Peer Dynamics Experiments --- p.41 / Chapter 7.3 --- Internet Experiments --- p.42 / Chapter 8 --- Concluding Remarks --- p.46 / Chapter A --- Packing Delay-bounded Trees in the Presence of Helpers --- p.47 / Chapter B --- Proof of Theorem 1 and Theorem 3 --- p.50 / Chapter C --- Proof of Corollary 1 and Corollary 2 --- p.56 / Chapter D --- Proof of Proposition 1 --- p.58 / Chapter E --- Proof of Theorem 2 --- p.60 / Bibliography --- p.66

In peer-to-peer (P2P) systems, the phenomenon of churn (i.e., peer dynamics) will destroy the overlay structure, cause the loss of data objects, deteriorate the lookup performance, increase the bandwidth cost, and thus impact the performance of distributed applications greatly. Due to the prevalence of churn in real environments, it is essential to get a better understanding on how peer-to-peer systems evolve under churn and how to optimize the system performance under churn. In this thesis, we focus our research on the analysis and optimization of peer-to-peer systems under churn. Our research work falls into three main aspects: object storage under churn, object lookup under churn, and object (or load) balancing under churn. / Lastly, we study the effectiveness of two representative load balancing strategies in DHT-based P2P systems, (1) Rendezvous Directory Strategy (RDS) and (2) Independent Searching Strategy (ISS), under system churn. It enables us to have a clear understanding about their efficiency, scalability and robustness. Based on the analysis results, we also propose a Group Multicast Strategy (GMS) for load balancing in DHT systems, which attempts to achieve the benefits of both RDS and ISS. In order to have a better understanding of GMS, we also perform analytical studies on GMS in terms of its scalability and efficiency under churn. Finally, the effectiveness of GMS is evaluated by extensive simulation under different workload and churn levels. / Next, we consider the problem of optimizing lookup performance in DHT-based P2P systems under churn. We analytically study three important aspects on the optimization of DHT lookup performance, i.e., lookup strategy, lookup parallelism and lookup key replication. Our objective is to build a theoretical basis for the designers to make better choices in their future design. We first compare the performance of two representative lookup strategies - recursive routing and iterative routing, and explore the existence of better alternatives. Then we study the effectiveness of lookup parallelism in systems with different churn rates and show how to select the optimal degree of parallelism. Due to the importance of key replication on lookup performance, we also analyze the reliability of replicated keys under two different replication policies, and show how to perform proper configuration. Later, our results are also validated by simulation, and Kad is taken as a case to show the meaningfulness of our analysis. / We firstly develop a stochastic model to shed light on the evolution of stored objects in peer-to-peer systems under different types of churn, and analytically study the interplay between object maintenance and churn. To avoid the complexity of Markovian modeling, our model is based on stochastic differential equations, and thus we can provide closed-form terms to capture the system time-evolution, and formally derive asymptotic performance metrics of P2P storage systems under different maintenance strategies and various kinds of churn. Our analytical results provide some important insights in object maintenance under churn, which are useful in the optimization of P2P storage systems, e.g., reducing bandwidth usage, provisioning for bandwidth spike, improving system capacity, etc. Besides analytical study, our analysis is also validated by extensive simulation. / Wu, Di. / "July 2007." / Adviser: Kam-Wing Ng. / Source: Dissertation Abstracts International, Volume: 69-01, Section: B, page: 0443. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (p. 174-188). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese. / School code: 1307.

Zhao, Qiao. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 35-36). / Abstracts also in Chinese. / Abstract --- p.i / Acknowledgement --- p.v / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Model Description --- p.3 / Chapter 2.1 --- An Incentive Model for P2P Networks --- p.3 / Chapter 2.2 --- Learning Models for P2P Networks --- p.5 / Chapter 2.2.1 --- Current-best Learning Model (CBLM) --- p.5 / Chapter 2.2.2 --- Opportunistic Learning Model (OLM) --- p.6 / Chapter 2.3 --- Incentive Policies for P2P Networks --- p.7 / Chapter 2.3.1 --- Mirror Incentive Policy Vmirror --- p.8 / Chapter 2.3.2 --- Proportional Incentive Policy Vprop --- p.9 / Chapter 2.3.3 --- Linear Incentive Policy Class CLIP --- p.9 / Chapter 2.4 --- Performance and Robustness of Incentive Policies --- p.10 / Chapter 2.4.1 --- Robustness Analysis of Mirror Incentive Policy using the current-best learning method --- p.10 / Chapter 2.4.2 --- Robustness Analysis of Mirror Incentive Policy using the opportunistic learning method --- p.12 / Chapter 2.4.3 --- Robustness Analysis of Proportional Incentive Policy Using the current-best learning method --- p.12 / Chapter 2.4.4 --- Robustness Analysis of Proportional Incentive Policy Using the opportunistic learning method --- p.13 / Chapter 2.4.5 --- Robustness Analysis for Incentive Protocol in the Linear Incentive Class --- p.14 / Chapter 2.5 --- Connection with Evolutionary Game Theory --- p.17 / Chapter 3 --- Performance Evaluation --- p.21 / Chapter 3.1 --- Performance and Robustness of the Mirror Incentive Policy (Pmirror): --- p.21 / Chapter 3.2 --- Performance and Robustness of the Proportional Incentive Policy {Pprop): --- p.23 / Chapter 3.3 --- Performance and Robustness of incentive policy in the Linear Incentive Class (CLIP)： --- p.24 / Chapter 3.4 --- The Effect of Non-adaptive Peers: --- p.25 / Chapter 4 --- Adversary Effect of Altruism --- p.29 / Chapter 4.1 --- The Effect of Protocol Cost --- p.29 / Chapter 4.2 --- The Tradeoff between Altruism and System Robustness --- p.30 / Chapter 5 --- Related Work --- p.33 / Chapter 6 --- Conclusion --- p.34 / Bibliography --- p.35