Search and Cache Mechanism in A Proximity-Aware and Group-Based Peer-to-Peer System for Range Queries
Date Issued
2008
Date
2008
Author(s)
Huang, Hsiao-Mei
Abstract
Peer-to-peer systems have emerged as a powerful platform for large-scale distributed information systems in recent years; important functionalities, such as searching, have been added to improve the system''s lookup capability. The efficient support of range queries in a P2P system is still a challenging problem. To resolve this problem, some other related issues must first be addressed, such as high communication overheads, load imbalance among peers and preservation of object availability. Donuts satisfies above requirement and maintain object availability and effectively range queries. Within a grouping environment, peers are divided into several groups to provide the flexibility of proximity and feasibility of load balance in a range queries system. However, Donuts'' search algorithm with cooperative search is not efficient. The search cost is tremendous. Also the query pattern in Donuts is not similar to real word.his thesis provide more factual query pattern to simulate search behavior. Considering locality and popularity, we try to find the best search and cache strategy. The result of experiment prove that chordal ring is the better system data structure. We also compare the performance of local cache with the one of cache by path. Finally, we compare cooperative neighbor cache with traditional cache and make a conclusion for best search and cache method.
Subjects
P2P network
range query
proximity
grouping
load balance
cache
File(s)![Thumbnail Image]()
Loading...
Name
ntu-97-R95725028-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):92bc1853bcf340f4ec2401aad3425b8a