Towards Benchmarking of P2P Technologies from a SCADA Systems Protection Perspective
|
|
- Angelica Barker
- 6 years ago
- Views:
Transcription
1 Towards Benchmarking of P2P Technologies from a SCADA Systems Protection Perspective CIIP at Mobilight 2010 Abdelmajid Khelil, Sebastian Jeckel, Daniel Germanus and Neeraj Suri Abdelmajid Khelil Slide 1
2 Overview Motivation SCADA Systems Overview P2P Overview & Classification P2P-Enabling for SCADA Protection Mapping P2P Techniques to SCADA Systems Conclusions Abdelmajid Khelil Slide 2
3 Supervisory Control and Data Acquisition (SCADA) -Trends SCADA systems monitor/control critical industrial processes, infrastructures etc. Modern SCADA systems are IPbased, use COTS components and existing networks (e.g., Internet) Modern SCADA are networked & potentially large-scale Example: US power grid about 50k sensors New vulnerabilities: Failures, cyber threats etc. Regional centre Misc. nodes HMI stations LAN Misc. nodes HMI stations RTUs LAN Sensors, Actuators LAN Sensors, Actuators Industrial site LAN DB DB RTUs National centre Misc. nodes HMI stations WAN (Internet) RTUs (SCADA) Local supervisor LAN Sensors, Actuators LAN Industrial site DB (Corporate) Workstations LAN Servers DB Abdelmajid Khelil Slide 3
4 Requirements on Critical Infrastructure Protection (CIP) General requirements on CIP - Beneficial protection - Minimal intrusiveness: Easy to add-on - Specific requirements: Scalability etc. Core approach - Requisite CIP-specific monitoring - Responsive (RT & reliable) information dissemination Use of overlays! - CIP-specific information analysis & control Abdelmajid Khelil Slide 4
5 Overlay Networks (1) Peers form an overlay network - Purely logical - On top of existing network (underlay) Overlay can extend underlay features Overlay topology/features depend on concrete Peer-to- Peer (P2P) implementation -How is it constructed? -How is it organized? -How to locate data? Physical Logical - How to route messages? Abdelmajid Khelil Slide 5
6 Overlay Networks (2) Middleware mask underlying heterogeneity Autonomicity/self-organization allows for - Improved scalability - Dynamic adaptation to changing conditions (self-organizing, resilient) - Domain tunability/customization Data storage and retrieval are inherent - Data/path replication for fault-tolerance Rel. simple requirements - TCP/IP stack Some new risks Network overhead Abdelmajid Khelil Slide 6
7 Objectives (1) Abdelmajid Khelil Slide 7
8 Objectives (2) SCADA P2P mapping - Class-based For given SCADA system + application, identify appropriate P2P class(es) SCADA System Properties Topology Scale Data flow Capabilities Requirements Security Profitability Dependability Quality of Service Applications Data replication Rerouting P2P Technology Abdelmajid Khelil Slide 8
9 Overview Motivation SCADA Systems Overview P2P Overview & Classification P2P-Enabling for SCADA Protection Mapping P2P Techniques to SCADA Systems Conclusions Abdelmajid Khelil Slide 9
10 SCADA Model : Hierarchical & Structured Sensors/actuators embedded within the supervised processes Remote Terminal Units (RTUs) - Collect and convert data - Forward commands Supervisory Stations - Data interpretation - Operators react by sending commands Multiple supervision layers possible - Local, regional, national,... Dedicated buses, Direct connections LAN, WAN (Internet) Sensors Actuators 1..* 1 RTUs 1..* 1 Supervisory Station Abdelmajid Khelil Slide 10
11 SACDA Data Flows & Control Loops Upstream/downstream data flows Three types of control loops: - Safety-critical - Operation-critical - Non-critical Commands Sensors Actuators safety-critical Safety-critical control loops - Keep process stable - Delay in millisecond to second range operationcritical RTUs Operation-critical control loops - Backed by system-level intelligence - Delay of multiple seconds tolerable Supervisory Station Data Abdelmajid Khelil Slide 11
12 Overview Motivation SCADA Systems Overview P2P Overview & Classification P2P-Enabling for SCADA Protection Mapping P2P Techniques to SCADA Systems Conclusions Abdelmajid Khelil Slide 12
13 P2P Overlay Networks Existing Classification Peers share resources and data Pure P2P vs. hybrid approaches Two ways to find data: It is searched UnstructuredP2P It is directly addressed StructuredP2P Distributed hashtables (DHTs): nodes - stored contents Differences in mathematical notions of address spaces, mechanisms of node lookup, data retrieval, routing and replication Abdelmajid Khelil Slide 13
14 Unstructured P2P (1) Unstructured overlay characteristics: - Neighbors are picked arbitrarily - Topology: Random/Small world graph -Flooding used to search for data - Inefficient directed overlay routing -No deterministically distributed responsibilities (Flooding example) Challenges: - Optimize search performance - Reduce redundant messages - Support heterogeneous peers TTL Abdelmajid Khelil Slide 14
15 Unstructured P2P (2) Gnutella - Flat topology - Simple flooding - No heterogeneity FastTrack - Two-layered architecture - Better search performance - Capable peers are promoted Gia - Flat topology - Multiple optimizations - Heterogeneity, better load balancing Ordinary Peer Super Peer (FastTrack overlay) Abdelmajid Khelil Slide 15
16 Structured P2P (1) Structured overlay characteristics: - Neighbors are selected by certain rules -Data items can be addressed - Efficient directed overlay routing - Deterministic responsibility assignment Distributed Hash Table (DHT) functionality - Peers/data items are assigned unique identifiers - Identifier space (hash buckets) is distributed evenly among peers - For given identifier, lookup of responsible peer in k steps (by routing towards it) General rule for DHTs: With each routing step, at least halve the distance -Upper bound of O(log n) steps (n = number of peers in the system) Abdelmajid Khelil Slide 16
17 Structured P2P (2) Chord - Ring-shaped overlay - Additional long-distance links CAN - Spatial approach Kademlia - Tree-based overlay Tapestry - Plaxton mesh Pastry -Plaxtonmesh + Chord ring Koorde -Based on Chord - Routing steps: O(log n) - State size: const. Kelips - Strongly connected graph - Routing steps: const. - State size: O(sqrt(n)) Abdelmajid Khelil Slide 17
18 SCADA-relevant P2P Classification (1) Routing latency - fulfill timeliness requirements Minimum requirements - support for legacy components structured State size? Overlay topology? unstructured Heterogeneous peers? Communication overhead - avoid traffic congestions Robustness and security large Kelips (low) medium Tapestry Pastry Kademlia small Chord Koorde CAN yes Routing latency FastTrack Gia no Gnutella (high) Abdelmajid Khelil Slide 18
19 SCADA-relevant P2P Classification (2) Overlay topology? Overlay topology? unstructured structured unstructured structured Node degree? Node degree? low medium high low medium high FastTrack Gnutella Gia Chord Koorde CAN Tapestry Pastry Kademlia Kelips Gnutella FastTrack Gia Chord Koorde CAN Tapestry Pastry Kademlia Kelips (low) Minimum requirements (high) (low) Maintenance overhead (high) Abdelmajid Khelil Slide 19
20 SCADA-relevant P2P Classification (3) Structured systems Performance class high medium low Examples Kelips Tapestry, Pastry, Kademlia Chord, CAN, Koorde Memory/bandwidth consumption high medium low Routing latency low low - medium medium Overlay robustness high high low - medium Abdelmajid Khelil Slide 20
21 SCADA-relevant P2P Classification (4) Unstructured systems Peer responsibilities all equal diverse Examples Support for highly heterogeneous peers Communication overhead Overlay robustness Routing latency Gnutella no high high high Gia, FastTrack yes medium medium medium - high Abdelmajid Khelil Slide 21
22 Overview Motivation SCADA Systems Overview P2P Overview & Classification P2P-Enabling for SCADA Protection Mapping P2P Techniques to SCADA Systems Conclusions Abdelmajid Khelil Slide 22
23 Conceptional Conflicts Inter-domain discrepancies between P2P and SCADA - These have to be considered when using P2P technology in a SCADA context P2P SCADA Data Flow between random nodes between distinct endpoints Architecture flat hierarchical Role Assignment every node is replaceable unique nodes Node Behavior frequent joins/leaves fixed node set Abdelmajid Khelil Slide 23
24 Potential Protection Applications Middleware architecture SCADA Application Underlay Protection: Rerouting and Data Replication to mitigate data loss and corruption Abdelmajid Khelil Slide 24
25 P2P-based Rerouting and Replication For rerouting, unstructured overlays suffice -Find a node which can still reach the target - Independent of overlay distance For replication, structured generally better than unstructured -Lookup vsblind search - Depends on scale: For large scale structured outperform unstructured Abdelmajid Khelil Slide 25
26 Overview Motivation SCADA Systems Overview P2P Overview & Classification P2P-Enabling for SCADA Protection Mapping P2P Techniques to SCADA Systems Conclusions Abdelmajid Khelil Slide 26
27 Step 1: Identification of Subsystems Criteria: - Network topology - Security policies -Ownership - Legal obligations, regulations, political reasons - Data flow/requirements Subsystem 2..n Subsystem 1 RTUs Local supervisory stations Regional centers 1..* 1 1..* 1 1..* 1 National centers LAN WAN (Internet) Abdelmajid Khelil Slide 27
28 Step 2: Selection of P2P Techniques Based on SCADA system aspects -Scale - Requirements - Capabilities Rerouting Unstructured - Overlay itself is scalable and flexible - Searching not required for rerouting Small-scale replication Unstructured - DHTs not designed for small-scale Rerouting P2P techniques Application? Data replication Small-scale? Yes No Unstructured DHT Large-scale replication DHT Abdelmajid Khelil Slide 28
29 Selection of P2P Techniques (2) DHTs don't support heterogeneity - Weakest peers set the upper bar Low capability peers can be managed by better peers Yes DHT Highly heterogeneous? Low capability peers? No Hybrid (DHT+ Centralized) Low Med. High Pure DHT Abdelmajid Khelil Slide 29
30 Conclusions P2P-based protection of critical services, infrastructures etc is promising Selection of most appropriate P2P technology is crucial We presented P2P selection guidelines for SCADA protection Future Work Assessment of P2P-based protection Security metrics Abdelmajid Khelil Slide 30
31 Thanks for your attention! {khelil jeckel germanus Abdelmajid Khelil Slide 31
Making Gnutella-like P2P Systems Scalable
Making Gnutella-like P2P Systems Scalable Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, S. Shenker Presented by: Herman Li Mar 2, 2005 Outline What are peer-to-peer (P2P) systems? Early P2P systems
More informationPeer-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
More informationTelecommunication 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 /
More informationPeer-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
More informationSearching 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
More informationSearching 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
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 informationPeer-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
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 informationL3S 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
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 Survey of Peer-to-Peer Content Distribution Technologies
A Survey of Peer-to-Peer Content Distribution Technologies Stephanos Androutsellis-Theotokis and Diomidis Spinellis ACM Computing Surveys, December 2004 Presenter: Seung-hwan Baek Ja-eun Choi Outline Overview
More informationPeer-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
More informationOverlay 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
More informationPeer-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
More informationMarch 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
More information*Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen)
Distributed Hash Tables (DHT) Jukka K. Nurminen *Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen) The Architectures of st and nd Gen. PP Client-Server Peer-to-Peer.
More informationLecture 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
More informationIntroduction 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
More informationChapter 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
More informationGNUnet Distributed Data Storage
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, 24 2010 Overview
More informationDistributed 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
More informationPeerfactSim.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
More informationDISTRIBUTED 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
More informationOverlay 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
More informationTelematics 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
More informationSlides 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
More informationScalable overlay Networks
overlay Networks Dr. Samu Varjonen 1 Lectures MO 15.01. C122 Introduction. Exercises. Motivation. TH 18.01. DK117 Unstructured networks I MO 22.01. C122 Unstructured networks II TH 25.01. DK117 Bittorrent
More informationUpcoming EC Systems Research Perspectives
Upcoming EC Systems Research Perspectives Neeraj Suri Dept. of Computer Science TU Darmstadt, Germany Dependable Embedded Systems & SW Group www.deeds.informatik.tu-darmstadt.de EU Computing Systems Strategy
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 informationOverlay and P2P Networks. Unstructured networks. PhD. Samu Varjonen
Overlay and P2P Networks Unstructured networks PhD. Samu Varjonen 25.1.2016 Contents Unstructured networks Last week Napster Skype This week: Gnutella BitTorrent P2P Index It is crucial to be able to find
More informationSlides for Chapter 10: Peer-to-Peer Systems. From Coulouris, Dollimore, Kindberg and Blair Distributed Systems: Concepts and Design
Slides for Chapter 10: Peer-to-Peer Systems From Coulouris, Dollimore, Kindberg and Blair Distributed Systems: Concepts and Design Edition 5, Addison-Wesley 2012 Edited and supplemented by Jonne Itkonen,!
More informationINF5070 media storage and distribution systems. to-peer Systems 10/
INF5070 Media Storage and Distribution Systems: Peer-to to-peer Systems 10/11 2003 Client-Server! Traditional distributed computing! Successful architecture, and will continue to be so (adding proxy servers)!
More informationPeer-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
More informationExploiting Route Redundancy via Structured Peer to Peer Overlays
Exploiting Route Redundancy ia Structured Peer to Peer Oerlays Ben Y. Zhao, Ling Huang, Jeremy Stribling, Anthony D. Joseph, and John D. Kubiatowicz Uniersity of California, Berkeley Challenges Facing
More informationBadri Nath Rutgers University
lookup services Badri Nath Rutgers University badri@cs.rutgers.edu 1. CAN: A scalable content addressable network, Sylvia Ratnasamy et.al. SIGCOMM 2001 2. Chord: A scalable peer-to-peer lookup protocol
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 informationOverlay and P2P Networks. Unstructured networks. Prof. Sasu Tarkoma
Overlay and P2P Networks Unstructured networks Prof. Sasu Tarkoma 20.1.2014 Contents P2P index revisited Unstructured networks Gnutella Bloom filters BitTorrent Freenet Summary of unstructured networks
More informationDistributed 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
More informationOverlay and P2P Networks. Unstructured networks. Prof. Sasu Tarkoma
Overlay and P2P Networks Unstructured networks Prof. Sasu Tarkoma 19.1.2015 Contents Unstructured networks Last week Napster Skype This week: Gnutella BitTorrent P2P Index It is crucial to be able to find
More informationMotivation. The Impact of DHT Routing Geometry on Resilience and Proximity. Different components of analysis. Approach:Component-based analysis
The Impact of DHT Routing Geometry on Resilience and Proximity Presented by Karthik Lakshminarayanan at P2P Systems class (Slides liberally borrowed from Krishna s SIGCOMM talk) Krishna Gummadi, Ramakrishna
More informationCS514: 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
More informationOverlay and P2P Networks. Introduction. Prof. Sasu Tarkoma
Overlay and P2P Networks Introduction Prof. Sasu Tarkoma 13.1.2014 Contents Course Overview Lectures Assignments/Exercises Course Overview Overlay networks and peer-to-peer technologies have become key
More informationThe Impact of DHT Routing Geometry on Resilience and Proximity. Acknowledgement. Motivation
The Impact of DHT Routing Geometry on Resilience and Proximity Presented by Noorullah Moghul Krishna Gummadi, Ramakrishna Gummadi, Sylvia Ratnasamy, Steve Gribble, Scott Shenker, Ion Stoica Acknowledgement
More informationContent 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
More informationIntroduction 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
More information! Naive n-way unicast does not scale. ! IP multicast to the rescue. ! Extends IP architecture for efficient multi-point delivery. !
Bayeux: An Architecture for Scalable and Fault-tolerant Wide-area Data Dissemination ACM NOSSDAV 001 Shelley Q. Zhuang, Ben Y. Zhao, Anthony D. Joseph, Randy H. Katz, John D. Kubiatowicz {shelleyz, ravenben,
More informationUpgrading From a Successful Emergency Control System to a Complete WAMPAC System for Georgian State Energy System
Upgrading From a Successful Emergency Control System to a Complete WAMPAC System for Georgian State Energy System Dave Dolezilek International Technical Director Schweitzer Engineering Laboratories SEL
More information15-744: Computer Networking P2P/DHT
15-744: Computer Networking P2P/DHT Overview P2P Lookup Overview Centralized/Flooded Lookups Routed Lookups Chord Comparison of DHTs 2 Peer-to-Peer Networks Typically each member stores/provides access
More informationCycloid: A constant-degree and lookup-efficient P2P overlay network
Performance Evaluation xxx (2005) xxx xxx Cycloid: A constant-degree and lookup-efficient P2P overlay network Haiying Shen a, Cheng-Zhong Xu a,, Guihai Chen b a Department of Electrical and Computer Engineering,
More informationUnit 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
More informationOverlay 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
More informationCSCI-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
More informationOssification of the Internet
Ossification of the Internet The Internet evolved as an experimental packet-switched network Today, many aspects appear to be set in stone - Witness difficulty in getting IP multicast deployed - Major
More informationSymphony. 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.
More informationGoals. EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Solution. Overlay Networks: Motivations.
Goals CS : Introduction to Computer Networks Overlay Networks and PP Networks Ion Stoica Computer Science Division Department of lectrical ngineering and Computer Sciences University of California, Berkeley
More informationOverlay and P2P Networks. Introduction. Prof. Sasu Tarkoma
Overlay and P2P Networks Introduction Prof. Sasu Tarkoma 12.1.2015 Contents Course Overview Lectures Assignments/Exercises Course Overview Overlay networks and peer-to-peer technologies have become key
More informationMotivation 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
More informationDistributed Meta-data Servers: Architecture and Design. Sarah Sharafkandi David H.C. Du DISC
Distributed Meta-data Servers: Architecture and Design Sarah Sharafkandi David H.C. Du DISC 5/22/07 1 Outline Meta-Data Server (MDS) functions Why a distributed and global Architecture? Problem description
More informationPeer-to-peer systems
Prof. Dr. Claudia Müller-Birn Institute for Computer Science, Networked Information Systems Peer-to-peer systems Netzprogrammierung (lgorithmen und Programmierung V) Where are we on our topic map? Descriptive
More informationP2P: 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)
More informationAdvanced Distributed Systems. Peer to peer systems. Reference. Reference. What is P2P? Unstructured P2P Systems Structured P2P Systems
Advanced Distributed Systems Peer to peer systems Karl M. Göschka Karl.Goeschka@tuwien.ac.at http://www.infosys.tuwien.ac.at/teaching/courses/ AdvancedDistributedSystems/ What is P2P Unstructured P2P Systems
More informationCPSC 426/526. P2P Lookup Service. Ennan Zhai. Computer Science Department Yale University
CPSC 4/5 PP Lookup Service Ennan Zhai Computer Science Department Yale University Recall: Lec- Network basics: - OSI model and how Internet works - Socket APIs red PP network (Gnutella, KaZaA, etc.) UseNet
More informationLECT-05, S-1 FP2P, Javed I.
A Course on Foundations of Peer-to-Peer Systems & Applications LECT-, S- FPP, javed@kent.edu Javed I. Khan@8 CS /99 Foundation of Peer-to-Peer Applications & Systems Kent State University Dept. of Computer
More informationSmart Grid Communications and Networking
Smart Grid Communications and Networking EKRAM HOSSAIN University of Manitoba, Canada ZHU HAN University of Houston, Texas H. VINCENT POOR Princeton University, New Jersey CAMBRIDGE UNIVERSITY PRESS Contents
More informationAn Intrusion Detection System for Critical Information Infrastructures Using Wireless Sensor Network Technologies
An Intrusion Detection System for Critical Information Infrastructures Using Wireless Sensor Network Technologies The Fifth international CRIS conference on Critical Infrastructures Beijing China, 20 September
More informationAdvanced Computer Networks
Advanced Computer Networks P2P Systems Jianping Pan Summer 2007 5/30/07 csc485b/586b/seng480b 1 C/S vs P2P Client-server server is well-known server may become a bottleneck Peer-to-peer everyone is a (potential)
More informationA Framework for a Comprehensive Evaluation of Ant-Inspired Peer-to-Peer Protocols
A Framework for a Comprehensive Evaluation of Ant-Inspired Peer-to-Peer Protocols Amos Brocco Department of Innovative Technologies, University of Applied Science of Southern Switzerland Ingmar Baumgart,
More informationOpportunistic Application Flows in Sensor-based Pervasive Environments
Opportunistic Application Flows in Sensor-based Pervasive Environments Nanyan Jiang, Cristina Schmidt, Vincent Matossian, and Manish Parashar ICPS 2004 1 Outline Introduction to pervasive sensor-based
More informationA Decentralized Content-based Aggregation Service for Pervasive Environments
A Decentralized Content-based Aggregation Service for Pervasive Environments Nanyan Jiang, Cristina Schmidt, Manish Parashar The Applied Software Systems Laboratory Rutgers, The State University of New
More informationOverSim. A Flexible Overlay Network Simulation Framework. Ingmar Baumgart, Bernhard Heep, Stephan Krause
OverSim A Flexible Overlay Network Simulation Framework Ingmar Baumgart, Bernhard Heep, IEEE Global Internet Symposium 2007, Anchorage, AK, USA Requirements Overlay Flexibility Scalability Underlay Heterogeneity
More informationDistributed lookup services
Distributed lookup services lookup services Badri Nath Rutgers University badri@cs.rutgers.edu A set of nodes cooperating Peers Run special purpose algorithms/software Doesn t have to be deployed at every
More information6. Peer-to-peer (P2P) networks I.
6. Peer-to-peer (P2P) networks I. PA159: Net-Centric Computing I. Eva Hladká Faculty of Informatics Masaryk University Autumn 2010 Eva Hladká (FI MU) 6. P2P networks I. Autumn 2010 1 / 46 Lecture Overview
More informationDistributed Systems. 16. Distributed Lookup. Paul Krzyzanowski. Rutgers University. Fall 2017
Distributed Systems 16. Distributed Lookup Paul Krzyzanowski Rutgers University Fall 2017 1 Distributed Lookup Look up (key, value) Cooperating set of nodes Ideally: No central coordinator Some nodes can
More informationP2P 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
More informationChapter 6 PEER-TO-PEER COMPUTING
Chapter 6 PEER-TO-PEER COMPUTING Distributed Computing Group Computer Networks Winter 23 / 24 Overview What is Peer-to-Peer? Dictionary Distributed Hashing Search Join & Leave Other systems Case study:
More informationDistributed Systems. peer-to-peer Johan Montelius ID2201. Distributed Systems ID2201
Distributed Systems ID2201 peer-to-peer Johan Montelius 1 Idéa use resources in edge of network computing storage communication 2 Computing 3 seti@home central server millions of clients hundred of thousands
More informationAssignment 5. Georgia Koloniari
Assignment 5 Georgia Koloniari 2. "Peer-to-Peer Computing" 1. What is the definition of a p2p system given by the authors in sec 1? Compare it with at least one of the definitions surveyed in the last
More informationDistributed Knowledge Organization and Peer-to-Peer Networks
Knowledge Organization and Peer-to-Peer Networks Klaus Wehrle Group Chair of Computer Science IV RWTH Aachen University http://ds.cs.rwth-aachen.de 1 Organization of Information Essential challenge in?
More informationDistributed Data Management. Profr. Dr. Wolf-Tilo Balke Institut für Informationssysteme Technische Universität Braunschweig
Distributed Data Management Profr. Dr. Wolf-Tilo Balke Institut für Informationssysteme Technische Universität Braunschweig 6 Structured P2P Networks 6.1 Hash Tables 6.2 Distributed Hash Tables 6.3 CHORD
More informationDistributed 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
More information6 Structured P2P Networks
6 Structured P2P Networks Distributed Data Management Wolf-Tilo Balke Christoph Lofi Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 6.1 Hash Tables 6.3
More informationPeer- 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
More informationDebunking some myths about structured and unstructured overlays
Debunking some myths about structured and unstructured overlays Miguel Castro Manuel Costa Antony Rowstron Microsoft Research, 7 J J Thomson Avenue, Cambridge, UK Abstract We present a comparison of structured
More informationMin-Ho Shin Doctor of Philosophy, 2008
ABSTRACT Title of dissertation: Fast Scalable Peer-to-Peer Lookup Services for Multi-Hop Wireless Networks Min-Ho Shin Doctor of Philosophy, 8 Dissertation directed by: Professor William A. Arbaugh Department
More informationDISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S. TANENBAUM MAARTEN VAN STEEN. Chapter 2 ARCHITECTURES
DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S. TANENBAUM MAARTEN VAN STEEN Chapter 2 ARCHITECTURES Architectural Styles Important styles of architecture for distributed systems Layered
More informationECSP: An Efficient Clustered Super-Peer Architecture for P2P Networks
ECSP: An Efficient Clustered Super-Peer Architecture for P2P Networks by Juan Li M.Sc., Institute of Software, Chinese Academy of Sciences 2001 B.Sc., Northern Jiaotong University, 1997 A THESIS SUBMITTED
More informationWSN Routing Protocols
WSN Routing Protocols 1 Routing Challenges and Design Issues in WSNs 2 Overview The design of routing protocols in WSNs is influenced by many challenging factors. These factors must be overcome before
More informationThree Layer Hierarchical Model for Chord
Three Layer Hierarchical Model for Chord Waqas A. Imtiaz, Shimul Shil, A.K.M Mahfuzur Rahman Abstract Increasing popularity of decentralized Peer-to-Peer (P2P) architecture emphasizes on the need to come
More informationPart 1: Introducing DHTs
Uni Innsbruck Informatik - Peer-to to-peer Systems Structured PP file sharing systems Michael Welzl michael.welzl@uibk.ac.at DPS NSG Team http://dps.uibk.ac.at dps.uibk.ac.at/nsg Institute of Computer
More informationP2P 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
More informationResilient GIA. Keywords-component; GIA; peer to peer; Resilient; Unstructured; Voting Algorithm
Rusheel Jain 1 Computer Science & Information Systems Department BITS Pilani, Hyderabad Campus Hyderabad, A.P. (INDIA) F2008901@bits-hyderabad.ac.in Chittaranjan Hota 2 Computer Science & Information Systems
More informationNSFA: Nested Scale-Free Architecture for Scalable Publish/Subscribe over P2P Networks
NSFA: Nested Scale-Free Architecture for Scalable Publish/Subscribe over P2P Networks Huanyang Zheng and Jie Wu Dept. of Computer and Info. Sciences Temple University Road Map Introduction Nested Scale-Free
More informationPage 1. How Did it Start?" Model" Main Challenge" CS162 Operating Systems and Systems Programming Lecture 24. Peer-to-Peer Networks"
How Did it Start?" CS162 Operating Systems and Systems Programming Lecture 24 Peer-to-Peer Networks" A killer application: Napster (1999) Free music over the Internet Key idea: share the storage and bandwidth
More informationLast Time. CSE 486/586 Distributed Systems Distributed Hash Tables. What We Want. Today s Question. What We Want. What We Don t Want C 1
Last Time Distributed Systems Distributed Hash Tables Evolution of peer-to-peer Central directory (Napster) Query flooding (Gnutella) Hierarchical overlay (Kazaa, modern Gnutella) BitTorrent Focuses on
More informationC 1. Last Time. CSE 486/586 Distributed Systems Distributed Hash Tables. Today s Question. What We Want. What We Want. What We Don t Want
Last Time Distributed Systems Distributed Hash Tables Evolution of peer-to-peer Central directory (Napster) Query flooding (Gnutella) Hierarchical overlay (Kazaa, modern Gnutella) BitTorrent Focuses on
More informationThe 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 -
More informationCS 640 Introduction to Computer Networks. Today s lecture. What is P2P? Lecture30. Peer to peer applications
Introduction to Computer Networks Lecture30 Today s lecture Peer to peer applications Napster Gnutella KaZaA Chord What is P2P? Significant autonomy from central servers Exploits resources at the edges
More informationCS4700/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
More informationRouting protocols in WSN
Routing protocols in WSN 1.1 WSN Routing Scheme Data collected by sensor nodes in a WSN is typically propagated toward a base station (gateway) that links the WSN with other networks where the data can
More information