GNUnet Distributed Data Storage
|
|
|
- Lilian Porter
- 5 years ago
- Views:
Transcription
1 GNUnet Distributed Data Storage DHT and Distance Vector Transport Nathan S. Evans 1 1 Technische Universität München Department of Computer Science Network Architectures and Services July,
2 Overview Overview Distributed Hash Tables Usage Background Kademlia Restricted Route Networks GNUnet DHT Motivation Design Implementation Issues Distance Vector Transport Purpose Design Benefits Summary and Conclusion N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
3 Distributed Hash Tables Basics DHT Basics Shared data storage for P2P networks Reliably store files, data Pool bandwidth, storage space Data remains when publisher disappears Decentralization N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
4 Distributed Hash Tables Basics DHT Basics Data identified by keys Peers store data based on key Distributed Key/Value mapping Load balancing Simple PUT /GET abstraction Scalable N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
5 Distributed Hash Tables DHT Example - Pool of Nodes Basics N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
6 Distributed Hash Tables Basics DHT Example - Data XYZ Stored in Network XYZ XYZ XYZ XYZ N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
7 Distributed Hash Tables Basics DHT Example - Data Available when Nodes Lost XYZ XYZ XYZ XYZ N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
8 Distributed Hash Tables Basics DHT Routing Routing is the essential internal function of DHT s Enables storage, lookup DHT s have distance metric D a,b where a, b are keys or node identifiers Common DHT s route requests to next closest node w.r.t key Provided closest node is found, a PUT and subsequent GET request for a key will reach the same node, and data will be stored/found properly. N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
9 Distributed Hash Tables Basics DHT Routing Example - Base Topology N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
10 Distributed Hash Tables Basics DHT Routing Example - Peer (1, 1, 2, 2) N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
11 Distributed Hash Tables Basics DHT Routing Example - Data Search N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
12 Distributed Hash Tables Basics DHT Routing Example - Data Search N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
13 Distributed Hash Tables Basics DHT Routing Example - Data Search N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
14 Distributed Hash Tables Basics DHT Routing Example - Data Search N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
15 Distributed Hash Tables Basics DHT Routing Example - Data Search N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
16 Distributed Hash Tables Basics DHT Routing Example - Data Search N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
17 Distributed Hash Tables Basics DHT Routing Example - Data Search N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
18 Distributed Hash Tables Basics DHT Routing Example - Data Search N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
19 Distributed Hash Tables Basics DHT Routing Example - Data Search N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
20 Distributed Hash Tables Basics DHT Routing Example - Data Search N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
21 Distributed Hash Tables Basics DHT Routing Example - Data Search N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
22 Distributed Hash Tables Basics DHT Routing Example - Data Search N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
23 Distributed Hash Tables Basics DHT Routing Example - Data Search N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
24 Distributed Hash Tables Basics DHT Limitations Not secure Eclipse attacks Block access to data DoS Not scalable/decentralized Routing tables and maintenance Require trusted authority Require well connected graph N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
25 Distributed Hash Tables Basics DHT Attack Example - Base Topology N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
26 Distributed Hash Tables Basics DHT Attack Example - Put Data Normal N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
27 Distributed Hash Tables Basics DHT Attack Example - Get Data Normal N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
28 Distributed Hash Tables Basics DHT Attack Example - Random Mallory N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
29 Distributed Hash Tables Basics DHT Attack Example - Random Mallory N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
30 Distributed Hash Tables Basics DHT Attack Example - Random Mallory N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
31 Distributed Hash Tables Basics DHT Attack Example - Sybil and Mallory N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
32 Distributed Hash Tables Basics DHT Attack Example - Sybil and Mallory N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
33 Distributed Hash Tables Basics DHT Attack Example - Sybil and Mallory N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
34 Distributed Hash Tables Basics DHT Attack Example - Mallory Surround N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
35 Distributed Hash Tables Basics DHT Attack Example - Mallory Surround N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
36 Distributed Hash Tables Basics DHT Attack Example - Mallory Surround N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
37 Distributed Hash Tables Kademlia Kademlia Routing Routes to peer with most matching bits Assume sufficiently full routing tables Number of possible nodes is halved at each step Results in O(log n) steps Same method used to search a binary tree Metric is simple, other DHT s require multiple routing tables to achieve same performance N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
38 Distributed Hash Tables Kademlia Kademlia Peer 101 Routing Table N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
39 Distributed Hash Tables Kademlia Kademlia Peer 101 Routing Table N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
40 Distributed Hash Tables Kademlia Kademlia Peer 101 Routing Table N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
41 Distributed Hash Tables Kademlia Kademlia Peer 101 Routing Table N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
42 Distributed Hash Tables Kademlia Kademlia Peer 101 Searching for N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
43 Distributed Hash Tables Kademlia Kademlia Peer 101 Searching for N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
44 Distributed Hash Tables Kademlia Kademlia Peer 101 Searching for N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
45 Distributed Hash Tables Kademlia Kademlia Peer 101 Searching for N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
46 Distributed Hash Tables Kademlia Kademlia Peer 101 Searching for N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
47 Distributed Hash Tables Kademlia Kademlia Today Kademlia most widely used DHT Kad network used by edonkey, emule, amule DHT used for searching for and storing links Millions(!) of users Problems Highly deterministic routing DoS attacks possible Eclipse, content blocking possible NAT d users need buddy to participate Requires fully connected topology N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
48 Restricted Route Networks Restricted Route Network Topologies Assumption that any two peers with an IP address can communicate doesn t always hold NAT Firewalls Mobile Networks Ad-hoc Networks Sensor Networks DHT s commonly assume/require universal connectivity We would like our DHT to function in all the above networks Build in support for upnp, NAT punching, etc. Goal: provide more connectivity to sparsely connected graphs (DV) N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
49 GNUnet DHT Motivation Motivation Efficient Decentralized Scalable Secure Reliable Fault-tolerant Provides availability Operates in diverse topologies Build off previous DHT designs N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
50 Kademlia Comparison GNUnet DHT Motivation Kademlia similarities Use distance metric Routing table made up of k-buckets Bucket k i holds peers with matching prefix length i Efficient, binary search like routing (O(log n)) Departure from Kademlia Randomized, recursive routing Forward requests to multiple peers Closest local peers to key store data Designed to work in diverse networks, even those without universal connectivity Routing works with sparse set of connections N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
51 GNUnet DHT GNUnet DHT - Base Example GNUnet DHT Examples N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
52 GNUnet DHT GNUnet DHT Examples GNUnet DHT - Insert Example 1 (Normal) N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
53 GNUnet DHT GNUnet DHT Examples GNUnet DHT - Insert Example 2 (Randomized) N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
54 GNUnet DHT GNUnet DHT Examples GNUnet DHT - Insert Example 3 (Randomized) N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
55 GNUnet DHT GNUnet DHT Examples GNUnet DHT - Insert Example 4 (Randomized) N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
56 GNUnet DHT GNUnet DHT Examples GNUnet DHT - Insert Example 5 (Randomized) N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
57 GNUnet DHT GNUnet DHT Examples GNUnet DHT - Insert Example 6 (Failure) N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
58 GNUnet DHT GNUnet DHT Examples GNUnet DHT - Insert Example 7 (Split) N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
59 GNUnet DHT GNUnet DHT Examples GNUnet DHT - Insert Example 8 (Randomized and split) N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
60 GNUnet DHT GNUnet DHT Examples GNUnet DHT - Get Example - Base N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
61 GNUnet DHT GNUnet DHT Examples GNUnet DHT - Get Example - 1 Malicious N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
62 GNUnet DHT GNUnet DHT Examples GNUnet DHT - Get Example - Split-route N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
63 GNUnet DHT GNUnet DHT Examples GNUnet DHT - Get Example - Out-route N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
64 GNUnet DHT GNUnet DHT Examples GNUnet DHT - Get Example - 3 Malicious N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
65 GNUnet DHT GNUnet DHT Examples GNUnet DHT - Get Example - Route around N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
66 GNUnet DHT GNUnet DHT - Surround Data GNUnet DHT Examples N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
67 GNUnet DHT GNUnet DHT - Insert Redundancy GNUnet DHT Examples N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
68 GNUnet DHT GNUnet DHT Examples GNUnet DHT - Mallory and Sybil fail N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
69 GNUnet DHT Implementation Implementation DHT implemented in both 0.8 and 0.9 versions of GNUnet Kademlia style routing table, randomized recursive routing Routing table from connected peers Testing and evaluation framework Start GNUnet peers Connect in certain topology Insert/retrieve data, log high and low level results N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
70 GNUnet DHT Issues Remaining Issues Determining topology (and therefore network size) is difficult Need to know for appropriate routing More testing with malicious peers and churn needed Routes through network are found, not always efficiently Simulate large number of well connected peers More complete routing tables better routing: can we improve our tables? N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
71 Distance Vector Transport Purpose Fisheye Bounded Distance Vector Efficient routes betwen nodes can be determined using distance vector protocol Every node publishes complete routing information Data disseminated to all nodes; so best routes are found Distance vector requires lots of communication and state Limit routing information shared by hops to target Gives each node a complete Fisheye view of their local neighborhood Using FBDV in GNUnet provides more peers than available by only direct connections Restricted route networks can become better connected! N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
72 Distance Vector Transport Design Design Distance vector implemented as transport plugin When peers connect, they gossip their known neighbors Gossiped peers can be communicated with via gossiper Assume a network of three peers, A, B and C A connects to B, then B connects to C N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
73 Distance Vector Transport Example Example - Peers A, B, C connected in line A B C N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
74 Distance Vector Transport Example Example - Peer B gossips C to A, A to C A C:B:1 B A:B:1 C N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
75 Distance Vector Transport Example Example - Peers A and C connected via B A B C N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
76 Distance Vector Transport Example Example - Peer D joins, connects to C A B C D N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
77 Distance Vector Transport Example Example - Peer C gossips B, A to D A B C D D:B:2 D:C:1 B:C:1 A:C:2 N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
78 Distance Vector Transport Example Example - D connected to B, A via C A B C D N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
79 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: Services for peers A, B, C N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
80 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: CORE A receives message for C N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
81 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: CORE A hands to TRANSPORT A N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
82 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: TRANSPORT A hands to DV A N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
83 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: DV A hands to CORE A N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
84 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: CORE A hands to TRANSPORT A N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
85 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: TRANSPORT A hands to TCP A N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
86 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: Message sent via TCP to Peer B N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
87 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: TCP B hands to TRANSPORT B N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
88 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: TRANSPORT B hands to CORE B N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
89 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: CORE B hands to DV B N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
90 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: DV B hands to CORE B N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
91 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: CORE B hands to TRANSPORT B N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
92 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: TRANSPORT B hands to TCP B N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
93 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: Message is sent via TCP to peer C N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
94 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: TCP C hands to TRANSPORT C N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
95 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: TRANSPORT C hands to CORE C N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
96 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: CORE C hands to DV C N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
97 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: DV C hands to TRANSPORT C N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
98 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: TRANSPORT C hands to CORE C N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
99 Under the Hood Distance Vector Transport Detailed Example CORE A CORE B CORE C TRANSPORT A TRANSPORT B TRANSPORT C DV A DV B DV C TCP A TCP B TCP C Figure: CORE C delivers message from A N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
100 Distance Vector Transport Benefits Benefits of FBDV Provide more available peers to DHT Local routing very efficient, transport selection further optimizes Sparse topologies have better chance for routing Allows DHT routing algorithm to remain more general Shifts connection overhead from file handles to memory/cpu DV messages essentially onion encrypted/routed DV may be used in the future for long lived Tor style circuits to provide anonymity! N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
101 The End Summary and Conclusion GNUnet should have a DHT Distributing storage Replication Reliability, scalability DHT should be efficient, secure Must compromise Decide which goals most important Build on existing designs Randomized routing DHT should work in diverse topologies Requires flexible routing Use DV to help secluded peers N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
102 Questions? Summary and Conclusion N. Evans (TUM) GNUnet Distributed Data Storage July, / 102
Peer-to-Peer Systems and Security
Peer-to-Peer Systems and Security Attacks! Christian Grothoff Technische Universität München April 13, 2013 Salsa & AP3 Goal: eliminate trusted blender server Idea: Use DHT (AP3: Pastry, Salsa: custom
Kademlia: A P2P Informa2on System Based on the XOR Metric
Kademlia: A P2P Informa2on System Based on the XOR Metric Today! By Petar Mayamounkov and David Mazières, presented at IPTPS 22 Next! Paper presentation and discussion Image from http://www.vs.inf.ethz.ch/about/zeit.jpg
08 Distributed Hash Tables
08 Distributed Hash Tables 2/59 Chord Lookup Algorithm Properties Interface: lookup(key) IP address Efficient: O(log N) messages per lookup N is the total number of servers Scalable: O(log N) state per
Saarland University Faculty of Natural Sciences and Technology I Department of Computer Science. Masters Thesis
Saarland University Faculty of Natural Sciences and Technology I Department of Computer Science Masters Thesis Experimental Comparison of Byzantine Fault Tolerant Distributed Hash Tables submitted by Supriti
Peer-to-peer systems and overlay networks
Complex Adaptive Systems C.d.L. Informatica Università di Bologna Peer-to-peer systems and overlay networks Fabio Picconi Dipartimento di Scienze dell Informazione 1 Outline Introduction to P2P systems
Overlay and P2P Networks. Structured Networks and DHTs. Prof. Sasu Tarkoma
Overlay and P2P Networks Structured Networks and DHTs Prof. Sasu Tarkoma 6.2.2014 Contents Today Semantic free indexing Consistent Hashing Distributed Hash Tables (DHTs) Thursday (Dr. Samu Varjonen) DHTs
R/Kademlia: Recursive and Topology-aware Overlay Routing
R/Kademlia: Recursive and Topology-aware Overlay Routing Bernhard Heep ATNAC 2010, Auckland, New Zealand, 11/02/2010, KIT University of the State of Baden-Wuerttemberg and National Research Center of the
Lecture 6: Overlay Networks. CS 598: Advanced Internetworking Matthew Caesar February 15, 2011
Lecture 6: Overlay Networks CS 598: Advanced Internetworking Matthew Caesar February 15, 2011 1 Overlay networks: Motivations Protocol changes in the network happen very slowly Why? Internet is shared
Introduction to Peer-to-Peer Systems
Introduction Introduction to Peer-to-Peer Systems Peer-to-peer (PP) systems have become extremely popular and contribute to vast amounts of Internet traffic PP basic definition: A PP system is a distributed
Module SDS: Scalable Distributed Systems. Gabriel Antoniu, KERDATA & Davide Frey, ASAP INRIA
Module SDS: Scalable Distributed Systems Gabriel Antoniu, KERDATA & Davide Frey, ASAP INRIA Staff Gabriel Antoniu, DR INRIA, KERDATA Team gabriel.antoniu@inria.fr Davide Frey, CR INRIA, ASAP Team davide.frey@inria.fr
Content Overlays. Nick Feamster CS 7260 March 12, 2007
Content Overlays Nick Feamster CS 7260 March 12, 2007 Content Overlays Distributed content storage and retrieval Two primary approaches: Structured overlay Unstructured overlay Today s paper: Chord Not
Peer-to-Peer Internet Applications: A Review
Peer-to-Peer Internet Applications: A Review Davide Quaglia 01/14/10 Introduction Key points Lookup task Outline Centralized (Napster) Query flooding (Gnutella) Distributed Hash Table (Chord) Simulation
Peer-to-Peer Systems. Network Science: Introduction. P2P History: P2P History: 1999 today
Network Science: Peer-to-Peer Systems Ozalp Babaoglu Dipartimento di Informatica Scienza e Ingegneria Università di Bologna www.cs.unibo.it/babaoglu/ Introduction Peer-to-peer (PP) systems have become
S/Kademlia: A Practicable Approach Towards Secure Key Based Routing
S/Kademlia: A Practicable Approach Towards Secure Key Based Routing Ingmar Baumgart, Sebastian Mies P2P NVE 2007, Hsinchu, Taiwan, Institute of Telematics Prof. Dr. M. Zitterbart Motivation Kademlia is
Peer-to-Peer Systems and Distributed Hash Tables
Peer-to-Peer Systems and Distributed Hash Tables CS 240: Computing Systems and Concurrency Lecture 8 Marco Canini Credits: Michael Freedman and Kyle Jamieson developed much of the original material. Selected
Peer-To-Peer Techniques
PG DynaSearch Markus Benter 31th October, 2013 Introduction Centralized P2P-Networks Unstructured P2P-Networks Structured P2P-Networks Misc 1 What is a Peer-to-Peer System? Definition Peer-to-peer systems
Telematics Chapter 9: Peer-to-Peer Networks
Telematics Chapter 9: Peer-to-Peer Networks Beispielbild User watching video clip Server with video clips Application Layer Presentation Layer Application Layer Presentation Layer Session Layer Session
Lesson 9 Applications of DHT: Bittorrent Mainline DHT, the KAD network
Lesson 9 Applications of DHT: Bittorrent Mainline DHT, the KAD network 20/03/2017 1 IMPLEMENTATION OF KADEMLIA Kademlia is the protocol used by the largest public DHTs. Vuze ( before known as Azureus),
Unit 8 Peer-to-Peer Networking
Unit 8 Peer-to-Peer Networking P2P Systems Use the vast resources of machines at the edge of the Internet to build a network that allows resource sharing without any central authority. Client/Server System
internet technologies and standards
Institute of Telecommunications Warsaw University of Technology 25 internet technologies and standards Piotr Gajowniczek Andrzej Bąk Michał Jarociński Internet application layer peer-to-peer systems overview
Routing in the Dark: Pitch Black. A Thesis Presented to the Faculty of Engineering and Computer Science University of Denver
Routing in the Dark: Pitch Black A Thesis Presented to the Faculty of Engineering and Computer Science University of Denver In Partial Fulfillment of the Requirements for the Degree Master of Science by
Secure and Robust Overlay Content Distribution
Secure and Robust Overlay Content Distribution A THESIS SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY Hun Jeong Kang IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE
Department of Computer Science Institute for System Architecture, Chair for Computer Networks. File Sharing
Department of Computer Science Institute for System Architecture, Chair for Computer Networks File Sharing What is file sharing? File sharing is the practice of making files available for other users to
Overlay networks. To do. Overlay networks. P2P evolution DHTs in general, Chord and Kademlia. Turtles all the way down. q q q
Overlay networks To do q q q Overlay networks P2P evolution DHTs in general, Chord and Kademlia Turtles all the way down Overlay networks virtual networks Different applications with a wide range of needs
March 10, Distributed Hash-based Lookup. for Peer-to-Peer Systems. Sandeep Shelke Shrirang Shirodkar MTech I CSE
for for March 10, 2006 Agenda for Peer-to-Peer Sytems Initial approaches to Their Limitations CAN - Applications of CAN Design Details Benefits for Distributed and a decentralized architecture No centralized
Architectures 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
Today. Why might P2P be a win? What is a Peer-to-Peer (P2P) system? Peer-to-Peer Systems and Distributed Hash Tables
Peer-to-Peer Systems and Distributed Hash Tables COS 418: Distributed Systems Lecture 7 Today 1. Peer-to-Peer Systems Napster, Gnutella, BitTorrent, challenges 2. Distributed Hash Tables 3. The Chord Lookup
CS555: Distributed Systems [Fall 2017] Dept. Of Computer Science, Colorado State University
![CS555: Distributed Systems [Fall 2017] Dept. Of Computer Science, Colorado State University](/thumbs/95/125142682.jpg "CS555: 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
Distributed hash table - Wikipedia, the free encyclopedia
Page 1 sur 6 Distributed hash table From Wikipedia, the free encyclopedia Distributed hash tables (DHTs) are a class of decentralized distributed systems that provide a lookup service similar to a hash
DMAP : Global Name Resolution Services Through Direct Mapping
DMAP : Global Name Resolution Services Through Direct Mapping Tam Vu, Rutgers University http://www.winlab.rutgers.edu/~tamvu/ (Joint work with Akash Baid, Yanyong Zhang, Thu D. Nguyen, Junichiro Fukuyama,
Towards Benchmarking of P2P Technologies from a SCADA Systems Protection Perspective
Towards Benchmarking of P2P Technologies from a SCADA Systems Protection Perspective CIIP at Mobilight 2010 Abdelmajid Khelil, Sebastian Jeckel, Daniel Germanus and Neeraj Suri 11.05.10 Abdelmajid Khelil
Decentralized Evaluation of Regular Expressions for Capability Discovery in Peer-to-Peer Networks
Decentralized Evaluation of Regular Expressions for Capability Discovery in Peer-to-Peer Networks Maximilian Szengel Advisors: C. Grothoff, R. Holz, H. Niedermayer, B. Polot Master s thesis Chair for Network
(Im)possibility of Enumerating Zombies. Yongdae Kim (U of Minnesota - Twin Cities)
(Im)possibility of Enumerating Zombies Yongdae Kim (U of Minnesota - Twin Cities) From Gunter Ollmann at Damballa's blog Botnet and DDoS Botnets becoming the major tool for DDoS 5 million nodes Botnet
Chapter 10: Peer-to-Peer Systems
Chapter 10: Peer-to-Peer Systems From Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edition 4, Addison-Wesley 2005 Introduction To enable the sharing of data and resources
Kademlia: A peer-to peer information system based on XOR. based on XOR Metric,by P. Maymounkov and D. Mazieres
: A peer-to peer information system based on XOR Metric,by P. Maymounkov and D. Mazieres March 10, 2009 : A peer-to peer information system based on XOR Features From past p2p experiences, it has been
Efficient DHT attack mitigation through peers ID distribution
Efficient DHT attack mitigation through peers ID distribution Thibault Cholez, Isabelle Chrisment and Olivier Festor {thibault.cholez, isabelle.chrisment, olivier.festor}@loria.fr LORIA - Campus Scientifique
P2P Network Structured Networks: Distributed Hash Tables. Pedro García López Universitat Rovira I Virgili
P2P Network Structured Networks: Distributed Hash Tables Pedro García López Universitat Rovira I Virgili Pedro.garcia@urv.net Index Introduction to DHT s Origins of structured overlays Case studies Chord
Improving Lookup Performance over a Widely-Deployed DHT
Improving Lookup Performance over a Widely-Deployed DHT Daniel Stutzbach, Reza Rejaie Department of Computer & Information Science University of Oregon {agthorr,reza}@cs.uoregon.edu Abstract During recent
P2PNS: A Secure Distributed Name Service for P2PSIP
P2PNS: A Secure Distributed Name Service for P2PSIP Mobile P2P 2008, Hong Kong, China Outline Decentralized VoIP (P2PSIP) Peer-to-Peer name service (P2PNS) Architecture Two-stage name resolution P2PNS
Peer-to-Peer Systems. Chapter General Characteristics
Chapter 2 Peer-to-Peer Systems Abstract In this chapter, a basic overview is given of P2P systems, architectures, and search strategies in P2P systems. More specific concepts that are outlined include
Cooperation in Open Distributed Systems. Stefan Schmid
Cooperation in Open Distributed Systems Stefan Schmid T-Labs, Berlin, July 2, 2009 Distributed Systems 2008/9 Wireless: Many mobile phones today have WLAN (and even Skype) P2P: Olympic games 2008 live-broadcast
Overview Computer Networking Lecture 16: Delivering Content: Peer to Peer and CDNs Peter Steenkiste
Overview 5-44 5-44 Computer Networking 5-64 Lecture 6: Delivering Content: Peer to Peer and CDNs Peter Steenkiste Web Consistent hashing Peer-to-peer Motivation Architectures Discussion CDN Video Fall
CS4700/CS5700 Fundamentals of Computer Networks
CS4700/CS5700 Fundamentals of Computer Networks Lecture 22: Overlay networks Slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang Alan Mislove amislove at ccs.neu.edu
Peer- Peer to -peer Systems
Peer-to-peer Systems Brian Nielsen bnielsen@cs.aau.dk Client-Server Centralized Bottleneck Functional specialization Single point of failure Central administration NFS Client NFS Client NFS Server NFS
Overlay and P2P Networks. Introduction and unstructured networks. Prof. Sasu Tarkoma
Overlay and P2P Networks Introduction and unstructured networks Prof. Sasu Tarkoma 14.1.2013 Contents Overlay networks and intro to networking Unstructured networks Overlay Networks An overlay network
A Scalable Content- Addressable Network
A Scalable Content- Addressable Network In Proceedings of ACM SIGCOMM 2001 S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker Presented by L.G. Alex Sung 9th March 2005 for CS856 1 Outline CAN basics
Searching for Shared Resources: DHT in General
1 ELT-53207 P2P & IoT Systems Searching for Shared Resources: DHT in General Mathieu Devos Tampere University of Technology Department of Electronics and Communications Engineering Based on the original
Coordinate-based Routing:
Coordinate-based Routing: Refining NodeIds in Fabian Hartmann and Bernhard Heep P2PNet 09 (in conjunction with ICUMT 09) St. Petersburg, Russia Motivation Structured P2P overlays offering key-based routing
Overlay and P2P Networks. Structured Networks and DHTs. Prof. Sasu Tarkoma
Overlay and P2P Networks Structured Networks and DHTs Prof. Sasu Tarkoma 2.2.2015 Contents Today Geometries revisited Distributed Hash Tables (DHTs) Thursday Power-law networks Geometries revisited The
PeerfactSim.KOM: A Simulation Framework for Peer-to-Peer Systems
PeerfactSim.KOM: A Simulation Framework for Peer-to-Peer Systems The 2011 International Conference on High Performance Computing & Simulation July 4 8, 2011, Istanbul, Turkey Dominik Stingl Christian Gross
Distributed Hash Tables
Distributed Hash Tables CS6450: Distributed Systems Lecture 11 Ryan Stutsman Material taken/derived from Princeton COS-418 materials created by Michael Freedman and Kyle Jamieson at Princeton University.
DISTRIBUTED COMPUTER SYSTEMS ARCHITECTURES
DISTRIBUTED COMPUTER SYSTEMS ARCHITECTURES Dr. Jack Lange Computer Science Department University of Pittsburgh Fall 2015 Outline System Architectural Design Issues Centralized Architectures Application
Slides for Chapter 10: Peer-to-Peer Systems
Slides for Chapter 10: Peer-to-Peer Systems From Coulouris, Dollimore, Kindberg and Blair Distributed Systems: Concepts and Design Edition 5, Addison-Wesley 2012 Overview of Chapter Introduction Napster
Telecommunication Services Engineering Lab. Roch H. Glitho
1 Support Infrastructure Support infrastructure for application layer Why? Re-usability across application layer protocols Modularity (i.e. separation between application layer protocol specification /
Distributed Hash Tables
Smruti R. Sarangi Department of Computer Science Indian Institute of Technology New Delhi, India Smruti R. Sarangi 1/34 Outline 1 2 Smruti R. Sarangi 2/34 Normal Hashtables Hashtable : Contains a set of
GIAN Course on Distributed Network Algorithms. Network Topologies and Interconnects
GIAN Course on Distributed Network Algorithms Network Topologies and Interconnects Stefan Schmid @ T-Labs, 2011 The Many Faces and Flavors of Network Topologies Gnutella P2P. Social Networks. Internet.
P2P: Distributed Hash Tables
P2P: Distributed Hash Tables Chord + Routing Geometries Nirvan Tyagi CS 6410 Fall16 Peer-to-peer (P2P) Peer-to-peer (P2P) Decentralized! Hard to coordinate with peers joining and leaving Peer-to-peer (P2P)
Distributed Hash Tables: Chord
Distributed Hash Tables: Chord Brad Karp (with many slides contributed by Robert Morris) UCL Computer Science CS M038 / GZ06 12 th February 2016 Today: DHTs, P2P Distributed Hash Tables: a building block
Scalable overlay Networks
overlay Networks Dr. Samu Varjonen 1 Contents Course overview Lectures Assignments/Exercises 2 Course Overview Overlay networks and peer-to-peer technologies have become key components for building large
Searching for Shared Resources: DHT in General
1 ELT-53206 Peer-to-Peer Networks Searching for Shared Resources: DHT in General Mathieu Devos Tampere University of Technology Department of Electronics and Communications Engineering Based on the original
P2P Network Structured Networks (IV) Distributed Hash Tables. Pedro García López Universitat Rovira I Virgili
P2P Network Structured Networks (IV) Distributed Hash Tables Pedro García López Universitat Rovira I Virgili Pedro.garcia@urv.net Index Koorde: Degree optimal DHT Constructing overlay applications and
Distributed 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
: Scalable Lookup
6.824 2006: Scalable Lookup Prior focus has been on traditional distributed systems e.g. NFS, DSM/Hypervisor, Harp Machine room: well maintained, centrally located. Relatively stable population: can be
Security for Structured Peer-to-peer Overlay Networks. Acknowledgement. Outline. By Miguel Castro et al. OSDI 02 Presented by Shiping Chen in IT818
Security for Structured Peer-to-peer Overlay Networks By Miguel Castro et al. OSDI 02 Presented by Shiping Chen in IT818 1 Acknowledgement Some of the following slides are borrowed from talks by Yun Mao
CSE 124 Finding objects in distributed systems: Distributed hash tables and consistent hashing. March 8, 2016 Prof. George Porter
CSE 124 Finding objects in distributed systems: Distributed hash tables and consistent hashing March 8, 2016 rof. George orter Outline Today: eer-to-peer networking Distributed hash tables Consistent hashing
PariMulo: Kad. Università degli studi di Padova Facoltà di Ingegneria. Corso di Laurea Magistrale in Ingegneria Informatica
Università degli studi di Padova Facoltà di Ingegneria Corso di Laurea Magistrale in Ingegneria Informatica PariMulo: Kad Supervisor: Chiar.mo Prof. Enoch Peserico Stecchini Negri De Salvi Student: Francesco
Peer-to-Peer (P2P) Systems
Peer-to-Peer (P2P) Systems What Does Peer-to-Peer Mean? A generic name for systems in which peers communicate directly and not through a server Characteristics: decentralized self-organizing distributed
Introduction to P2P Computing
Introduction to P2P Computing Nicola Dragoni Embedded Systems Engineering DTU Compute 1. Introduction A. Peer-to-Peer vs. Client/Server B. Overlay Networks 2. Common Topologies 3. Data Location 4. Gnutella
CS514: Intermediate Course in Computer Systems
Distributed Hash Tables (DHT) Overview and Issues Paul Francis CS514: Intermediate Course in Computer Systems Lecture 26: Nov 19, 2003 Distributed Hash Tables (DHT): Overview and Issues What is a Distributed
Purpose and security analysis of RASTER
Purpose and security analysis of RASTER Oliver Gasser Advisor: Christian Grothoff Seminar Future Internet SS2010 Lehrstuhl Netzarchitekturen und Netzdienste Fakultät für Informatik, Technische Universität
L3S Research Center, University of Hannover
, University of Hannover Structured Peer-to to-peer Networks Wolf-Tilo Balke and Wolf Siberski 3..6 *Original slides provided by K. Wehrle, S. Götz, S. Rieche (University of Tübingen) Peer-to-Peer Systems
Scalability 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
Motivation for peer-to-peer
Peer-to-peer systems INF 5040 autumn 2015 lecturer: Roman Vitenberg INF5040, Frank Eliassen & Roman Vitenberg 1 Motivation for peer-to-peer Ø Inherent restrictions of the standard client/ server model
Content Search. Unstructured P2P. Jukka K. Nurminen
Content Search Unstructured P2P Jukka K. Nurminen *Partly adapted from original slides provided by Rüdiger Schollmeier and Jörg Eberspächer (Technische Universität München) 1 V1-Filename.ppt / yyyy-mm-dd
Peer-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
GIAN Course on Distributed Network Algorithms. Network Topologies and Local Routing
GIAN Course on Distributed Network Algorithms Network Topologies and Local Routing Stefan Schmid @ T-Labs, 2011 GIAN Course on Distributed Network Algorithms Network Topologies and Local Routing If you
Distributed Information Processing
Distributed Information Processing 14 th Lecture Eom, Hyeonsang ( 엄현상 ) Department of Computer Science & Engineering Seoul National University Copyrights 2016 Eom, Hyeonsang All Rights Reserved Outline
Information Leak in the Chord Lookup Protocol
Information Leak in the Chord Lookup Protocol Charles W. O Donnell Vinod Vaikuntanathan Massachusetts Institute of Technology August 25, 2004 4 th IEEE International Conference on Peer-to-Peer Computing
Modern Technology of Internet
Modern Technology of Internet Jiří Navrátil, Josef Vojtěch, Jan Furman, Tomáš Košnar, Sven Ubik, Milan Šárek, Jan Růžička, Martin Pustka, Laban Mwansa, Rudolf Blažek Katedra počítačových systémů FIT České
Symphony. Symphony. Acknowledgement. DHTs: : The Big Picture. Spectrum of DHT Protocols. Distributed Hashing in a Small World
Distributed Hashing in a Small World Gurmeet Singh Manku Stanford University with Mayank Bawa and Prabhakar Raghavan Acknowledgement The following slides are borrowed from the author s talk at USITS 2003.
Anonymity With Tor. The Onion Router. July 5, It s a series of tubes. Ted Stevens. Technische Universität München
Anonymity With Tor The Onion Router Nathan S. Evans Christian Grothoff Technische Universität München July 5, 2012 It s a series of tubes. Ted Stevens Overview What is Tor? Motivation Background Material
Lecture 8: Application Layer P2P Applications and DHTs
Lecture 8: Application Layer P2P Applications and DHTs COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016,
Problems 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
Peer-to-Peer Systems and Security IN2194. Chapter 1 Peer-to-Peer Systems 1.3 Structured Networks
Chair for Network Architectures and Services Department of Informatics TU München Prof. Carle Peer-to-Peer Systems and Security IN2194 Chapter 1 Peer-to-Peer Systems 1.3 Structured Networks Prof. Dr.-Ing.
The Design and Implementation of a Next Generation Name Service for the Internet (CoDoNS) Presented By: Kamalakar Kambhatla
The Design and Implementation of a Next Generation Name Service for the Internet (CoDoNS) Venugopalan Ramasubramanian Emin Gün Sirer Presented By: Kamalakar Kambhatla * Slides adapted from the paper -
Winter CS454/ Assignment 2 Instructor: Bernard Wong Due date: March 12 15, 2012 Group size: 2
Winter CS454/654 2012 Assignment 2 Instructor: Bernard Wong Due date: March 12 15, 2012 Group size: 2 Distributed systems is a rapidly evolving field. Most of the systems we have studied (or will study)
Peer to Peer Networks
Sungkyunkwan University Peer to Peer Networks Prepared by T. Le-Duc and H. Choo Copyright 2000-2017 Networking Laboratory Presentation Outline 2.1 Introduction 2.2 Client-Server Paradigm 2.3 Peer-To-Peer
Efficient and Secure Decentralized Network Size Estimation
Efficient and Secure Decentralized Network Size Estimation Nathan Evans 1, Bartlomiej Polot 2, and Christian Grothoff 2 1 Symantec Research Labs, nathan evans@symantec.com 2 Free Secure Network Systems
Horizontal or vertical scalability? Horizontal scaling is challenging. Today. Scaling Out Key-Value Storage
Horizontal or vertical scalability? Scaling Out Key-Value Storage COS 418: Distributed Systems Lecture 8 Kyle Jamieson Vertical Scaling Horizontal Scaling [Selected content adapted from M. Freedman, B.
Overlay networks. Today. l Overlays networks l P2P evolution l Pastry as a routing overlay example
Overlay networks Today l Overlays networks l P2P evolution l Pastry as a routing overlay eample Network virtualization and overlays " Different applications with a range of demands/needs network virtualization
Scaling Out Key-Value Storage
Scaling Out Key-Value Storage COS 418: Distributed Systems Logan Stafman [Adapted from K. Jamieson, M. Freedman, B. Karp] Horizontal or vertical scalability? Vertical Scaling Horizontal Scaling 2 Horizontal
Practical Anonymity for the Masses with MorphMix
Practical Anonymity for the Masses with MorphMix Marc Rennhard, Bernhard Plattner () Financial Cryptography 2004 12 th February 2004 http://www.tik.ee.ethz.ch/~morphmix Overview Circuit-based mix networks
Peer to Peer Networks
Sungkyunkwan University Peer to Peer Networks Prepared by T. Le-Duc and H. Choo Copyright 2000-2018 Networking Laboratory P2P Applications Traditional P2P applications: for file sharing BitTorrent, Emule
P2P Network Structured Networks: Distributed Hash Tables. Pedro García López Universitat Rovira I Virgili
P2P Network Structured Networks: Distributed Hash Tables Pedro García López Universitat Rovira I Virgili Pedro.garcia@urv.net Index Description of CHORD s Location and routing mechanisms Symphony: Distributed
CSCI-1680 P2P Rodrigo Fonseca
CSCI-1680 P2P Rodrigo Fonseca Based partly on lecture notes by Ion Stoica, Sco5 Shenker, Joe Hellerstein Today Overlay networks and Peer-to-Peer Motivation Suppose you want to write a routing protocol
Overlay Networks in ScaleNet
Overlay Networks in ScaleNet Dipl-Inform. Ingmar Baumgart Prof. Dr. Martina Zitterbart VDE ITG 5.2.1 Fachgruppentreffen, Ericsson, Aachen, 5.5.06, The ScaleNet Project : Scalable, efficient and flexible
Distributed Systems Peer-to-Peer Systems
Distributed Systems Peer-to-Peer Systems [2] P2P Systems - Goals and Definition Goal: to enable sharing of data and resources on a very large scale by eliminating any requirement for separately-managed
Distributed Systems. 17. Distributed Lookup. Paul Krzyzanowski. Rutgers University. Fall 2016
Distributed Systems 17. Distributed Lookup Paul Krzyzanowski Rutgers University Fall 2016 1 Distributed Lookup Look up (key, value) Cooperating set of nodes Ideally: No central coordinator Some nodes can
ShadowWalker: Peer-to-peer Anonymous Communication Using Redundant Structured Topologies
ShadowWalker: Peer-to-peer Anonymous Communication Using Redundant Structured Topologies ABSTRACT Prateek Mittal Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign
c 2010 Prateek Mittal
c 2010 Prateek Mittal A SECURITY EVALUATION OF THE SALSA ANONYMOUS COMMUNICATION SYSTEM BY PRATEEK MITTAL THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science