DOI Number : 10.5614/itbj.ict.2008.2.1.4
Hits : 13

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

Herry Sitepu, Carmadi Machbub, Armein Z. R. Langi & Suhono H. Supangkat

School of Electrical Engineering and Informatics, Institut Teknologi Bandung

Jl. Ganesha 10 Bandung, 40132 Indonesia

Abstract. Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic which required for propagating membership changes information (events). These events distribution allows each node in the peer-to-peer 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 constructed dynamically rooted at the node that detect the events. Our protocol produces symmetric bandwidth usage at all nodes while decreasing the events propagation delay.

Keywords: Distributed Hash Table, peer-to-peer network, one-hop lookup protocol

Download Article
Bahasa Indonesia | English


Begin on 10 October 2014 this website is no longer activated for article process in Journal of Mathematical and Fundamental Sciences, Journal of Engineering and Technological Sciences, Journal of ICT Research and Applications and Journal of Visual Art and Design. The next process will be proceeded under new website at

For detail information please contact us to:

       ITB Journal Visitor Number #16091918       
       Jl. Tamansari 64, Bandung 40116, Indonesia Visitor IP Address #       
       Tel : +62-22-250 1759 ext. 121 2011 Institut Teknologi Bandung       
       Fax : +62-22-250 4010, +62-22-251 1215 XHTML + CSS + RSS       
       E-mail : or Developed by AVE