+ All Categories
Home > Documents > Fast Searching in Peer-to-Peer Networks

Fast Searching in Peer-to-Peer Networks

Date post: 30-Dec-2015
Category:
Upload: tyronica-ramirez
View: 33 times
Download: 2 times
Share this document with a friend
Description:
Fast Searching in Peer-to-Peer Networks. Self-Organizing Parallel Search Clusters Rocky Dunlap. Agenda. Peer-to-peer Networks Search Links/Index Links Model Parallel Search Clusters Self-Organizing Parallel Search Clusters Further Research. Peer-to-Peer Networks. Peer = Client + Server - PowerPoint PPT Presentation
Popular Tags:
36
Fast Searching in Peer-to-Peer Networks Self-Organizing Parallel Search Clusters Rocky Dunlap
Transcript
Page 1: Fast Searching in Peer-to-Peer Networks

Fast Searching in Peer-to-Peer Networks

Self-Organizing Parallel Search Clusters

Rocky Dunlap

Page 2: Fast Searching in Peer-to-Peer Networks

Agenda

• Peer-to-peer Networks

• Search Links/Index Links Model

• Parallel Search Clusters

• Self-Organizing Parallel Search Clusters

• Further Research

Page 3: Fast Searching in Peer-to-Peer Networks

Peer-to-Peer Networks

• Peer = Client + Server

• Anyone can send/process messages

• Highly Distributed

• Highly Parallel

• Data-centric routing

Page 4: Fast Searching in Peer-to-Peer Networks

P2P Networks – Two Types

• Unstructured• “Loose” network

structure• Requires less control

of peers (casual searching)

• Fault tolerance, churn• Keyword searching

• Structured• Specific network

structure• Distributed Hash Tables

– Smart routing

• Guarantees:– Bounded hops– Bounded state– Ability to search entire

network

Page 5: Fast Searching in Peer-to-Peer Networks

Unstructured Searching

?

Page 6: Fast Searching in Peer-to-Peer Networks

The Problems

• Query saturation – every node processes every query

• Query processing redundancy

• Slow response time from distant nodes

• In reality, cannot search entire network (TTL)

• Need a model for studying P2P networks

Page 7: Fast Searching in Peer-to-Peer Networks

SIL Model

• Search Links (forwarding)

• Index Links (non-forwarding)

Page 8: Fast Searching in Peer-to-Peer Networks

SIL Model

?

Page 9: Fast Searching in Peer-to-Peer Networks

SIL Model

?

Page 10: Fast Searching in Peer-to-Peer Networks

SIL Model

?

Page 11: Fast Searching in Peer-to-Peer Networks

SIL Model

?

Page 12: Fast Searching in Peer-to-Peer Networks

SIL Model

?

Page 13: Fast Searching in Peer-to-Peer Networks

SIL Model

?

Page 14: Fast Searching in Peer-to-Peer Networks

SIL Model

?

Page 15: Fast Searching in Peer-to-Peer Networks

SIL Model

?

Page 16: Fast Searching in Peer-to-Peer Networks

SIL Model

?

Page 17: Fast Searching in Peer-to-Peer Networks

SIL Model

?

Page 18: Fast Searching in Peer-to-Peer Networks

SIL Model

?

Page 19: Fast Searching in Peer-to-Peer Networks

SIL Model

?

Page 20: Fast Searching in Peer-to-Peer Networks

Index links provide full coverage

Searches remain inside cluster

Parallel Search Clusters

Page 21: Fast Searching in Peer-to-Peer Networks

Parallel Search Clusters

• Assumptions– Keep network essentially unstructured (keyword

searching, fault tolerance)– Search rate is high– Update rate is low

• Limit the number of nodes that processes query• Provide full (or high) coverage of network• Index links allow some nodes to proxy searches

for others

Page 22: Fast Searching in Peer-to-Peer Networks

The Challenge

• Self-Organizing Parallel Search Clusters

• Decentralized• Nodes only know a few

neighbors• Dealing with “churn”• Minimal interruption of

normal operations

Page 23: Fast Searching in Peer-to-Peer Networks

Proposed Solution

• Existing clusters split into two new clusters• Advantages

– Solves origin problem (start with one cluster)– Clusters split autonomously– Automatic load balancing

• Three phase approach– Color– Replicate Links– Split

Page 24: Fast Searching in Peer-to-Peer Networks

Splitting Cluster

Phase 1Coloring

!

Page 25: Fast Searching in Peer-to-Peer Networks

Splitting Cluster

Phase 1Coloring

!

Color (radius = 2)

Page 26: Fast Searching in Peer-to-Peer Networks

Splitting Cluster

Phase 1ColoringColor (radius = 2)

Page 27: Fast Searching in Peer-to-Peer Networks

Splitting Cluster

Phase 2Replicate Links

red

red

red

red

green

green

Page 28: Fast Searching in Peer-to-Peer Networks

Splitting Cluster

Phase 2Replicate Links

red

red

red

red

Page 29: Fast Searching in Peer-to-Peer Networks

Splitting Cluster

Phase 3Split

X

Page 30: Fast Searching in Peer-to-Peer Networks

Splitting Cluster

Phase 3Split

X

Page 31: Fast Searching in Peer-to-Peer Networks

Splitting Cluster

Phase 3Split

Page 32: Fast Searching in Peer-to-Peer Networks

Splitting Cluster

Phase 3Split

X X

XX

XXX

X

Page 33: Fast Searching in Peer-to-Peer Networks

Splitting Cluster

Phase 3Split

Page 34: Fast Searching in Peer-to-Peer Networks

Splitting Cluster

Phase 3Split

Page 35: Fast Searching in Peer-to-Peer Networks

Further Research

• Initiating the split• Choosing the radius for coloring phase

– Want two clusters of same size

• Overloading index links• Dealing with “churn”

– Nice nodes– Not-so-nice nodes

• Merge operation?• Simulation

Page 36: Fast Searching in Peer-to-Peer Networks

Bibliography

• B. F. Cooper and H. Garcia-Molina. SIL: Modeling and Measuring Scalable Peer-to-peer Search Networks. http://www-db.stanford.edu/~cooperb/pubs/searchnets.pdf, 2003.

• B. Yang and H. Garcia-Molina. Improving Search in Peer-to-Peer Networks. http://dbpubs.stanford.edu:8090/pub/2002-28, 2002.


Recommended