An Agenda for Robust Peer-to-Peer Storage
|
|
- Kenneth Camron Ford
- 6 years ago
- Views:
Transcription
1 An Agenda for Robust Peer-to-Peer Storage Rodrigo Rodrigues Massachusetts Institute of Technology Abstract Robust, large-scale storage is one of the main applications of DHTs and a main goal for the IRIS project. In this paper, we present a research agenda for the design and implementation of a robust storage system based on DHTs. We analyze previous research papers to conclude that a DHT for robust storage does not require some of the properties of existing DHTs (e.g., tolerating aggressive membership dynamics) but requires other properties that some DHTs do not possess (e.g., Byzantine fault tolerance). 1 Introduction The IRIS ITR [15] proposes a novel decentralized infrastructure based on distributed hash tables (DHTs) [7, 13, 19], that will enable a new generation of large-scale distributed applications. One proposed use for this infrastructure is to build a robust, shared storage infrastructure that will automatically inherit the robustness and scalability properties of the underlying DHT. DHTs are themselves built on top of peer-topeer lookup overlays [16, 18, 21, 23]. These overlays locate objects in the system using a very small amount of membership state at each node. This makes the object location algorithms robust to intermittent participation and scalable to many unreliable nodes with fast membership dynamics. In this paper we present an agenda for research in robust peer-to-peer storage. We summarize results from some of our previous research and present future guidelines for the design of peerto-peer storage systems. We begin this paper by analyzing the possible deployment scenario for a robust DHT (section 2). We summarize results from a previous paper that points out that storage availability and building a system from unreliable components are likely to be incompatible goals. In section 3 we investigate which characteristics of current DHT and peer-to-peer lookup proposals are beneficial and which ones are prejudicial, given that we are modifying the assumption about the deployment scenario of the system. Section 4 presents other design goals, and we conclude in section 5. 2 Peer Dynamics and Robust Storage Distributed hash tables build on peer-to-peer routing overlays to locate objects in the system despite large scale membership and aggressive membership dynamics. Some papers [1, 12] express a hope that, with extra data redundancy, storage can inherit scalability and robustness from the underlying lookup procedure, despite underlying node instability. This would allow building reliable and available peer-to-peer storage systems from highly unreliable components, notably volunteers that donate spare storage and bandwidth to the system. In a recent paper [2], we analyzed the bandwidth requirements for maintaining data redundancy in face of a dynamic membership. For this, we based ourselves on a conservative analytic model. The main conclusion of our study is that, even if we apply several optimizations such 1
2 as using space-efficient coding schemes or delayed response to failures, the bandwidth requirements to maintain redundancy for interesting data scales are prohibitive for home users. For instance, 10 million users with 25% availability and an average membership lifetime of 1 week, require an average upstream bandwidth of 50 kbps for data redundancy maintenance only, assuming each node donates 100 GB to the common storage. These numbers are not encouraging, and the situation tends to get worse given current hardware trends. Since available disk space is growing much faster than end-user bandwidth, it is likely that peers are going to be willing to donate more storage than their bandwidth allows them to. 2.1 How Dynamic are Peers? The bandwidth analysis mentioned before assumes nodes remain members of the overlay for a week. However, a recent study [20] showed that median session times in the Gnutella file sharing system were about an hour long. This makes the bandwidth requirements even higher for the example given above. However, we analyzed how we can change membership lifetimes by carefully distinguishing temporary disconnections from membership leaves. We looked at how the membership lifetimes from the Gnutella trace would change if we delayed response to failures, i.e., if we only considered a node to have departed from the membership if it was unreachable after a certain timeout value. Note that increasing the membership timeout will result in longer membership durations, but will also decrease the average node availability. Our study concluded that membership timeouts decrease membership dynamics by more than one order of magnitude, and are useful in decreasing bandwidth requirements to maintain robust peerto-peer storage for Gnutella-like peer dynamics. However, the bandwidth requirements are still prohibitive for home users. 2.2 Server-to-Server DHTs Our proposed solution to overcome this problem is to build DHTs from more reliable components than every volunteer s PC. These can be either dedicated machines or desktop machines in a large corporation, an academic institution, or federations thereof. (We call this a server-to-server system.) Studies show that the availability of machines in a large corporation is extremely high compared to the availability of Gnutella users [3]. Changing the deployment scenario raises an interesting question: how would one distinguish a server-to-server system from a garden variety distributed system? We believe that peer-to-peer systems have several interesting properties that are useful in a DHT, independently of the deployment scenario, such as: Self-configuration changes to the system membership, or reconfiguration due to failures can be addressed with minimal or no human intervention. Symmetry Due to the use of randomized algorithms such as consistent hashing [11], all nodes have identical responsibilities in storing the data, which helps in keeping the system automatically load-balanced despite membership changes. Scalability The first two points imply an interesting property of peer-to-peer systems: the desirable properties of the system (throughput, storage size, reliability, etc.) scale well just by adding nodes to the system. Therefore, our research agenda is to build a DHT that retains these advantages of peer-to-peer system, but drops the advantage of harnessing spare resources of volunteers that participate in the system. Note that in such a scenario Sybil 2
3 attacks [8] are much less of a threat to the system, since it is much easier to correlate entities and identities. 3 Lookup Infrastructure As mentioned, most DHTs use peer-to-peer lookup algorithms [16, 18, 21, 23] to locate objects in the system. These algorithms maintain a small amount of per-node routing state (typically Ç ÐÓ Æµ, or even Ç ½µ for some recent algorithms [10]), which allows the amount of bookkeeping to be small, despite expected aggressive membership dynamics. Unfortunately, keeping a small amount of routing state complicates the system in several ways. The most obvious one is that it introduces extra latency to the object lookup, due to the fact that this operation requires contacting several (possibly distant) nodes in sequence. Some applications can tolerate high latency lookups (e.g., archival backup), and furthermore lookup latency can be hidden if several lookups can be issued in parallel with object downloads. However, it is not clear if this is true about all applications. Other complications ensue from multi-hop lookups. Security is decreased if you contact several nodes in sequence, since one malicious node among all the nodes contacted may suffice to subvert (or at least slow down) the operation. Note that techniques have been proposed to probabilistically work around this problem [5], but to the expense of either taking risks about wrong lookups or increased lookup latency. Also, having limited information about the other nodes makes server selection for several purposes (e.g., picking the maximum bandwidth access) more complicated. We argue that robust peer-to-peer systems can keep complete routing information, and therefore overcome the limitations we mentioned. To prove this, we will consider all possible problems that may arise from keeping complete routing information. Bandwidth requirements One possible problem is that the bandwidth required to propagate all membership changes to all the nodes are excessive. In a recent paper [9] we examined the feasibility of a one hop lookup system where nodes keep complete routing information. This paper presented a design that, even with Gnutella-like session dynamics, had reasonable bandwidth requirements to maintain complete routing information (i.e., a few kbps for a ½¼¼ ¼¼¼ node system). Note that our previous research [2] found that true Gnutella membership dynamics are much less aggressive than session dynamics (if we distinguish temporary departures from membership changes as mentioned in section 2). Plus, our target deployment is much more stable than home users connected to Gnutella. Therefore bandwidth requirements are not going to make maintaining full routing information impossible. Memory requirements Another possible problem are the memory requirements for maintaining a complete routing table in primary memory. However, a simple calculation dismisses this problem. If we store, for each node, a 20-byte identifier (based on a SHA-1 hash) and a 6-byte IPv4 network address, the routing table for a 10 million node overlay would occupy only 260 MB. Even for such a large system, this would fit on the primary memory of commodity PCs that are sold nowadays. Therefore, we do not intend to incorporate peer-to-peer routing in our robust DHT, but instead keep a complete routing table and focus on other problems. Note that if the system maintains complete membership knowledge at each node, the data placement function becomes quite irrelevant: e.g., switching from using consistent hashing [11] to Pastry s nearest node metric [18] would be a trivial operation in such a system. 3
4 Even though we believe that peer-to-peer lookup algorithms are inadequate for robust storage systems, we do not advocate that these algorithms are useless. These might be convenient if the application in question tolerates high membership dynamics and the deployment scenario foresees a large and dynamic membership, or for applications that exploit the topology formed by the underlying location algorithm (e.g., application level multicast [4]). 4 Other Design Goals In this section we summarize other design guidelines we intend to incorporate in our robust peerto-peer storage system. We intend our system to survive catastrophic failures by making extensive use of wide-area replication. This contrasts with most dedicated storage systems where it is assumed that all replicas are connected by a fast network, and therefore failures are a stronger correlation than if the replicas were geographically diverse. We also want to provide tolerance to Byzantine faults. We believe Byzantine fault tolerance will be increasingly important in the future because malicious attacks and software errors are increasingly common and can cause faulty nodes to exhibit arbitrary behavior. Therefore, we are focusing on a Byzantine failure model. Note that Byzantine-fault-tolerant replication requires more bandwidth than fail-stop replication, due to the increased redundancy requirements to tolerate arbitrary failures. However, the deployment scenario presented in Section 2 implies that data transfers should be rare, and also the bandwidth requirements can be minimized using efficient coding schemes [22]. Note that Oceanstore [13] is a DHT that can offer Byzantine fault tolerance by using a small number of primary tier replicas that serialize updates using the BFT protocol [6]. Our current research is focusing on designing algorithms that work better than BFT on a wide area network. This is challenging since we are trying to provide strong semantics while minimizing the number of network round trips. Plus, our algorithms have to work in a dynamic setting where the replicas for a particular data item will change throughout the execution. This dynamic behavior is not tolerated by most Byzantine-fault-tolerant replication algorithms. Our system should also allow applications to choose slightly weaker semantics (e.g., sequential consistency [14]) in order to improve performance. 5 Conclusions In this paper we presented design guidelines for a robust peer-to-peer storage system. We analyzed previous research and concluded that we had to part from existing DHTs in the deployment scenario and the object location algorithms. A preliminary design for such a system appeared in a previous publication [17], even though it did not include some of the characteristics we mentioned previously. In the future, we intend to present a complete design and implementation that incorporate the guidelines in this paper, and deploy it in a widearea testbed. Acknowledgements The author thanks Chuck Blake and Barbara Liskov for helpful discussions on the topic of this paper. This research is supported by DARPA under contract F monitored by the Air Force Research Laboratory, NSF Grant IIS , and a Praxis XXI fellowship. References [1] H. Balakrishnan, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Looking up data in P2P systems. Communications of the ACM, pages 43 48, Feb
5 [2] C. Blake and R. Rodrigues. High availability, scalable storage, dynamic peer networks: Pick two. In Proc. of the Ninth Workshop on Hot Topics in Operating Systems (HotOS-IX), Lihue, HI, May [3] W. J. Bolosky, J. R. Douceur, D. Ely, and M. Theimer. Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In Proc. ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, June [4] M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron. SCRIBE: A large-scale and decentralised application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications (JSAC), [5] M. Castro, P. Druschell, A. Ganesh, A. Rowstron, and D. S. Wallach. Security for structured peer-to-peer overlay networks. In Proceedings of the 5th OSDI, Boston, Massachusetts, Dec [6] M. Castro and B. Liskov. Practical Byzantine Fault Tolerance. In Proceedings of the Third Symposium on Operating Systems Design and Implementation (OSDI), New Orleans, LA, Feb [7] F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proc. 18th ACM Symposium on Operating System Principles, Banff, Canada, Oct [8] J. Douceur. The sybil attack. In Proc. 1st International Workshop on Peer-to-Peer Systems. [9] A. Gupta, B. Liskov, and R. Rodrigues. One hop lookups for peer-to-peer overlays. In Proc. of the Ninth Workshop on Hot Topics in Operating Systems (HotOS-IX), Lihue, HI, May [10] M. F. Kaashoek and D. Karger. Koorde: A simple degree-optimal hash table. In Proc. of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS 03), Berkeley, CA, Feb [11] D. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages , El Paso, TX, May [12] J. Kubiatowicz. Extracting guarantees from chaos. Communications of the ACM, pages 33 38, Feb [13] J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. OceanStore: An architecture for global-scale persistent storage. In Proc.9th international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), pages , Boston, MA, November [14] L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C- 28(9): , [15] NSF ITR : Robust large-scale distributed systems. [16] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proc. ACM SIGCOMM 01 Conference, San Diego, CA, Aug [17] R. Rodrigues, B. Liskov, and L. Shrira. The design of a robust peer-to-peer system. In Proc. of the Tenth ACM SIGOPS European Workshop, Saint Emilion, France, Sept [18] A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for larges cale peer-to-peer systems. In Proc. IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), Heidelberg, Germany, Nov [19] A. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proc. 18th 5
6 ACM Symposium on Operating System Principles, Banff, Canada, Oct [20] S. Saroiu, P. K. Gummadi, and S. Gribble. A measurement study of peer-to-peer file sharing systems. In Proc. Multimedia Computing and Networking 2002 (MMCN 02), Jan [21] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peerto-peer lookup service for internet applications. In Proc. ACM SIGCOMM 01 Conference, San Diego, CA, Aug [22] H. Weatherspoon and J. D. Kubiatowicz. Erasure coding vs. replication: A quantitative comparison. In Proc. 1st International Workshop on Peer-to-Peer Systems (IPTPS 02), Cambridge, MA, Mar [23] B. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD , UC Berkeley, Apr
Should we build Gnutella on a structured overlay? We believe
Should we build on a structured overlay? Miguel Castro, Manuel Costa and Antony Rowstron Microsoft Research, Cambridge, CB3 FB, UK Abstract There has been much interest in both unstructured and structured
More informationDistributed Hash Table
Distributed Hash Table P2P Routing and Searching Algorithms Ruixuan Li College of Computer Science, HUST rxli@public.wh.hb.cn http://idc.hust.edu.cn/~rxli/ In Courtesy of Xiaodong Zhang, Ohio State Univ
More informationA Super-Peer Based Lookup in Structured Peer-to-Peer Systems
A Super-Peer Based Lookup in Structured Peer-to-Peer Systems Yingwu Zhu Honghao Wang Yiming Hu ECECS Department ECECS Department ECECS Department University of Cincinnati University of Cincinnati University
More informationLessLog: A Logless File Replication Algorithm for Peer-to-Peer Distributed Systems
LessLog: A Logless File Replication Algorithm for Peer-to-Peer Distributed Systems Kuang-Li Huang, Tai-Yi Huang and Jerry C. Y. Chou Department of Computer Science National Tsing Hua University Hsinchu,
More informationAdaptive Replication and Replacement in P2P Caching
Adaptive Replication and Replacement in P2P Caching Jussi Kangasharju Keith W. Ross Abstract Caching large audio and video files in a community of peers is a compelling application for P2P. Assuming an
More informationProviding Administrative Control and Autonomy in Structured Peer-to-Peer Overlays
Providing Administrative Control and Autonomy in Structured Peer-to-Peer Overlays Alan Mislove Peter Druschel Rice University, Houston, TX, USA Abstract Structured peer-to-peer (p2p) overlay networks provide
More informationWhen Multi-Hop Peer-to-Peer Lookup Matters
When Multi-Hop Peer-to-Peer Lookup Matters Rodrigo Rodrigues Charles Blake rodrigo@csail.mit.edu cb@mit.edu MIT Computer Science and Artificial Intelligence Laboratory Abstract Distributed hash tables
More informationSelf-Organizing Subsets: From Each According to His Abilities, To Each According to His Needs
Self-Organizing Subsets: From Each According to His Abilities, To Each According to His Needs Amin Vahdat, Jeff Chase, Rebecca Braynard, Dejan Kostić, Patrick Reynolds, and Adolfo Rodriguez Λ Department
More informationEvolution of Peer-to-peer algorithms: Past, present and future.
Evolution of Peer-to-peer algorithms: Past, present and future. Alexei Semenov Helsinki University of Technology alexei.semenov@hut.fi Abstract Today peer-to-peer applications are widely used for different
More informationProceedings of HotOS IX: The 9th Workshop on Hot Topics in Operating Systems
USENIX Association Proceedings of HotOS IX: The 9th Workshop on Hot Topics in Operating Systems Lihue, Hawaii, USA May 18 21, 2003 THE ADVANCED COMPUTING SYSTEMS ASSOCIATION 2003 by The USENIX Association
More informationProactive Caching for Better than Single-Hop Lookup Performance
Proactive Caching for Better than Single-Hop Lookup Performance Venugopalan Ramasubramanian and Emin Gün Sirer Cornell University, Ithaca NY 4853 ramasv, egs @cs.cornell.edu Abstract High lookup latencies
More informationThe Design of a Robust Peer-to-Peer System
The Design of a Robust Peer-to-Peer System Rodrigo Rodrigues, Barbara Liskov, Liuba Shrira MIT Laboratory for Computer Science rodrigo, liskov, liuba @lcs.mit.edu Abstract Peer-to-peer (P2P) overlay networks
More informationOn Object Maintenance in Peer-to-Peer Systems
On Object Maintenance in Peer-to-Peer Systems Kiran Tati and Geoffrey M. Voelker Department of Computer Science and Engineering University of California, San Diego 1. INTRODUCTION Storage is often a fundamental
More informationDefending against Eclipse attacks on overlay networks
Defending against Eclipse attacks on overlay networks Atul Singh 1 Miguel Castro 2 Peter Druschel 1 Antony Rowstron 2 1 Rice University, Houston, TX, USA. 2 Microsoft Research, Cambridge, UK. Abstract
More informationSecurity Considerations for Peer-to-Peer Distributed Hash Tables
Security Considerations for Peer-to-Peer Distributed Hash Tables Emil Sit and Robert Morris Laboratory for Computer Science, MIT 200 Technology Square, Cambridge, MA 02139, USA {sit,rtm}@lcs.mit.edu Abstract.
More informationA Chord-Based Novel Mobile Peer-to-Peer File Sharing Protocol
A Chord-Based Novel Mobile Peer-to-Peer File Sharing Protocol Min Li 1, Enhong Chen 1, and Phillip C-y Sheu 2 1 Department of Computer Science and Technology, University of Science and Technology of China,
More informationA Structured Overlay for Non-uniform Node Identifier Distribution Based on Flexible Routing Tables
A Structured Overlay for Non-uniform Node Identifier Distribution Based on Flexible Routing Tables Takehiro Miyao, Hiroya Nagao, Kazuyuki Shudo Tokyo Institute of Technology 2-12-1 Ookayama, Meguro-ku,
More informationShaking Service Requests in Peer-to-Peer Video Systems
Service in Peer-to-Peer Video Systems Ying Cai Ashwin Natarajan Johnny Wong Department of Computer Science Iowa State University Ames, IA 500, U. S. A. E-mail: {yingcai, ashwin, wong@cs.iastate.edu Abstract
More informationLarge-Scale Byzantine Fault Tolerance: Safe but Not Always Live
Large-Scale Byzantine Fault Tolerance: Safe but Not Always Live Rodrigo Rodrigues INESC-ID and Technical University of Lisbon Petr Kouznetsov Max Planck Institute for Software Systems Bobby Bhattacharjee
More informationSubway : Peer-To-Peer Clustering of Clients for Web Proxy
Subway : Peer-To-Peer Clustering of Clients for Web Proxy Kyungbaek Kim and Daeyeon Park Department of Electrical Engineering & Computer Science, Division of Electrical Engineering, Korea Advanced Institute
More informationSurvey of DHT Evaluation Methods
Survey of DHT Evaluation Methods Markus Meriläinen Helsinki University of Technology Markus.Merilainen@tkk.fi Abstract In this paper, we present an overview of factors affecting the performance of the
More informationPeer-to-Peer Web Caching: Hype or Reality?
Peer-to-Peer Web Caching: Hype or Reality? Yonggen Mao, Zhaoming Zhu, and Weisong Shi Wayne State University {yoga,zhaoming,weisong}@wayne.edu Abstract In this paper, we systematically examine the design
More informationDynamic Load Sharing in Peer-to-Peer Systems: When some Peers are more Equal than Others
Dynamic Load Sharing in Peer-to-Peer Systems: When some Peers are more Equal than Others Sabina Serbu, Silvia Bianchi, Peter Kropf and Pascal Felber Computer Science Department, University of Neuchâtel
More informationBuilding a low-latency, proximity-aware DHT-based P2P network
Building a low-latency, proximity-aware DHT-based P2P network Ngoc Ben DANG, Son Tung VU, Hoai Son NGUYEN Department of Computer network College of Technology, Vietnam National University, Hanoi 144 Xuan
More informationDYNAMIC TREE-LIKE STRUCTURES IN P2P-NETWORKS
DYNAMIC TREE-LIKE STRUCTURES IN P2P-NETWORKS Herwig Unger Markus Wulff Department of Computer Science University of Rostock D-1851 Rostock, Germany {hunger,mwulff}@informatik.uni-rostock.de KEYWORDS P2P,
More informationEarly Measurements of a Cluster-based Architecture for P2P Systems
Early Measurements of a Cluster-based Architecture for P2P Systems Balachander Krishnamurthy, Jia Wang, Yinglian Xie I. INTRODUCTION Peer-to-peer applications such as Napster [4], Freenet [1], and Gnutella
More informationStorage and Network Resource Usage in Reactive and Proactive Replicated Storage Systems
Storage and Network Resource Usage in Reactive and Proactive Replicated Storage Systems Rossana Motta and Joseph Pasquale Department of Computer Science and Engineering University of California San Diego
More informationUC Berkeley UC Berkeley Previously Published Works
UC Berkeley UC Berkeley Previously Published Works Title Impact of neighbor selection on performance and resilience of structured P2P networks Permalink https://escholarship.org/uc/item/9tq2wn2 Authors
More informationTime-related replication for p2p storage system
Seventh International Conference on Networking Time-related replication for p2p storage system Kyungbaek Kim E-mail: University of California, Irvine Computer Science-Systems 3204 Donald Bren Hall, Irvine,
More informationDistriubted Hash Tables and Scalable Content Adressable Network (CAN)
Distriubted Hash Tables and Scalable Content Adressable Network (CAN) Ines Abdelghani 22.09.2008 Contents 1 Introduction 2 2 Distributed Hash Tables: DHT 2 2.1 Generalities about DHTs............................
More informationLoad Balancing in Structured P2P Systems
1 Load Balancing in Structured P2P Systems Ananth Rao Karthik Lakshminarayanan Sonesh Surana Richard Karp Ion Stoica fananthar, karthik, sonesh, karp, istoicag@cs.berkeley.edu Abstract Most P2P systems
More informationDecentralized Object Location In Dynamic Peer-to-Peer Distributed Systems
Decentralized Object Location In Dynamic Peer-to-Peer Distributed Systems George Fletcher Project 3, B649, Dr. Plale July 16, 2003 1 Introduction One of the key requirements for global level scalability
More informationOverlay Networks for Multimedia Contents Distribution
Overlay Networks for Multimedia Contents Distribution Vittorio Palmisano vpalmisano@gmail.com 26 gennaio 2007 Outline 1 Mesh-based Multicast Networks 2 Tree-based Multicast Networks Overcast (Cisco, 2000)
More informationPastis: a Highly-Scalable Multi-User Peer-to-Peer File System
Pastis: a Highly-Scalable Multi-User Peer-to-Peer File System Jean-Michel Busca 1, Fabio Picconi 2, and Pierre Sens 2 1 INRIA Rocquencourt Le Chesnay, France jean-michel.busca@inria.fr 2 LIP6, Université
More informationThe Lonely NATed Node
The Lonely NATed Node Chad Yoshikawa *, Brent Chun, Amin Vahdat, Fred Annexstein *, and Ken Berman * * University of Cincinnati {yoshikco,annexste,berman}@ececs.uc.edu Intel Research Berkeley bnc@intel-research.net
More informationThe Lonely NATed Node
The Lonely NATed Node Chad Yoshikawa University of Cincinnati yoshikco@ececs.uc.edu Brent Chun Intel Research Berkeley bnc@intel-research.net Amin Vahdat U.C. San Diego vahdat@cs.ucsd.edu Abstract In this
More informationPAST: A large-scale, persistent peer-to-peer storage utility
PAST: A large-scale, persistent peer-to-peer storage utility Peter Druschel Rice University, Houston, TX 77005, USA druschel@cs.rice.edu Antony Rowstron Microsoft Research, Cambridge, CB2 3NH, UK antr@microsoft.com
More informationAn Efficient and Secure Peer-to-Peer Overlay Network
An Efficient and Secure Peer-to-Peer Overlay Network Honghao Wang, Yingwu Zhu and Yiming Hu Department of Electrical & Computer Engineering and Computer Science University of Cincinnati {wanghong, zhuy,
More informationA Directed-multicast Routing Approach with Path Replication in Content Addressable Network
2010 Second International Conference on Communication Software and Networks A Directed-multicast Routing Approach with Path Replication in Content Addressable Network Wenbo Shen, Weizhe Zhang, Hongli Zhang,
More informationReducing Outgoing Traffic of Proxy Cache by Using Client-Cluster
Reducing Outgoing Traffic of Proxy Cache by Using Client-Cluster Kyungbaek Kim and Daeyeon Park Abstract: Many web cache systems and policies concerning them have been proposed. These studies, however,
More informationExploiting Semantic Clustering in the edonkey P2P Network
Exploiting Semantic Clustering in the edonkey P2P Network S. Handurukande, A.-M. Kermarrec, F. Le Fessant & L. Massoulié Distributed Programming Laboratory, EPFL, Switzerland INRIA, Rennes, France INRIA-Futurs
More informationA Peer-to-Peer Architecture to Enable Versatile Lookup System Design
A Peer-to-Peer Architecture to Enable Versatile Lookup System Design Vivek Sawant Jasleen Kaur University of North Carolina at Chapel Hill, Chapel Hill, NC, USA vivek, jasleen @cs.unc.edu Abstract The
More informationStaggeringly Large File Systems. Presented by Haoyan Geng
Staggeringly Large File Systems Presented by Haoyan Geng Large-scale File Systems How Large? Google s file system in 2009 (Jeff Dean, LADIS 09) - 200+ clusters - Thousands of machines per cluster - Pools
More informationTowards a Common API for Structured Peer-to-Peer Overlays
Towards a Common API for Structured Peer-to-Peer Overlays Frank Dabek Ben Zhao Peter Druschel John Kubiatowicz Ion Stoica MIT Laboratory for Computer Science, Cambridge, MA. University of California, Berkeley,
More informationImproving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities
Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities Kavitha Ranganathan, Adriana Iamnitchi, Ian Foster Department of Computer Science, The University
More informationEfficient Reliable Internet Storage
Efficient Reliable Internet Storage Robbert van Renesse Dept. of Computer Science, Cornell University rvr@cs.cornell.edu Abstract This position paper presents a new design for an Internetwide peer-to-peer
More informationScalable and Self-configurable Eduroam by using Distributed Hash Table
Scalable and Self-configurable Eduroam by using Distributed Hash Table Hiep T. Nguyen Tri, Rajashree S. Sokasane, Kyungbaek Kim Dept. Electronics and Computer Engineering Chonnam National University Gwangju,
More informationData Indexing and Querying in DHT Peer-to-Peer Networks
Institut EURECOM Research Report N o 73 RR-03-073 Data Indexing and Querying in DHT Peer-to-Peer Networks P.A. Felber, E.W. Biersack, L. Garcés-Erice, K.W. Ross, G. Urvoy-Keller January 15, 2003 2 Data
More informationScalability In Peer-to-Peer Systems. Presented by Stavros Nikolaou
Scalability In Peer-to-Peer Systems Presented by Stavros Nikolaou Background on Peer-to-Peer Systems Definition: Distributed systems/applications featuring: No centralized control, no hierarchical organization
More informationDorina Luminiţa COPACI, Constantin Alin COPACI
THE DESIGN OF RESILIENCE P2P NETWORKS WITH DISTRIBUTED HASH TABLES Dorina Luminiţa COPACI, Constantin Alin COPACI lcopaci@yahoo.com, acopaci@yahoo.com Abstract The term resilience in computer systems and
More informationComparing Chord, CAN, and Pastry Overlay Networks for Resistance to DoS Attacks
Comparing Chord, CAN, and Pastry Overlay Networks for Resistance to DoS Attacks Hakem Beitollahi Hakem.Beitollahi@esat.kuleuven.be Geert Deconinck Geert.Deconinck@esat.kuleuven.be Katholieke Universiteit
More informationAP3: Cooperative, decentralized anonymous communication
AP3: Cooperative, decentralized anonymous communication Alan Mislove Gaurav Oberoi Ansley Post Charles Reis Peter Druschel Dan S. Wallach Rice University, Houston, TX, USA University of Washington, Seattle,
More informationA Method for Designing Proximity-aware Routing Algorithms for Structured Overlays
A Method for Designing Proximity-aware Routing Algorithms for Structured Overlays Takehiro Miyao, Hiroya Nagao, Kazuyuki Shudo Tokyo Institute of Technology 2-12-1 Ookayama, Meguro-ku, Tokyo, JAPAN Email:
More informationTowards Scalable and Robust Overlay Networks
Towards Scalable and Robust Overlay Networks Baruch Awerbuch Department of Computer Science Johns Hopkins University Baltimore, MD 21218, USA baruch@cs.jhu.edu Christian Scheideler Institute for Computer
More informationAn Empirical Study of Data Redundancy for High Availability in Large Overlay Networks
An Empirical Study of Data Redundancy for High Availability in Large Overlay Networks Giovanni Chiola Dipartimento di Informatica e Scienze dell Informazione (DISI) Università di Genova, 35 via Dodecaneso,
More informationData Replication under Latency Constraints Siu Kee Kate Ho
Data Replication under Latency Constraints Siu Kee Kate Ho (siho@cs.brown.edu) Abstract To maintain good quality of service, data providers have to satisfy requests within some specified amount of time.
More informationImpact of Neighbor Selection on Performance and Resilience of Structured P2P Networks
Impact of Neighbor Selection on Performance and Resilience of Structured P2P Networks Byung-Gon Chun, Ben Y. Zhao 2, and John D. Kubiatowicz Computer Science Division, U.C. Berkeley {bgchun, kubitron}@cs.berkeley.edu
More informationDesign of a New Hierarchical Structured Peer-to-Peer Network Based On Chinese Remainder Theorem
Design of a New Hierarchical Structured Peer-to-Peer Network Based On Chinese Remainder Theorem Bidyut Gupta, Nick Rahimi, Henry Hexmoor, and Koushik Maddali Department of Computer Science Southern Illinois
More informationBrocade: Landmark Routing on Overlay Networks
Abstract Brocade: Landmark Routing on Overlay Networks CS262A Fall 2001 Yitao Duan, Ling Huang University of California, Berkeley duan@cs.berkeley.edu, hlion@newton.berkeley.edu Peer-to-peer networks offer
More informationFault Resilience of Structured P2P Systems
Fault Resilience of Structured P2P Systems Zhiyu Liu 1, Guihai Chen 1, Chunfeng Yuan 1, Sanglu Lu 1, and Chengzhong Xu 2 1 National Laboratory of Novel Software Technology, Nanjing University, China 2
More informationAthens University of Economics and Business. Dept. of Informatics
Athens University of Economics and Business Athens University of Economics and Business Dept. of Informatics B.Sc. Thesis Project report: Implementation of the PASTRY Distributed Hash Table lookup service
More informationAggregation of a Term Vocabulary for P2P-IR: a DHT Stress Test
Aggregation of a Term Vocabulary for P2P-IR: a DHT Stress Test Fabius Klemm and Karl Aberer School of Computer and Communication Sciences Ecole Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland
More informationModifying the Overlay Network of Freenet-style Peer-to-Peer Systems after Successful Request Queries
Modifying the Overlay Network of Freenet-style Peer-to-Peer Systems after Successful Request Queries Jens Mache, David Ely, Melanie Gilbert, Jason Gimba, Thierry Lopez and Matthew Wilkinson Lewis & Clark
More informationD1HT: A Distributed One Hop Hash Table
D1HT: A Distributed One Hop Hash Table Luiz R. Monnerat, and Claudio L. Amorim COPPE - Computer and Systems Engineering TI/TI-E&P/STEP Federal University of Rio de Janeiro PETROBRAS {monnerat,claudio}@cos.ufrj.br
More informationBOOTSTRAPPING LOCALITY-AWARE P2P NETWORKS
BOOTSTRAPPING LOCALITY-AWARE PP NETWORKS Curt Cramer, Kendy Kutzner, and Thomas Fuhrmann Institut für Telematik, Universität Karlsruhe (TH), Germany {curt.cramer kendy.kutzner thomas.fuhrmann}@ira.uka.de
More informationArchitectures for Distributed Systems
Distributed Systems and Middleware 2013 2: Architectures Architectures for Distributed Systems Components A distributed system consists of components Each component has well-defined interface, can be replaced
More informationA Distributed Codec Placement Algorithm for Network-Embedded FEC
A Distributed Codec Placement Algorithm for Network-Embedded FEC Mingquan Wu and Hayder Radha Department of Electrical and Computer Engineering Michigan State University East Lansing, MI 48823 {wumingqu,
More informationA Comparison Of Replication Strategies for Reliable Decentralised Storage
36 JOURNAL OF NETWORKS, VOL. 1, NO. 6, NOVEMBER/DECEMBER 26 A Comparison Of Replication Strategies for Reliable Decentralised Storage Matthew Leslie 1,2, Jim Davies 1, and Todd Huffman 2 1 Oxford University
More informationProblems in Reputation based Methods in P2P Networks
WDS'08 Proceedings of Contributed Papers, Part I, 235 239, 2008. ISBN 978-80-7378-065-4 MATFYZPRESS Problems in Reputation based Methods in P2P Networks M. Novotný Charles University, Faculty of Mathematics
More informationMULTI-DOMAIN VoIP PEERING USING OVERLAY NETWORK
116 MULTI-DOMAIN VoIP PEERING USING OVERLAY NETWORK Herry Imanta Sitepu, Carmadi Machbub, Armein Z. R. Langi, Suhono Harso Supangkat School of Electrical Engineering and Informatics, Institut Teknologi
More informationComparing the performance of distributed hash tables under churn
Comparing the performance of distributed hash tables under churn Jinyang Li, Jeremy Stribling, Thomer M. Gil, Robert Morris, M. Frans Kaashoek MIT Computer Science and Artificial Intelligence Laboratory
More informationFlexible Information Discovery in Decentralized Distributed Systems
Flexible Information Discovery in Decentralized Distributed Systems Cristina Schmidt and Manish Parashar The Applied Software Systems Laboratory Department of Electrical and Computer Engineering, Rutgers
More informationChallenges in the Wide-area. Tapestry: Decentralized Routing and Location. Global Computation Model. Cluster-based Applications
Challenges in the Wide-area Tapestry: Decentralized Routing and Location System Seminar S 0 Ben Y. Zhao CS Division, U. C. Berkeley Trends: Exponential growth in CPU, b/w, storage Network expanding in
More informationExploiting the Synergy between Peer-to-Peer and Mobile Ad Hoc Networks
Exploiting the Synergy between Peer-to-Peer and Mobile Ad Hoc Networks Y. Charlie Hu, Saumitra M. Das, and Himabindu Pucha Purdue University West Lafayette, IN 47907 {ychu, smdas, hpucha}@purdue.edu Abstract
More informationUnderstanding Availability
Understanding Availability Ranjita Bhagwan, Stefan Savage and Geoffrey M. Voelker Department of Computer Science and Engineering University of California, San Diego Abstract This paper addresses a simple,
More informationPeer Clustering and Firework Query Model in the Peer-to-Peer Network
Peer Clustering and Firework Query Model in the Peer-to-Peer Network Cheuk Hang Ng SAR chng@cse.cuhk.edu.hk Chi Hang Chan SAR chchan@cse.cuhk.edu.hk Ka Cheung Sia SAR kcsia@cse.cuhk.edu.hk Irwin King SAR
More informationNodeId Verification Method against Routing Table Poisoning Attack in Chord DHT
NodeId Verification Method against Routing Table Poisoning Attack in Chord DHT 1 Avinash Chaudhari, 2 Pradeep Gamit 1 L.D. College of Engineering, Information Technology, Ahmedabad India 1 Chaudhari.avi4u@gmail.com,
More informationPeer-to-peer computing research a fad?
Peer-to-peer computing research a fad? Frans Kaashoek kaashoek@lcs.mit.edu NSF Project IRIS http://www.project-iris.net Berkeley, ICSI, MIT, NYU, Rice What is a P2P system? Node Node Node Internet Node
More informationZoned Federation of Game Servers: a Peer-to-peer Approach to Scalable Multi-player Online Games
Zoned Federation of Game Servers: a Peer-to-peer Approach to Scalable Multi-player Online Games Takuji Iimura takuji-i@is.naist.jp Hiroaki Hazeyama hiroa-ha@is.naist.jp Youki Kadobayashi youki-k@is.naist.jp
More informationCS555: Distributed Systems [Fall 2017] Dept. Of Computer Science, Colorado State University
CS 555: DISTRIBUTED SYSTEMS [P2P SYSTEMS] Shrideep Pallickara Computer Science Colorado State University Frequently asked questions from the previous class survey Byzantine failures vs malicious nodes
More informationA Simple Fault Tolerant Distributed Hash Table
A Simple ault Tolerant Distributed Hash Table Moni Naor Udi Wieder Abstract We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation We show two lookup algorithms The
More informationDistributed Hash Tables in P2P Network: Detection and. Prevention of Threats and Vulnerability
Distributed Hash Tables in P2P Network: Detection and Prevention of Threats and Vulnerability Mohammad Naderuzzman (Corresponding Author) Department of Computer Science & Engineering Dhaka University of
More informationEnforcing Fair Sharing of Peer-to-Peer Resources
Enforcing Fair Sharing of Peer-to-Peer Resources Tsuen-Wan Johnny Ngan, Dan S. Wallach, and Peter Druschel Department of Computer Science, Rice University twngan,dwallach,druschel @cs.rice.edu Abstract
More informationA Framework for Peer-To-Peer Lookup Services based on k-ary search
A Framework for Peer-To-Peer Lookup Services based on k-ary search Sameh El-Ansary Swedish Institute of Computer Science Kista, Sweden Luc Onana Alima Department of Microelectronics and Information Technology
More informationTowards a Scalable Distributed Information Management System
Towards a Praveen Yalagandula and Mike Dahlin University of Texas at Austin Abstract This paper makes a case for developing a general large-scale networked systems, provides detailed views of nearby information
More informationDiscovery of Stable Peers in a Self-Organising Peer-to-Peer Gradient Topology
Discovery of Stable Peers in a Self-Organising Peer-to-Peer Gradient Topology Jan Sacha, Jim Dowling, Raymond Cunningham, and René Meier Distributed Systems Group, Trinity College, Dublin {jsacha,jdowling,rcnnnghm,rmeier}@cs.tcd.ie
More informationPIC: Practical Internet Coordinates for Distance Estimation
PIC: Practical Internet Coordinates for Distance Estimation Manuel Costa, Miguel Castro, Antony Rowstron, and Peter Key Microsoft Research, Cambridge, CB3 FB, UK Abstract This paper introduces PIC, a practical
More informationTowards a Common API for Structured Peer-to-Peer Overlays Λ
Appears in Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS 03). Towards a Common API for Structured Peer-to-Peer Overlays Λ Frank Dabek 1 Ben Zhao 2 Peter Druschel 3 John Kubiatowicz
More informationFPN: A Distributed Hash Table for Commercial Applications
FPN: A Distributed Hash Table for Commercial Applications Cezary Dubnicki, Cristian Ungureanu, Wojciech Kilian NEC Laboratories Princeton, NJ, USA {dubnicki, cristian, wkilian}@nec-labs.com Abstract Distributed
More informationOn Name Resolution in Peer-to-Peer Networks
On Name Resolution in Peer-to-Peer Networks Xiaozhou Li C. Greg Plaxton ABSTRACT An efficient name resolution scheme is the cornerstone of any peerto-peer network. The name resolution scheme proposed by
More informationEnabling High Data Availability in a DHT
Enabling High Data Availability in a DHT Predrag Knežević 1, Andreas Wombacher 2, Thomas Risse 1 1 Fraunhofer IPSI 2 University of Twente Integrated Publication and Information Systems Institute Department
More informationIntelligent Neighbor Selection in P2P with CapProbe and Vivaldi
1 Intelligent Neighbor Selection in P2P with CapProbe and Vivaldi Michael Parker, Amir Nader-Tehrani, Alok Nandan, Giovanni Pau Computer Science Department University of California Los Angeles Los Angeles,
More informationThe Effect of Replica Placement on Routing Robustness in Distributed Hash Tables
The Effect of Replica Placement on Routing Robustness in Distributed Hash Tables Cyrus Harvesf and Douglas M. Blough Georgia Institute of Technology School of Electrical and Computer Engineering Atlanta,
More informationA Hybrid Peer-to-Peer Architecture for Global Geospatial Web Service Discovery
A Hybrid Peer-to-Peer Architecture for Global Geospatial Web Service Discovery Shawn Chen 1, Steve Liang 2 1 Geomatics, University of Calgary, hschen@ucalgary.ca 2 Geomatics, University of Calgary, steve.liang@ucalgary.ca
More informationStructured Peer-to-Peer Overlays Need Application-Driven Benchmarks
Structured Peer-to-Peer Overlays Need Application-Driven Benchmarks Sean Rhea, Timothy Roscoe, and John Kubiatowicz IRB-TR-3-2 February, 23 Proceedings of the 2 nd International Peer-to-Peer Systems Workshop
More informationIN recent years, the amount of traffic has rapidly increased
, March 15-17, 2017, Hong Kong Content Download Method with Distributed Cache Management Masamitsu Iio, Kouji Hirata, and Miki Yamamoto Abstract This paper proposes a content download method with distributed
More informationPeer-to-Peer workload characterization: techniques and open issues
Peer-to-Peer workload characterization: techniques and open issues Mauro Andreolini University of Rome Tor Vergata andreolini@ing.uniroma2.it Michele Colajanni University of Modena and Reggio Emilia colajanni.michele@unimore.it
More informationSpread Spectrum Storage with Mnemosyne
Spread Spectrum Storage with Mnemosyne Steven Hand and Timothy Roscoe IRB-TR-02-005 June, 2002 Proceedings of the International Workshop on Future Directions in Distributed Computing (FuDiCo 02), June,
More informationSelf-Correcting Broadcast in Distributed Hash Tables
Self-Correcting Broadcast in Distributed Hash Tables Ali Ghsi 1,Luc Onana Alima 1, Sameh El-Ansary 2, Per Brand 2 and Seif Haridi 1 1 IMIT-Royal Institute of Technology, Kista, Sweden 2 Swedish Institute
More informationTAP: A Novel Tunneling Approach for Anonymity in Structured P2P Systems
TAP: A Novel Tunneling Approach for Anonymity in Structured P2P Systems Yingwu Zhu Department of ECECS University of Cincinnati zhuy@ececs.uc.edu Yiming Hu Department of ECECS University of Cincinnati
More information