A load balanced two-tier DHT with improved lookup performance of non-popular data items
GPC'11 Proceedings of the 6th international conference on Advances in grid and pervasive computing
MDHT: a hierarchical name resolution service for information-centric networks
Proceedings of the ACM SIGCOMM workshop on Information-centric networking
Combining resource and location awareness in DHTs
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part I
Using identities to achieve enhanced privacy in future content delivery networks
Computers and Electrical Engineering
Tide: An effective and practical design for hierarchical-structured P2P model
Computer Communications
Hierarchical DHT-based name resolution for information-centric networks
Computer Communications
| Hi-index | 0.00 |
Much research in the last few years has been devoted to development of efficient structured peer-to-peer (P2P) overlay networks, which offer distributed hash table (DHT) functionality. Most of these systems have been devised as flat, non-hierarchical structures, in contrast to the most scalable distributed systems of the past. To cope with this, a significant number of hierarchical DHT designs have been proposed in the literature. Unfortunately, no design is "universally" better. Actually, what is lacking is an analytic framework to identify the good hierarchical design for a given workload. In this paper, we provide such a framework, and we use it to compare the two main hierarchical DHT designs: The homogenous design, in which all nodes act equal roles, against the superpeer design, in which a small subset of peers (i.e., the most powerful and stable), behave as proxies, interconnecting clusters with highly dynamic membership. Our analysis reveals that, on the contrary to what was initially expected, the costs incurred by hierarchical superpeer design are not necessarily minimized.