Abstract
Distributed hash tables (DHT for short) schemes are the core techniques to locate and search resources in structured P2P system. But DHT only support exact-match search, cannot support complex search due to that its hash methods destroy data locality. A simple and flexible solution has been built to tackle the problem which is known as over-DHT paradigm without modifying existing DHT infrastructures. One of the well known over-DHT paradigms now is LIGHT which provides more efficient complex query methods than other paradigms and also reduces the paradigm maintenance cost. However, LIGHT takes more than one steps (a step means a DHT-lookup operation) to search single data record in P2P system, while traditional DHT schemes only take one step. In this paper, we propose a improved lookup algorithm, Nearest Upper Boundary Lookup (NUBL for short) to reduce the DHT-lookup times during single data record searching procedure in LIGHT. We also proved the effectiveness of NUBL by simulating experiments.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
