P2P Topologies CentralizedCentralized RingRing HierarchicalHierarchical DecentralizedDecentralized HybridHybrid.

Slides:



Advertisements
Similar presentations
Performance in Decentralized Filesharing Networks Theodore Hong Freenet Project.
Advertisements

Routing in Poisson small-world networks A. J. Ganesh Microsoft Research, Cambridge Joint work with Moez Draief.
Data Communications and Networking
Nilesh Agre Wedashree Jalukar Neelima Shahi Group Members.
The Small World Phenomenon: An Algorithmic Perspective Speaker: Bradford Greening, Jr. Rutgers University – Camden.
1 Analyzing Kleinberg’s Small-world Model Chip Martel and Van Nguyen Computer Science Department; University of California at Davis.
Small-world networks.
Online Social Networks and Media Navigation in a small world.
P2P Topologies Centralized Ring Hierarchical Decentralized Hybrid.
Peer-to-Peer is Not Always Decentralized …when Centralization is Good Nelson Minar
UNIT-1. Overwiew Peer-to-Peer Networks Server based Networks Broadcast Networks Point-to-Point Networks Circuit Switching. Packet Switching. Message Switching.
Routing: Cores, Peers and Algorithms
Sociology and CS Philip Chan. How close are people connected? Are people closely connected, not closely connected, isolated into groups, …
UNIT-1. Overview Peer-to-Peer Networks Server based Networks Broadcast Networks Point-to-Point Networks Circuit Switching. Packet Switching. Message Switching.
Company LOGO 1 Identity and Search in Social Networks D.J.Watts, P.S. Dodds, M.E.J. Newman Maryam Fazel-Zarandi.
1.Optimizing P2P Networks: Lessons learned from social networking a)Social Networks b)Lessons Learned c)Are P2P Networks Social?? d)Organizing P2P Networks.
Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.
Small-World Graphs for High Performance Networking Reem Alshahrani Kent State University.
Small Worlds Presented by Geetha Akula For the Faculty of Department of Computer Science, CALSTATE LA. On 8 th June 07.
© Centre for Integral Excellence Sheffield Hallam University Mike Pupius Centre for Integral.
Cis e-commerce -- lecture #6: Content Distribution Networks and P2P (based on notes from Dr Peter McBurney © )
Small Worlds and the Security of Ubiquitous Computing From : IEEE CNF Author : Harald Vogt Presented by Chen Shih Yu.
Wide-area cooperative storage with CFS
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
Peer-to-Peer and Social Networks Introduction. What is a P2P network Uses the vast resource of the machines at the edge of the Internet to build a network.
Introduction to Peer-to-Peer Networks. What is a P2P network Uses the vast resource of the machines at the edge of the Internet to build a network that.
Chapter 2 Network Design Essentials Instructor: Nhan Nguyen Phuong.
Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.
Introduction to Peer-to-Peer Networks. What is a P2P network A P2P network is a large distributed system. It uses the vast resource of PCs distributed.
1 Computing with Social Networks on the Web (2008 slide deck) Jennifer Golbeck University of Maryland, College Park Jim Hendler Rensselaer Polytechnic.
NETWORK TOPOLOGIES HNC COMPUTING - Network Concepts 1 Network Concepts Topologies.
Section 8 – Ec1818 Jeremy Barofsky March 31 st and April 1 st, 2010.
Peer to Peer Research survey TingYang Chang. Intro. Of P2P Computers of the system was known as peers which sharing data files with each other. Build.
Hybrid Overlay Multicast Framework draft-irtf-sam-hybrid-overlay-framework-02.txt John Buford, Avaya Labs Research IETF 71.
Small-world networks. What is it? Everyone talks about the small world phenomenon, but truly what is it? There are three landmark papers: Stanley Milgram.
 Topology Topology  Different types of topology Different types of topology  bus topologybus topology  ring topologyring topology  star topologystar.
Mr C Johnston ICT Teacher BTEC IT Unit 05 - Lesson 03 Network Topologies.
Online Social Networks and Media
Freelib: A Self-sustainable Digital Library for Education Community Ashraf Amrou, Kurt Maly, Mohammad Zubair Computer Science Dept., Old Dominion University.
Network Concepts Topologies
Mr C Johnston ICT Teacher
Complex Network Theory – An Introduction Niloy Ganguly.
P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,
Computer Networking P2P. Why P2P? Scaling: system scales with number of clients, by definition Eliminate centralization: Eliminate single point.
Complex Network Theory – An Introduction Niloy Ganguly.
Most of contents are provided by the website Network Models TJTSD66: Advanced Topics in Social Media (Social.
What Is A Network? (and why do we care?). An Introduction to Network Theory | Kyle Findlay | SAMRA 2010 | 2 “A collection of objects (nodes) connected.
Peer to Peer Network Design Discovery and Routing algorithms
CS:4980:0005 Peer-to-Peer and Social Networks Fall 2015 Introduction.
Peer to Peer Computing. What is Peer-to-Peer? A model of communication where every node in the network acts alike. As opposed to the Client-Server model,
Small World Social Networks With slides from Jon Kleinberg, David Liben-Nowell, and Daniel Bilar.
Network Topologies Created by: Ghadeer H. Abosaeed June 22, 2012.
Analyzing Networks. Milgram’s Experiments “Six degrees of Separation” Milgram’s letters to various recruits in Nebraska who were asked to forward the.
Models and Algorithms for Complex Networks
Netlogo demo. Complexity and Networks Melanie Mitchell Portland State University and Santa Fe Institute.
Computer Networks Part 2
Topics In Social Computing (67810) Module 1 Introduction & The Structure of Social Networks.
Topologies and behavioral properties of the network Yvon Kermarrec Based on tml.
Network Topology Computer network topology is the way various components of a network (like nodes, links, peripherals, etc) are arranged. Network topologies.
CS:4980:0001 Peer-to-Peer and Social Networks Fall 2017
Social Networks Some content from Ding-Zhu Du, Lada Adamic, and Eytan Adar.
CS:4980:0001 Peer-to-Peer and Social Networks Fall 2017
CHAPTER 3 Architectures for Distributed Systems
Introduction to Computers
DHT Routing Geometries and Chord
Research Scopes in Complex Network
Freenet.
Computer communications
Network Topologies Charles Warren.
Navigation and Propagation in Networks
Presentation transcript:

P2P Topologies CentralizedCentralized RingRing HierarchicalHierarchical DecentralizedDecentralized HybridHybrid

Two extremes when N=6 H=1 (1) M=5 (N-1) H=5 (N-1) M=2 (2) H=no. of hops M=no. of link updates when a new node joins Complete Ring

Consider Scale But if N=2 32 (4 billion - population of the world)But if N=2 32 (4 billion - population of the world) RingRing –M=2, H=2 32 –1 (retrieval: week with fast net) –Does not scale CompleteComplete –H=1, M= 2 32 –1 –Does not scale Key idea: place yourself in betweenKey idea: place yourself in between –e.g. H=4 M=762 –e.g. H=8 M=120

Centralized Topology

Ring Topology

Hierarchical Topology

Decentralized Topology

Hybrid Topology Centralized + Ring

Hybrid Topology Centralized + Decentralized

Evaluating topologies ManageabilityManageability –How hard is it to keep working? Information coherenceInformation coherence –How authoritative is info? (Auditing, non- repudiation) ExtensibilityExtensibility –How easy is it to grow? Fault toleranceFault tolerance –How well can it handle failures?

Evaluating topologies Resistance to legal interventionResistance to legal intervention –How hard is it to shut down? (Can be good or bad) SecuritySecurity –How hard is it to subvert? ScalabilityScalability –How big can it grow?

Centralized Manageable Coherent Extensible Fault Tolerant Secure Lawsuit-proof Scalable System is all in one place All information is in one place XNo one can add on to system XSingle point of failure Simply secure one host XEasy to shut down ?One machine. But in practice?

Ring Manageable Coherent Extensible Fault Tolerant Secure Lawsuit-proof Scalable Simple rules for relationships Easy logic for state XOnly ring owner can add Fail-over to next host As long as ring has one owner XShut down owner Just add more hosts

Hierarchical Manageable Coherent Extensible Fault Tolerant Secure Lawsuit-proof Scalable ½Chain of authority ½Cache consistency ½Add more leaves, rebalance ½Root is vulnerable XToo easy to spoof links XJust shut down the root Hugely scalable – DNS

Decentralized Manageable Coherent Extensible Fault Tolerant Secure Lawsuit-proof Scalable XVery difficult, many owners XDifficult, unreliable peers Anyone can join in Redundancy XDifficult, open research No one to sue Theoretically yes

Centralized + Ring Manageable Coherent Extensible Fault Tolerant Secure Lawsuit-proof Scalable Just manage the ring As coherent as ring XNo more than ring Ring is a huge win As secure as ring XStill single place to shut down Ring is a huge win Common architecture for web applications

Centralized + Decentralized Manageable Coherent Extensible Fault Tolerant Secure Lawsuit-proof Scalable XSame as decentralized ½Better than decentralized Anyone can still join! Plenty of redundancy XSame as decentralized Still no one to sue Usually Best architecture for P2P networks

Small Word Phenomenon The small world phenomenonThe small world phenomenon (also known as the small world effect) (also known as the small world effect) –is the hypothesis that everyone in the world can be reached through a short chain of social links

Early conceptions of the six degrees idea The "shrinking world" of Frigyes Karinthy (Hungarian), 1929The "shrinking world" of Frigyes Karinthy (Hungarian), 1929 –He believed that the modern world was shrinking due to technological advances in communications and travel –He believed that any two individuals could be connected through at most five connections –Experiment to prove that the population of the Earth is closer together now than they have ever been before select any person from the 1.5 billion inhabitants of the Earthselect any person from the 1.5 billion inhabitants of the Earth –anyone, anywhere at all using no more than five individuals, one of whom is a personal friend, he could contact the selected individual using nothing except the network of personal friendsusing no more than five individuals, one of whom is a personal friend, he could contact the selected individual using nothing except the network of personal friends Karinthy is often regarded as the origin of the notion of Six Degrees of Separation

Six Degrees of Separation Stanley Milgram was an American researcher in experimental social psychology at Harvard University in Boston, USAStanley Milgram was an American researcher in experimental social psychology at Harvard University in Boston, USA Stanley Milgram's small world experiments (1967)Stanley Milgram's small world experiments (1967) –Milgram's experiments provided evidence supporting the claim of a "small world“ –People in the United States seemed to be connected by approximately six friendship links, on average –Milgram did not use the term „six degrees of separatio n Milgram's experimentMilgram's experiment –sent 60 letters from Omaha, Nebraska to Sharon, Massachasetts –The participants could only pass the letters (by hand) to personal they thought might be able to reach the target — whether directly or via a "friend of a friend“ –50 people responded –only three letters eventually reached their destination The expression “six degrees of separation” was bornThe expression “six degrees of separation” was born

The Small World Effect Pass the letters to a target person in Boston using only intermediaries known to one another on a first-name basisPass the letters to a target person in Boston using only intermediaries known to one another on a first-name basis Each person passed the letter to a friend whom he/she thought might bring the letter closest to the target; the friend would then pass it on to another friend and so on until the letter reached the target personEach person passed the letter to a friend whom he/she thought might bring the letter closest to the target; the friend would then pass it on to another friend and so on until the letter reached the target person 42 letters made it through via a median number of just 5.5 intermediaries42 letters made it through via a median number of just 5.5 intermediaries Milgram’s six degrees of separation: “It’s a small world”Milgram’s six degrees of separation: “It’s a small world”

One possible path of a message in the Small World experiment

The Power-Law Graphs Highly clustered, short pathsHighly clustered, short paths “short cuts”: long range edges“short cuts”: long range edges High-degree nodes are crucial for short pathsHigh-degree nodes are crucial for short paths

Connectivity of Gnutella (The small-world effect)