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

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 UnoHop, 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 occurrence of events.