When Simple Networks Fail: Characterising Social Networks Using Simulation Bruce Edmonds Centre for Policy Modelling Manchester Metropolitan University.

Slides:



Advertisements
Similar presentations
A Construction of Locality-Aware Overlay Network: mOverlay and Its Performance Found in: IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 22, NO.
Advertisements

Key Metrics for Effective Storage Performance and Capacity Reporting.
Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
Modeling Maze Navigation Consider the case of a stationary robot and a mobile robot moving towards a goal in a maze. We can model the utility of sharing.
LOAD BALANCING IN A CENTRALIZED DISTRIBUTED SYSTEM BY ANILA JAGANNATHAM ELENA HARRIS.
Playback delay in p2p streaming systems with random packet forwarding Viktoria Fodor and Ilias Chatzidrossos Laboratory for Communication Networks School.
Efficient Search - Overview Improving Search In Peer-to-Peer Systems Presented By Jon Hess cs294-4 Fall 2003.
University of Cincinnati1 Towards A Content-Based Aggregation Network By Shagun Kakkar May 29, 2002.
Issues in Modelling the Hawala System Bruce Edmonds Centre for Policy Modelling Manchester Metropolitan University Issues in Modelling the Hawala System,
Search in Power-Law Networks Presented by Hakim Weatherspoon CS294-4: Peer-to-Peer Systems Slides also borrowed from the following paper Path Finding Strategies.
Denial-of-Service Resilience in Peer-to-Peer Systems D. Dumitriu, E. Knightly, A. Kuzmanovic, I. Stoica and W. Zwaenepoel Presenter: Yan Gao.
Efficient and Flexible Parallel Retrieval using Priority Encoded Transmission(2004) CMPT 886 Represented By: Lilong Shi.
An Energy Efficient Hierarchical Heterogeneous Wireless Sensor Network
Distributed Databases Logical next step in geographically dispersed organisations goal is to provide location transparency starting point = a set of decentralised.
Rheeve: A Plug-n-Play Peer- to-Peer Computing Platform Wang-kee Poon and Jiannong Cao Department of Computing, The Hong Kong Polytechnic University ICDCSW.
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
A Trust Based Assess Control Framework for P2P File-Sharing System Speaker : Jia-Hui Huang Adviser : Kai-Wei Ke Date : 2004 / 3 / 15.
Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems Presented by: Lin Wing Kai.
Exploiting Content Localities for Efficient Search in P2P Systems Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang 1 1 College of William and Mary,
Freddies: DHT-Based Adaptive Query Processing via Federated Eddies Ryan Huebsch Shawn Jeffery CS Peer-to-Peer Systems 12/9/03.
Gnutella, Freenet and Peer to Peer Networks By Norman Eng Steven Hnatko George Papadopoulos.
A Distributed Search Service for Peer-to-Peer File Sharing in Mobile Application Presented by Tony Sung On Loy, MC Lab, CUHK IE 1 A Distributed Search.
Peer-to-peer file-sharing over mobile ad hoc networks Gang Ding and Bharat Bhargava Department of Computer Sciences Purdue University Pervasive Computing.
Middleware for P2P architecture Jikai Yin, Shuai Zhang, Ziwen Zhang.
PROMISE: Peer-to-Peer Media Streaming Using CollectCast Presented by: Randeep Singh Gakhal CMPT 886, July 2004.
On the Anonymity of Anonymity Systems Andrei Serjantov (anonymous)
Introduction Widespread unstructured P2P network
J. He, G. Kesidis and D.J. Miller – The Pennsylvania State University In collaboration with K. Levitt, J. Rowe, S.F. Wu – The University of California.
Computer Network By Tahir Saad. Introduction to computer networking Content : The definitions of networking Use of network Network classification.
Exploring VoD in P2P Swarming Systems By Siddhartha Annapureddy, Saikat Guha, Christos Gkantsidis, Dinan Gunawardena, Pablo Rodriguez Presented by Svetlana.
Peer to Peer Network Anas Hardan. What is a Network? What is a Network? A network is a group of computers and other devices (such as printers) that are.
Netwrok and the internet Part two Introduction to computer, 2nd semester, 2009/2010 Mr.Nael Aburas Faculty of Information.
09/07/2004Peer-to-Peer Systems in Mobile Ad-hoc Networks 1 Lookup Service for Peer-to-Peer Systems in Mobile Ad-hoc Networks M. Tech Project Presentation.
1 Telematica di Base Applicazioni P2P. 2 The Peer-to-Peer System Architecture  peer-to-peer is a network architecture where computer resources and services.
Thesis Proposal Data Consistency in DHTs. Background Peer-to-peer systems have become increasingly popular Lots of P2P applications around us –File sharing,
Genetic Regulatory Network Inference Russell Schwartz Department of Biological Sciences Carnegie Mellon University.
P.1Service Control Technologies for Peer-to-peer Traffic in Next Generation Networks Part2: An Approach of Passive Peer based Caching to Mitigate P2P Inter-domain.
2-Day Introduction to Agent-Based Modelling Day 2: Session 8 Exploring Model Collections, NetLogo Lists, Further Resources.
Strategic Planning Session David Rudder, Ph.D. Rudder Consultants, LLC. May 17, 2006.
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.
Using the Small-World Model to Improve Freenet Performance Hui Zhang Ashish Goel Ramesh Govindan USC.
Structuring P2P networks for efficient searching Rishi Kant and Abderrahim Laabid Abderrahim Laabid.
Benjamin AraiUniversity of California, Riverside Reliable Hierarchical Data Storage in Sensor Networks Song Lin – Benjamin.
Content Sharing over Smartphone-Based Delay- Tolerant Networks.
Quantitative Evaluation of Unstructured Peer-to-Peer Architectures Fabrício Benevenuto José Ismael Jr. Jussara M. Almeida Department of Computer Science.
A Collaborative and Semantic Data Management Framework for Ubiquitous Computing Environment International Conference of Embedded and Ubiquitous Computing.
Enabling Peer-to-Peer SDP in an Agent Environment University of Maryland Baltimore County USA.
Fast Searching in Peer-to-Peer Networks Self-Organizing Parallel Search Clusters Rocky Dunlap.
Peer Pressure: Distributed Recovery in Gnutella Pedram Keyani Brian Larson Muthukumar Senthil Computer Science Department Stanford University.
Emergent Group-Like Selection in a Peer-to-Peer Network ECCS Conference Paris, Nov. 16 th, 2005 David Hales University of Bologna, Italy
Efficient P2P Search by Exploiting Localities in Peer Community and Individual Peers A DISC’04 paper Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang.
Revealing the weakness of SNA and possibly fixing it, using MAS Bruce Edmonds Centre for Policy Modelling Manchester Metropolitan University.
By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.
Computer Networking P2P. Why P2P? Scaling: system scales with number of clients, by definition Eliminate centralization: Eliminate single point.
Peer-to-Peer Modeling: Expanding and Specifying the Model Mike Kissinger and Jeremy Tout.
Peer to Peer Network Design Discovery and Routing algorithms
COS 420 Day 15. Agenda Finish Individualized Project Presentations on Thrusday Have Grading sheets to me by Friday Group Project Discussion Goals & Timelines.
Education 793 Class Notes Inference and Hypothesis Testing Using the Normal Distribution 8 October 2003.
Freenet: Anonymous Storage and Retrieval of Information
 Distributed Database Concepts  Parallel Vs Distributed Technology  Advantages  Additional Functions  Distribution Database Design  Data Fragmentation.
Lecture 15 Page 1 CS 236 Online Evaluating Running Systems Evaluating system security requires knowing what’s going on Many steps are necessary for a full.
CMSC 691B Multi-Agent System A Scalable Architecture for Peer to Peer Agent by Naveen Srinivasan.
P2P Networking: Freenet Adriane Lau November 9, 2004 MIE456F.
CSE333 CSE333 DDS.1 A System for Creating Specialized DDS Architectures Research and Work By: Tom Puzak Nathan Viniconis Solomon Berhe Jeffrey Peck Project.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Distributed Caching and Adaptive Search in Multilayer P2P Networks Chen Wang, Li Xiao, Yunhao Liu, Pei Zheng The 24th International Conference on Distributed.
Trustworthiness Management in the Social Internet of Things
CHAPTER 3 Architectures for Distributed Systems
ONLINE SECURE DATA SERVICE
Presentation transcript:

When Simple Networks Fail: Characterising Social Networks Using Simulation Bruce Edmonds Centre for Policy Modelling Manchester Metropolitan University Edmund Chattoe Department of Sociology University of Oxford

Plan of the talk Really only a prospectus for the paper! A concern with network measurement and explanation A case study of a simulation of a Peer- to-peer system A proposed solution

Background/Terminology Generative process: Gives rise to measured social network (Triad balance, preferential attachment …) Distributive process: Gives rise to distribution of attributes over network (Information transmission) Only conceptually separate (favours)

“Typical” SNA and measurement Associations between network measures and attributes (or other network measures) Generative challenge: What can we infer from associations about the underlying generative process? Distributive challenge: What can we infer from associations about the underlying distributive process? Not just criticisms of statistics revisited

Special concerns Are networks complex (not linear) systems? (Where does this leave inference?) To what extent do effects of networks depend on whole structure rather than separable characterisations of nodes? What do we say about dynamic networks? How do we tell how much of a problem this is?

Simplistic example Same densities for all ties but one has a loop (alternative routes) and is disjoint. Problem gets more ambiguous when there is missing data. CASE A CASE B

What does simulation contribute? Point is not simply that density is an insufficient measure. We can raise the same issue about any measure or set of measures. Explicit formulation of generative process Explicit formulation of distributive process Ability to “sample” the simulated system in more than one way at very low cost.

The problem Under what circumstances can existing network measures can tell us useful things about the generative and distributive mechanisms at work in networks? What do we do when the existing measures fail in particular applications or classes of cases?

Case study – A Peer-to-Peer (P2P) File-sharing system Collection of servers, each of which: –Is controlled by a user to some extent –‘Knows’ a limited number of servers, with which it can communicate (the network) –Makes some (or no) files available for download by other servers –Search for files is by flood-fill: (i.e. send query to n others who send it to n others…) –If query matches an available file it is sent back to originator

A Simulation of a P2P System 50 servers, each can decide to share files (coop) or not (def) at any time Try collect ‘sets’ of related files stored (initially) randomly by sending queries Satisfaction is measured by success at collecting files – (small) cost of dealing with others’ queries (but decays over time) May look at and copy what a more satisfied server does, or may drop out and be replaced (especially if satisfaction is low)

Number of co-operators in a run of the simulation Key issue is number (and manner) of cooperation Why does anyone cooperate? How does network structure impact upon this?

Typical Emergent Network Structure

Size of partitions during a run Blue – size of largest partition Green – 2 nd largest (if there is one) Red, orange, etc. – even smaller ones

Suggests four types of node In-coop – those who share their files in core partition In-def – those who don’t share their files in core partition Out-coop – those who share their files but are outside the core partition Out-def – those who don’t share their files but are outside the core partition

Some Statistics TypeAverage utility Average number of links Average centrality in-coop out-coop in-def out-def

Regression coefficients with satisfaction levels of nodes TypeNumber of links Number of links lagged 6 periods CentralityCentrality lagged 6 periods in-coop out-coop in-def out-def

A history of a single node Blue/green – is level of satisfaction (blue when coop green when def) Red – number of outgoing arcs / 5 Orange – measure of centrality (0 – least to 1–most central)

Conclusion of Case-study The global measures were not very useful in providing ‘leverage’ on what was happening Rather a structural analysis based on a detailed understanding of the dynamics created a more useful categorisation of node types. It can be unsafe to assume that such measures derived from empirical studies give a helpful picture of the role of networks

Caveats Implausibility critique: Simulations not very “social” so SNA (developed on “real” networks) not challenged Naivety critique: Real practitioners of SNA would not have used those measures. BUT an attempt to raise a general problem and thus will require dialogue with traditional SNA to avoid these critiques. Dialogue has to start somewhere.

A Way Forward – staging abstraction with simulation