An Interactive Visualization of Super-peer P2P Networks Peiqun (Anthony) Yu.

Slides:

Advertisements

Similar presentations

1 Very Large-Scale Incremental Clustering Berk Berker Mumin Cebe Ismet Zeki Yalniz 27 March 2007.

Advertisements

Technion –Israel Institute of Technology Computer Networks Laboratory A Comparison of Peer-to-Peer systems by Gomon Dmitri and Kritsmer Ilya under Roi.

Yiannis Demiris and Anthony Dearden By James Gilbert.

BinX Dynamic binning for time series Project update Information Visualization - CS533c Lior Berry March 15 th 2004.

P2p, Spring 05 1 Topics in Database Systems: Data Management in Peer-to-Peer Systems March 29, 2005.

ClearEye: An Visualization System for Document Revision CPSC 533C Project Update Qiang Kong Qixing Zheng.

YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology Qixiang Sun Prasanna Ganesan Hector Garcia-Molina Stanford University.

Technion –Israel Institute of Technology Software Systems Laboratory A Comparison of Peer-to-Peer systems by Gomon Dmitri and Kritsmer Ilya under Roi Melamed.

Project Suggestions. Proposal Requirements Specific scenarios Focus on visualization aspects –Clear visualization goals –Not just a copy of an existing.

Spotlighting Decentralized P2P File Sharing Archie Kuo and Ethan Le Department of Computer Science San Jose State University.

UNIVERSITY OF JYVÄSKYLÄ Topology Management in Unstructured P2P Networks Using Neural Networks Presentation for IEEE Congress on Evolutionary Computing.

Rendezvous Points-Based Scalable Content Discovery with Load Balancing Jun Gao Peter Steenkiste Computer Science Department Carnegie Mellon University.

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,

1 Maximizing Remote Work in Flooding-based P2P Systems Qixiang Sun Neil Daswani Hector Garcia-Molina Stanford University.

Fishery View Improvement of Time Series Line Chart Visualization of Fishery Data CPSC 533C Final Presentation Ying Zhang & Lan Wu December 19 th 2005.

LSDS-IR’08, October 30, Peer-to-Peer Similarity Search over Widely Distributed Document Collections Christos Doulkeridis 1, Kjetil Nørvåg 2, Michalis.

ShadyStats Final Report Mike Cora December 19, C: Information Visualization.

Object Naming & Content based Object Search 2/3/2003.

Chord-over-Chord Overlay Sudhindra Rao Ph.D Qualifier Exam Department of ECECS.

Abstract Shortest distance query is a fundamental operation in large-scale networks. Many existing methods in the literature take a landmark embedding.

A Framework for Cost-Effective Peer-to- Peer Content Distribution Mohamed Hefeeda and Bharat Bhargava Department of Computer Sciences Purdue University.

Memoplex Browser: Searching and Browsing in Semantic Networks CPSC 533C - Project Update Yoel Lanir.

Graph Visualization Tools NAM, Javis, Otter, H3Viewer Burton Filstrup.

Link Recommendation In P2P Social Networks Yusuf Aytaş, Hakan Ferhatosmanoğlu, Özgür Ulusoy Bilkent University, Ankara, Turkey.

1 Locating Application Data Across Service Discovery Domains MobiCom’01.

An affinity-driven clustering approach for service discovery and composition for pervasive computing J. Gaber and M.Bakhouya Laboratoire SeT Université.

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.

A Metadata Based Approach For Supporting Subsetting Queries Over Parallel HDF5 Datasets Vignesh Santhanagopalan Graduate Student Department Of CSE.

BitTorrent enabled Ad Hoc Group 1  Garvit Singh( )  Nitin Sharma( )  Aashna Goyal( )  Radhika Medury( )

Network Computing Laboratory Scalable File Sharing System Using Distributed Hash Table Idea Proposal April 14, 2005 Presentation by Jaesun Han.

Super-peer Network. Motivation: Search in P2P Centralised (Napster) Flooding (Gnutella)  Essentially a breadth-first search using TTLs Distributed Hash.

Quantitative Evaluation of Unstructured Peer-to-Peer Architectures Fabrício Benevenuto José Ismael Jr. Jussara M. Almeida Department of Computer Science.

ProtoVis Peter Sikachev Institute of Computer Graphics and Algorithms Vienna University of Technology.

User interface design and human computer interaction Xiangming Mu.

Exploiting Context Analysis for Combining Multiple Entity Resolution Systems -Ramu Bandaru Zhaoqi Chen Dmitri V.kalashnikov Sharad Mehrotra.

Carnegie Mellon School of Computer Science Copyright © 2004, Carnegie Mellon. All Rights Reserved. Content-Based Retrieval in Hierarchical Peer-to-Peer.

Freelib: A Self-sustainable Digital Library for Education Community Ashraf Amrou, Kurt Maly, Mohammad Zubair Computer Science Dept., Old Dominion University.

An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.

Efficient Semantic Based Content Search in P2P Network Heng Tao Shen, Yan Feng Shu, and Bei Yu.

1 Peer-to-Peer Technologies Seminar by: Kunal Goswami (05IT6006) School of Information Technology Guided by: Prof. C.R.Mandal, School of Information Technology.

Peer to Peer A Survey and comparison of peer-to-peer overlay network schemes And so on… Chulhyun Park

By Jonathan Drake.  The Gnutella protocol is simply not scalable  This is due to the flooding approach it currently utilizes  As the nodes increase.

1. Efficient Peer-to-Peer Lookup Based on a Distributed Trie 2. Complex Queries in DHT-based Peer-to-Peer Networks Lintao Liu 5/21/2002.

International Symposium on Grid Computing (ISGC-07), Taipei - March 26-29, 2007 Of 16 1 A Novel Grid Resource Broker Cum Meta Scheduler - Asvija B System.

Computer Science and Engineering - University of Notre Dame Jimmy Neutron CSE 40827/60827 – Ubiquitous Computing December 9, 2009 Project Presentation.

Progress presentation

Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks

Design of a Robust Search Algorithm for P2P Networks

Two Peer-to-Peer Networking Approaches Ken Calvert Net Seminar, 23 October 2001 Note: Many slides “borrowed” from S. Ratnasamy’s Qualifying Exam talk.

Project funded by the Future and Emerging Technologies arm of the IST Programme Search in Unstructured Networks Niloy Ganguly, Andreas Deutsch Center for.

Author: Weirong Jiang and Viktor K. Prasanna Publisher: The 18th International Conference on Computer Communications and Networks (ICCCN 2009) Presenter:

InfoVis Cyberinfrastructure Shashikant Penumarthy, Bruce Herr & Katy Börner School of Library and Information Science sprao | bherr

CMSC 691B Multi-Agent System A Scalable Architecture for Peer to Peer Agent by Naveen Srinivasan.

Zachary Starr Dept. of Computer Science, University of Missouri, Columbia, MO 65211, USA Digital Image Processing Final Project Dec 11 th /16 th, 2014.

OBJECT LOCATION IN UNSTRUCTURED P2P NETWORKS USING RANDOM WALK

Urban Sensing Based on Human Mobility

Application Aware Acceleration

Peer-to-Peer Data Management

CSE5544 Final Project Interactive Visualization Tool(s) for IEEE Vis Publication Exploration and Analysis Team Name: Publication Miner Team Members:

CSE5544 Final Project Interactive Visualization Tool(s) for IEEE Vis Publication Exploration and Analysis Team Name: Publication Miner Team Members:

Early Measurements of a Cluster-based Architecture for P2P Systems

A Scalable content-addressable network

Efficient Distribution-based Feature Search in Multi-field Datasets Ohio State University (Shen) Problem: How to efficiently search for distribution-based.

Topological Ordering Algorithm: Example

Topological Ordering Algorithm: Example

Deterministic and Semantically Organized Network Topology

Topological Ordering Algorithm: Example

MississaugaTalks! Saif Shaikh March 5, 2016 Code and the City

Topological Ordering Algorithm: Example

L. Glimcher, R. Jin, G. Agrawal Presented by: Leo Glimcher

Presentation transcript:

An Interactive Visualization of Super-peer P2P Networks Peiqun (Anthony) Yu

Project Domain and Background P2P computing has become increasingly popular nowadays Locating content in an efficient and scalable way is challenging Efficient Clustered Super-peer P2P modal is a novel approach to address this issue An Efficient Flooding Algorithm(EFA) is proposed

Hierarchical structure vs. Gnutella structure

System Architecture

Content Searching Where is “James Bond”?

Motivation P2P network tends to be large scale (1000 nodes) It’s hard for people to have an overall picture of the hierarchical super-peer P2P networks, and the internal structure of each cluster of peers We want to see the effect of the Efficient Flooding Algorithm (EFA) We want to verify that EFA is more efficient than simple flooding Algorithm

Dataset A program is implemented for generating networks in different topologies: Random Grid Barabasi-Albert

InfoVis Solution Task #1: visualize super-peer P2P networks Overview + detail Interaction Task #2: visualize the effect of the EFA Animation Color scheme Task #3: verify the efficiency of EFA Side-by-side comparison Patten match (Bar chart and color match)

Topology View

Comparison View

Implementation Approach Java2D and Swing InfoVis toolkit

MileStones March 15 th : completing interface design and implementation March 25 th : completing task #1 --- Visualizing super- peer P2P networks April 5 th : completing task #2 --- visualizing the effect of the Efficient Flooding Algorithm April 15 th : completing task #3 --- verifying the efficiency of EFA April 20 th : completing final report.

Questions?