03/19/02Scalab Seminar Series1 Finding Good Peers in Peer-to-Peer Networks Ramaswamy N.Vadivelu Scalab, ASU.

Slides:

Advertisements

Similar presentations

C. Mastroianni, D. Talia, O. Verta - A Super-Peer Model for Resource Discovery Services in Grids A Super-Peer Model for Building Resource Discovery Services.

Advertisements

Quality-of-Service Routing in IP Networks Donna Ghosh, Venkatesh Sarangan, and Raj Acharya IEEE TRANSACTIONS ON MULTIMEDIA JUNE 2001.

Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.

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

1 An Overview of Gnutella. 2 History The Gnutella network is a fully distributed alternative to the centralized Napster. Initial popularity of the network.

Search and Replication in Unstructured Peer-to-Peer Networks Pei Cao, Christine Lv., Edith Cohen, Kai Li and Scott Shenker ICS 2002.

Routing Indices For Peer-to-Peer Systems Arturo Crespo, Hector Garcia-Molina Stanford ICDCS 2002.

Expediting Searching Processes via Long Paths in P2P Systems 05/30 IDEA Lab.

PeerDB: A P2P-based System for Distributed Data Sharing Wee Siong Ng, Beng Chin Ooi, Kian-Lee Tan, Aoying Zhou Shawn Jeffery CS294-4 Peer-to-Peer Systems.

Evaluation of Ad hoc Routing Protocols under a Peer-to-Peer Application Authors: Leonardo Barbosa Isabela Siqueira Antonio A. Loureiro Federal University.

“A Local Search Mechanism for Peer-to-Peer Networks”

Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.

1 SLIC: A Selfish Link-based Incentive Mechanism for Unstructured P2P Networks Qixiang Sun Hector Garcia-Molina Stanford University.

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,

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

Count / Top-k Continuous Queries on P2P Networks 01/11/2006.

Vassilios V. Dimakopoulos and Evaggelia Pitoura Distributed Data Management Lab Dept. of Computer Science, Univ. of Ioannina, Greece

Improving Data Access in P2P Systems Karl Aberer and Magdalena Punceva Swiss Federal Institute of Technology Manfred Hauswirth and Roman Schmidt Technical.

Peer-to-peer Multimedia Streaming and Caching Service by Won J. Jeon and Klara Nahrstedt University of Illinois at Urbana-Champaign, Urbana, USA.

Focus on Distributed Hash Tables Distributed hash tables (DHT) provide resource locating and routing in peer-to-peer networks –But, more than object locating.

INTRODUCTION TO PEER TO PEER NETWORKS Z.M. Joseph CSE 6392 – DB Exploration Spring 2006 CSE, UT Arlington.

1 Napster & Gnutella An Overview. 2 About Napster Distributed application allowing users to search and exchange MP3 files. Written by Shawn Fanning in.

IR Techniques For P2P Networks1 Information Retrieval Techniques For Peer-To-Peer Networks Demetrios Zeinalipour-Yazti, Vana Kalogeraki and Dimitrios Gunopulos.

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

Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.

Thesis Proposal Data Consistency in DHTs. Background Peer-to-peer systems have become increasingly popular Lots of P2P applications around us –File sharing,

1 BitHoc: BitTorrent for wireless ad hoc networks Jointly with: Chadi Barakat Jayeoung Choi Anwar Al Hamra Thierry Turletti EPI PLANETE 28/02/2008 MAESTRO/PLANETE.

Colin J. MacDougall.  Class of Systems and Applications  “Employ distributed resources to perform a critical function in a decentralized manner”  Distributed.

Peer-to-Pee Computing HP Technical Report Chin-Yi Tsai.

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

Trust- and Clustering-Based Authentication Service in Mobile Ad Hoc Networks Presented by Edith Ngai 28 October 2003.

03/19/02Scalab Seminar Series1 Mapping the Gnutella Network Macroscopic Properties of Large Scale P2P Systems Ramaswamy N.Vadivelu Scalab, ASU.

P2Pedia A Distributed Wiki Network Management and Artificial Intelligence Laboratory Carleton University Presented by: Alexander Craig May 9 th, 2011.

Salah A. Aly,Moustafa Youssef, Hager S. Darwish,Mahmoud Zidan Distributed Flooding-based Storage Algorithms for Large-Scale Wireless Sensor Networks Communications,

A Peer-to-Peer Approach to Resource Discovery in Grid Environments (in HPDC’02, by U of Chicago) Gisik Kwon Nov. 18, 2002.

Peer Pressure: Distributed Recovery in Gnutella Pedram Keyani Brian Larson Muthukumar Senthil Computer Science Department Stanford University.

Data Communications and Networking Chapter 11 Routing in Switched Networks References: Book Chapters 12.1, 12.3 Data and Computer Communications, 8th edition.

03/19/02Scalab Seminar Series1 Routing in Peer-to-Peer Systems Ramaswamy N.Vadivelu Scalab, ASU.

Peer Centrality in Socially-Informed P2P Topologies Nicolas Kourtellis, Adriana Iamnitchi Department of Computer Science & Engineering University of South.

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

A Utility-based Approach to Scheduling Multimedia Streams in P2P Systems Fang Chen Computer Science Dept. University of California, Riverside

A Membership Management Protocol for Mobile P2P Networks Mohamed Karim SBAI, Emna SALHI, Chadi BARAKAT.

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 University of California, Irvine Done By : Ala Khalifeh (Note : Not Presented)

LightFlood: An Efficient Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.

Efficient AOI-Cast for Peer-to-Peer Networked Virtual Environments.

Taxonomy Caching: A Scalable Low- Cost Mechanism for Indexing Remote Contents in Peer-to-Peer Systems Kjetil Nørvåg Norwegian University of Science and.

Cooperative Location- Sensing for Wireless Networks Authors ： Haris Fretzagias Maria Papadopouli Presented by cychen IEEE International Conference on Pervasive.

Peer to Peer Network Design Discovery and Routing algorithms

Project funded by the Future and Emerging Technologies arm of the IST Programme Are Proliferation Techniques more efficient than Random Walk with respect.

Algorithms and Techniques in Structured Scalable Peer-to-Peer 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.

1 DCMP: A Distributed Cycle Minimization Protocol for Peer- to-Peer Networks Authors: Zhenzhou Zhu, Panos Kalnis and Spiridon Bakiras Source: IEEE Transactions.

School of Electrical Engineering &Telecommunications UNSW Cost-effective Broadcast for Fully Decentralized Peer-to-peer Networks Marius Portmann & Aruna.

CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.

Decentralized Trust Management for Ad-Hoc Peer-to-Peer Networks Thomas Repantis Vana Kalogeraki Department of Computer Science & Engineering University.

Distributed Caching and Adaptive Search in Multilayer P2P Networks Chen Wang, Li Xiao, Yunhao Liu, Pei Zheng The 24th International Conference on Distributed.

CS Spring 2010 CS 414 – Multimedia Systems Design Lecture 24 – Introduction to Peer-to-Peer (P2P) Systems Klara Nahrstedt (presented by Long Vu)

A Survey of Peer-to-Peer Content Distribution Technologies Stephanos Androutsellis-Theotokis and Diomidis Spinellis ACM Computing Surveys, December 2004.

Introduction to Dynamic Routing Protocol

Salah A. Aly ,Moustafa Youssef, Hager S. Darwish ,Mahmoud Zidan

Distributed voting application for handheld devices

Peer-to-Peer and Social Networks

Routing in Packet Networks Shortest Path Routing

Peer to Peer Information Retrieval

A Scalable content-addressable network

Paraskevi Raftopoulou, Euripides G.M. Petrakis

Intradomain Routing Outline Introduction to Routing

Deterministic and Semantically Organized Network Topology

Presentation transcript:

03/19/02Scalab Seminar Series1 Finding Good Peers in Peer-to-Peer Networks Ramaswamy N.Vadivelu Scalab, ASU

03/19/02Scalab Seminar Series2 Introduction Ramanathan, Kalogeraki,Pruyne P2P models: Decentralization by distribution. No central authority Broadcasting Network topology: Arbitrary and Dynamic Bandwidth vs. No.of messages and peers

03/19/02Scalab Seminar Series3 “Good “ peers and their “Interests”. Nodes with high degree of interests are good !. Proposed mechanism…. Advantages: Reduces the number of messages in the network Allocates resources Scales well. Assumptions: Connectivity Non unique files

03/19/02Scalab Seminar Series4 System Model Logical network of nodes. Immediate Indirect Note:  Non connected nodes! Each Peer maintains: Meta-data, p-c, p-m and p-d. p-b

03/19/02Scalab Seminar Series5 Constraint: Sum [p-b(q)] < p-b Limit the number of connections ( p-c ) per peer. The horizon : h-p Metrics: imp(q) Queryhits(q) Avhops(q) Connectime(q)

03/19/02Scalab Seminar Series6 Finding Good Peers 1)Minimize h(q). 2)Maximize prob of connecting similar peers. Each peer maintains a dynamic peer-list. Fallback: Central server! Communication through specified messages. TTL, group_id Connection accepted based on metrics.

03/19/02Scalab Seminar Series7 Searching in the Network Through query messages with constraints. Query – Query-Hit message Path retraced, TTL decremented. Results are buffered and displayed. Reputation metrics Results are used to determine the ‘good’ peers.

03/19/02Scalab Seminar Series8 Horizon Indirect peers through Immediate peers. View of indirect peers. Inverser relation to importance Large av.number of hops, =>nodes farther off.  No replies,does that mean its not a good peer?

03/19/02Scalab Seminar Series9 No,because May give results for other queries. May lose connections to other indirect nodes. So we calculate “ Importance”. Sequence of weighted measurements,not the average.

03/19/02Scalab Seminar Series10 Good peers are those with high importance. Good peers provide: High percentage of queryhits Are connected over a long period of time. Long time connectivity is a strong indication that they have the same interests.

03/19/02Scalab Seminar Series11 Periodic evaluation of peers. When perc QueryHits (s) > min perc QueryHits of immediate neighbors. Max_Connections. Stability is related to rate of Peer selection.

03/19/02Scalab Seminar Series12 Peer Selection Algorithm

03/19/02Scalab Seminar Series13 Experimental Results Two scenarios: 1.Finding peers with similar interests 2.Adapting a peer’s connections, as interests are changed.

03/19/02Scalab Seminar Series14 Discussion: