Advanced Peer Clustering and Firework Query Model - PowerPoint PPT Presentation

About This Presentation
Title:

Advanced Peer Clustering and Firework Query Model

Description:

... and Firework Query Model. Cheuk-Hang Ng, Ka-Cheung Sia and Chi-Hang Chan ... Each peer clusters its shared data to form local clusters as shown in Figure 1. ... – PowerPoint PPT presentation

Number of Views:46
Avg rating:3.0/5.0
Slides: 2
Provided by: Richa131
Category:

less

Transcript and Presenter's Notes

Title: Advanced Peer Clustering and Firework Query Model


1
Advanced Peer Clustering and Firework Query Model
Cheuk-Hang Ng, Ka-Cheung Sia and Chi-Hang
Chan Department of Computer Science
Engineering The Chinese University of Hong
Kong chng,kcsia,chchan_at_cse.cuhk.edu.hk
Multimedia Information Processing
Labhttp//www.cse.cuhk.edu.hk/miplab
This poster presents two new strategies for
information retrieval over the Peer-to-Peer (P2P)
network Peer Clustering and Firework Query Model
Contributions Proposed the Peer Clustering and
Firework Query Model to improve query efficiency
by
Key Problems In brute force search (BFS)
algorithm, broadcasting the query across the
network causes
  • Heavy network traffic
  • Resources waste in handling irrelevant queries
  • Reducing the network traffic
  • Increasing the searching performance

Peer Clustering
Attractive Links
Organize data inside the P2P network in a fashion
similar to a Yellow Page which makes query more
systematic
local cluster
Each peer clusters its shared data to form local
clusters as shown in Figure 1. Peer i, j and
k shared same category of data Originally, Peer
i, j and k are several hops away in the P2P
network. Our algorithm aims to group similar
peers together by forming deliberate Attractive
Links on top of the original P2P network.

Peer j

Peer i

Peer k

Figure 1 Peer Clustering
Firework Query Model
Use our clustered network to route the query
intelligently rather than brute force search, it
avoids unnecessary traffic while fully utilize
each query message
Firework Explosion ( using attractive links )
Target Cluster

A query first randomly walks around the network,
once it reaches the target cluster, the query is
broadcasted as a firework explosion (Figure 2)
Random Walk ( using original links )
Query starting point
Figure 2 Clustered P2P Network
Experiment Investigates the effect of query
efficiency against number of peers and TTL of
query message
Selected References
The Gnutella homepage. http//www.gnutella.com. Th
e Napster homepage. http//www.napster.com. C. H.
Ng and K. C. Sia. Peer Clustering and Firework
Query Model. In Poster Proc. of The 11th
International World Wide Web Conference, May 2002.
1 2 3
Write a Comment
User Comments (0)
About PowerShow.com