This work evaluates the performance of Peer-to-Peer storage systems in structured Peer-to-Peer (P2P) networks under the impacts of a continuous process of nodes joining and leaving the network (Churn). Based on the Distributed Hash Tables (DHT), the peer-to-peer systems provide the means to store data among a large and dynamic set of participating host nodes. We consider the fact that existing solutions do not tolerate a high Churn rate or are not really scalable in terms of number of stored data blocks. The considered performance metrics include number of data blocks lost, bandwidth consumption, latencies and distance of matched lookups. We have selected Pastry, Chord and Kademlia to evaluate the e ect of inopportune connections/disconnections in Peer-to-Peer storage systems, because these selected P2P networks possess distinctive characteristics. Chord is one of the rst structured P2P networks that implements Distributed Hash Tables (DHTs). Similar to Chord, Pastry is based on a ring structure, with the identi er space forming the ring. However, Pastry uses a di erent algorithm than Chord to select the overlay neighbors of a peer. Kademlia is a more recent structured P2P network, with the XOR mechanism for improving distance calculation. DHT deployments are characterized by Churn. But if the frequency of Churn is too high, data blocks can be lost and lookup mechanism begin to incur delays. In architectures that employ DHTs, the choice of algorithm for data replication and maintenance can have a signi cant impact on the performance and reliability. PAST is a persistent Peer-to-Peer storage utility, which replicates complete les on multiple nodes, and uses Pastry for message routing and content location. The hypothesis is that by enhancing the Churn tolerance through building a really e cient replication and maintenance mechanisms, it will: i) Operate better than a peer-to-peer storage system such as PAST especially in replica placement strategy with a fewer data transfers. ii) Resolve le lookups with a match that is closer to the source peer, thus con- serving bandwidth. Our research will involve a series of simulation studies using two network simulators OverSim and OMNeT++. The main results are: Our approach achieves a higher data availability in presence of Churn, than the original PAST replication strategy; For a Churn occuring every minute our strategy loses two times less blocks than PAST; Our replication strategy induces an average of twice less block transfers than PAST.

Thesis PlanB (M.S.)--University of Wisconsin--Stout, 2008. / Includes bibliographical references.

Thesis (Ph. D.)--Ohio State University, 2004. / Title from first page of PDF file. Document formatted into pages; contains xix, 160 p.; also includes graphics. Includes bibliographical references (p. 150-160).

Thesis (M.S.)--University of Wyoming, 2008. / Title from PDF title page (viewed on Apr. 1, 2010). Includes bibliographical references (p. 32-33).

Thesis (Ph. D.)--University of Rhode Island, 2004. / Typescript. Includes bibliographical references (leaves 81-87).

Thesis (Ph. D.)--Computing, Georgia Institute of Technology, 2008. / Liu, Ling, Committee Chair ; Aberer, Karl, Committee Member ; Ahamad, Mustaque, Committee Member ; Blough, Douglas, Committee Member ; Pu, Calton, Committee Member ; Voruganti, Kaladhar, Committee Member.

Yang Qin. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves [65]-[67]). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Thesis Overview --- p.7 / Chapter 2 --- Storage Area Network(SAN) --- p.9 / Chapter 2.1 --- Fibre Channel Protocol --- p.11 / Chapter 2.2 --- Switched Fibre Channel SAN --- p.16 / Chapter 2.2.1 --- Cascaded Topology --- p.17 / Chapter 2.2.2 --- Meshed Topology --- p.17 / Chapter 2.2.3 --- Cross-Connected Topology --- p.19 / Chapter 2.2.4 --- Routing Scheme in Cross-Connected SAN --- p.21 / Chapter 3 --- Path Switching --- p.24 / Chapter 3.1 --- Cross-path Switching Principle --- p.24 / Chapter 3.2 --- Capacity Assignment --- p.28 / Chapter 3.3 --- Route Assignment --- p.31 / Chapter 4 --- Path Switching in Cross-Connected SAN --- p.34 / Chapter 4.1 --- Path Switching in SAN --- p.34 / Chapter 4.1.1 --- Connectionless Traffic --- p.36 / Chapter 4.1.2 --- Connection-Oriented Traffic --- p.39 / Chapter 4.1.3 --- Mixed Traffic --- p.47 / Chapter 4.2 --- Measurement Based Algorithm --- p.53 / Chapter 4.3 --- Repetition Rate --- p.59 / Chapter 5 --- Conclusion --- p.63

by Leung Yiu Tong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves 96-98). / Abstracts in English and Chinese. / Chapter 1. --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.1 / Chapter 1.2 --- Thesis Organization --- p.3 / Chapter 2. --- Storage Network Fundamentals --- p.4 / Chapter 2.1 --- Storage Network Topology --- p.4 / Chapter 2.1.1 --- Direct Attached Storage (DAS) --- p.5 / Chapter 2.1.2 --- Network Attached Storage (NAS) --- p.7 / Chapter 2.1.3 --- Storage Area Network (SAN) --- p.9 / Chapter 2.1.3.1 --- SAN and the Fibre Channel Protocol --- p.11 / Chapter 2.1.4 --- Summary on Storage Network Topology --- p.12 / Chapter 2.2 --- Storage Protocol --- p.15 / Chapter 2.2.1 --- Fibre Channel --- p.15 / Chapter 2.2.1.1 --- Fibre Channel over IP (FCIP) --- p.17 / Chapter 2.2.1.2 --- Internet Fibre Channel Protocol (iFCP) --- p.19 / Chapter 2.2.2 --- Internet SCSI (iSCSI) --- p.20 / Chapter 2.2.3 --- InfiniBand --- p.22 / Chapter 2.2.4 --- Review on Storage Network Protocol --- p.25 / Chapter 2.3 --- Standard Organization --- p.27 / Chapter 2.4 --- Summary --- p.28 / Chapter 3. --- Switching Design for Storage Networks --- p.30 / Chapter 3.1. --- Shared Bus Design --- p.32 / Chapter 3.2. --- Time Division Switch --- p.36 / Chapter 3.3. --- Share Buffer Memory Switch --- p.37 / Chapter 3.3.1 --- Parallel Memory Array --- p.40 / Chapter 3.3.2 --- Distributive Storage --- p.43 / Chapter 3.4. --- Crossbar Switch --- p.45 / Chapter 3.4.1 --- Arbitrated Crossbar vs. Buffered Crossbar --- p.46 / Chapter 3.4.1.1 --- Arbitrated Crossbar Switch --- p.47 / Chapter 3.4.1.2 --- Buffered Crossbar Switch --- p.48 / Chapter 3.4.2 --- Switch Scheduling --- p.49 / Chapter 3.4.2.1 --- Bipartite Matching --- p.50 / Chapter 3.4.2.2 --- Token-based Distributive Scheduling --- p.53 / Chapter 3.4.2.3 --- Resource Counting using Semaphore --- p.56 / Chapter 3.5. --- Algebraic Switches --- p.60 / Chapter 3.5.1 --- Switching by Conditionally Nonblocking Properties --- p.61 / Chapter 3.5.2 --- Self-Routing Mechanism with Zero-Bit Buffering --- p.64 / Chapter 3.5.3 --- Multistage Interconnection of Self-routing Concentrators --- p.69 / Chapter 3.6. --- Summary --- p.73 / Chapter 4. --- Investigating Switching Issue in Storage Networks --- p.74 / Chapter 4.1 --- Choosing a Suitable Switch --- p.74 / Chapter 4.2 --- Quality of Service (QoS) --- p.76 / Chapter 4.3 --- Multicasting --- p.77 / Chapter 4.3.1 --- Crossbar Switch --- p.78 / Chapter 4.3.2 --- Shared-Buffer Memory Switches --- p.80 / Chapter 4.3.3 --- Algebraic Switch --- p.82 / Chapter 4.3.4 --- Application on Multicast Transmission --- p.86 / Chapter 4.4 --- Load Balancing Mechanism --- p.87 / Chapter 4.5 --- Optimization on Storage Utilization --- p.91 / Chapter 4.6 --- Summary --- p.93 / Chapter 5. --- Conclusion and Summary of Original Contributions --- p.94

Thesis (M.S.)--State University of New York at Binghamton, Department of Computer Science, Thomas J. Watson School of Engineering and Applied Science, 2006. / Includes bibliographical references.

Thesis (M.S.)--University of Nevada, Reno, 2007. / "May, 2007." Includes bibliographical references (leaves 107-110). Online version available on the World Wide Web.