Mobility

Efficient Query Bundling Mechanism in a DHT Network

Download Now Free registration required

Executive Summary

A Distributed Hash Table (DHT) network can be used for many distributed services and systems. In DHT networks, it takes logN look-up steps to search for required data where N is the number of nodes. However, the look-up process is redundant in the IP network because each look-up process generates a lot of communication among nodes. In massive data management such as sensor and web information management, this results in high network load even if each the search process takes only logN look-up steps. To solve this problem, the authors propose an efficient query bundling mechanism that makes it possible to bundle multiple queries by using range information.

  • Format: PDF
  • Size: 1495.04 KB