DisTree: A scheme for DHT

Author

Kumar, Narendra ; Nandi, Sukumar

Author_Institution

Dept. of Comput. Sci. & Eng., Indian Inst. of Technol. Guwahati, Guwahati, India

fYear

2013

Firstpage

794

Lastpage

799

Abstract

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.

Keywords

communication complexity; overlay networks; peer-to-peer computing; telecommunication network routing; trees (mathematics); DHT; DisTree; P2P content distribution networks; P2P system; central index; distributed environment; distributed hash table; holding key responsibility; logical tree formation; low configuration devices; message complexity; routing request; second generation peer-to-peer systems; structured overlay networks; Complexity theory; Distributed databases; Informatics; Overlay networks; Peer-to-peer computing; Routing; Servers;

fLanguage

English

Publisher

ieee

Conference_Titel

Advances in Computing, Communications and Informatics (ICACCI), 2013 International Conference on

Conference_Location

Mysore

Print_ISBN

978-1-4799-2432-5

Type

conf

DOI

10.1109/ICACCI.2013.6637277

Filename

6637277