We consider the conflicting problems of ensuring data-access load balancing and efficiently processing range queries on peer-to-peerdata networks maintained over Distributed Hash Tables (DHTs). Placing consecutive data values in neighboring peers is frequentlyused in DHTs since it accelerates range query processing. However, such a placement is highly susceptible to load imbalances,which are preferably handled by replicating data (since replication also introduces fault tolerance benefits). In this paper,we present HotRoD, a DHT-based architecture that deals effectively with this combined problem through the use of a novel locality-preservinghash function, and a tunable data replication mechanism which allows trading off replication costs for fair load distribution.Our detailed experimentation study shows strong gains in both range query processing efficiency and data-access load balancing,with low replication overhead. To our knowledge, this is the first work that concurrently addresses the two conflicting problemsusing data replication.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below