DisTree: A scheme for DHT
Niteesh Kumar, Sukumar Nandi · 2013
A peer-to-peer (P2P) system has emerged as one of the most successful ways to share resources in distributed environment. Early P2P content distribution networks were relying on a central index of the available resources on the network. Second generation Peer-to-Peer systems employ a Distributed Hash table (DHT) to locate data efficiently in their network. In this paper, we proposed a new scheme of DHT. This scheme is based on formation of a logical tree which supports the key searching using matching key over length. Distree is capable of routing and locating a key in nearly constant message complexity. It also enables to distribute the load of routing request and holding key responsibility which make it suitable for low configuration devices as well.