UnoHop: Efficient Distributed Hash Table with O(1) Lookup Performance

Herry Sitepu (School of Electrical Engineering and Informatics, Institut Teknologi Bandung, Jl. Ganesha 10 Bandung, 40132 Indonesia)
Carmadi Machbub (School of Electrical Engineering and Informatics, Institut Teknologi Bandung, Jl. Ganesha 10 Bandung, 40132 Indonesia)
Armein Z. R. Langi (School of Electrical Engineering and Informatics, Institut Teknologi Bandung, Jl. Ganesha 10 Bandung, 40132 Indonesia)
Suhono H. Supangkat (School of Electrical Engineering and Informatics, Institut Teknologi Bandung, Jl. Ganesha 10 Bandung, 40132 Indonesia)

Journal of ICT Research and Applications
Vol. 2 No. 1 (2008)

Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic required for disseminating membership changes information (events). These events dissemination allows each node in the peertopeer network maintains accurate routing tables with complete membership information. We present UnoHop, a novel DHT protocol with O(1) lookup performance. The protocol uses an efficient mechanism to distribute events through a dissemination tree that is constructed dynamically rooted at the node that detects the events. Our protocol produces symmetric bandwidth usage at all nodes while decreasing the events propagation delay.