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 required for disseminating membership changes information (events). These events dissemination allows each node in the peertopeer network maintains accurate routing tables with complete membership...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
ITB Journal Publisher
2013-09-01
|
| Series: | Journal of ICT Research and Applications |
| Online Access: | https://journals.itb.ac.id/index.php/jictra/article/view/175 |