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

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.