Skip to Main Content
To realize huge-scale information services, many Distributed Hash Table (DHT) based systems have been proposed. For example, there are some proposals to manage item-level RFID information with DHT In such services, service reliability is important. A DHT service is believed to be highly reliable because it is distributed. However, even if the entire service does not stop, the risk of data loss is unavoidable because a DHT consists of many physical nodes. Clearly, in order to avoid compromising the scalability of a DHT-based service, a scalable backup and loss-recovery scheme is required. To solve the problem, we propose a framework of distributed-to-distributed data copy. The proposed design utilizes the distributed manner of DHT algorithms, and it enables coping from a distributed system to a DHT system with minimal bottlenecks.