Home >Documents >Fast Searching in Peer-to-Peer Networks

Fast Searching in Peer-to-Peer Networks

Date post:30-Dec-2015
Category:
View:31 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
Transcript:
  • Fast Searching in Peer-to-Peer NetworksSelf-Organizing Parallel Search Clusters

    Rocky Dunlap

  • AgendaPeer-to-peer NetworksSearch Links/Index Links ModelParallel Search ClustersSelf-Organizing Parallel Search ClustersFurther Research

  • Peer-to-Peer NetworksPeer = Client + ServerAnyone can send/process messagesHighly DistributedHighly ParallelData-centric routing

  • P2P Networks Two TypesUnstructuredLoose network structureRequires less control of peers (casual searching)Fault tolerance, churnKeyword searching

    StructuredSpecific network structureDistributed Hash TablesSmart routingGuarantees:Bounded hopsBounded stateAbility to search entire network

  • Unstructured Searching?

  • The ProblemsQuery saturation every node processes every queryQuery processing redundancySlow response time from distant nodesIn reality, cannot search entire network (TTL)Need a model for studying P2P networks

  • SIL ModelSearch Links (forwarding)Index Links (non-forwarding)

  • SIL Model?

  • SIL Model?

  • SIL Model?

  • SIL Model?

  • SIL Model?

  • SIL Model?

  • SIL Model?

  • SIL Model?

  • SIL Model?

  • SIL Model?

  • SIL Model?

  • SIL Model?

  • Parallel Search Clusters

  • Parallel Search ClustersAssumptionsKeep network essentially unstructured (keyword searching, fault tolerance)Search rate is highUpdate rate is lowLimit the number of nodes that processes queryProvide full (or high) coverage of networkIndex links allow some nodes to proxy searches for others

  • The ChallengeSelf-Organizing Parallel Search ClustersDecentralizedNodes only know a few neighborsDealing with churnMinimal interruption of normal operations

  • Proposed SolutionExisting clusters split into two new clustersAdvantagesSolves origin problem (start with one cluster)Clusters split autonomouslyAutomatic load balancingThree phase approachColorReplicate LinksSplit

  • Splitting ClusterPhase 1Coloring!

  • Splitting ClusterPhase 1Coloring!Color (radius = 2)

  • Splitting ClusterPhase 1ColoringColor (radius = 2)

  • Splitting ClusterPhase 2Replicate Linksredgreen

  • Splitting ClusterPhase 2Replicate Linksred

  • Splitting ClusterPhase 3SplitX

  • Splitting ClusterPhase 3SplitX

  • Splitting ClusterPhase 3Split

  • Splitting ClusterPhase 3Split

  • Splitting ClusterPhase 3Split

  • Splitting ClusterPhase 3Split

  • Further ResearchInitiating the splitChoosing the radius for coloring phaseWant two clusters of same sizeOverloading index linksDealing with churnNice nodesNot-so-nice nodesMerge operation?Simulation

  • BibliographyB. 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.

Popular Tags:
of 36/36
Fast Searching in Peer-to-Peer Networks Self-Organizing Parallel Search Clusters Rocky Dunlap
Embed Size (px)
Recommended