Approaches to Improving Locality and Efficiency on DHT based P2P Systems
Date Issued
2004
Date
2004
Author(s)
Zhuang, Yung-Yu
DOI
en-US
Abstract
Distributed hash tables (DHT) based P2P systems such as CAN, Chord, Pastry, and Tapestry, provide efficient platforms with the guaranteed searching performance. But the locality is destroyed since DHTs use a uniform hash function to distribute nodes and objects in the virtual space evenly. The hierarchical architecture based on DHTs like HIERAS and Canon, significantly improves locality by grouping nodes geographically, but they still cannot take full advantage of hierarchy. Furthermore their performances vary with the system status because they are not adaptive. In this thesis, we propose an adaptive architecture with dynamic grouping, called Pharos. It applies hierarchical overlays on DHTs and groups nodes with locality evenly. Pharos manages groups effectively by taking advantage of the super-peer architecture but reserves the load balance guarantee of DHTs. Because of dynamic grouping, Pharos is adaptive and always keeps its locality and efficiency.
Subjects
點對點
虛擬空間
分散雜湊表
覆遞h
區域性
peer-to-peer
overlay
DHT
virtual space
locality
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-93-R91921072-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):c7f0b3aa8edaded86dbd19898359b918