Unohop: Efficient distributed hash table with o(1) lookup performance
Sitepu H.I.a, Machbub C.a, Langi A.Z.R.a, Supangkat S.H.a
a School of Electrical Engineering and Informatics, Institut Teknologi Bandung, Indonesia
Abstract
Distributed Hash Tables (DHTs) with O(1) lookup performance strive to propagate membership changes through efficient distribution mechanism to allow each node in the peer-to-peer network maintains accurate routing tables with complete membership information. We present Uno- Hop, an efficient DHT algorithm with O(1) lookup performance. UnoHop uses an efficient algorithm to propagate membership events through a dissemination tree that is constructed dynamically rooted at the node that detect the events. Our algorithm allows symmetric bandwidth usage at all nodes while decreasing the propagation delay, which is the time that required to update the routing table in all nodes at the occurence of events. © 2008 IEEE.
Author keywords
Bandwidth usage,Distributed Hash Table,Distributed hash tables,Distribution mechanism,Efficient algorithm,Lookup performance,Membership information,Peer-to-Peer networks,Propagation delays,Routing table