[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[GNUnet-SVN] r3851 - GNUnet/src/applications/dht
From: |
grothoff |
Subject: |
[GNUnet-SVN] r3851 - GNUnet/src/applications/dht |
Date: |
Sat, 2 Dec 2006 14:30:49 -0800 (PST) |
Author: grothoff
Date: 2006-12-02 14:30:48 -0800 (Sat, 02 Dec 2006)
New Revision: 3851
Modified:
GNUnet/src/applications/dht/README
Log:
dht hacking
Modified: GNUnet/src/applications/dht/README
===================================================================
--- GNUnet/src/applications/dht/README 2006-12-02 22:28:37 UTC (rev 3850)
+++ GNUnet/src/applications/dht/README 2006-12-02 22:30:48 UTC (rev 3851)
@@ -8,9 +8,9 @@
The DHT code consists of 3 parts. First, there is the DHT module, a
dynamically loaded plugin that provides DHT services to two different
sets of clients. The DHT module provides the routing facilities and
-registers two sets of handlers. The first set of handlers are RPC
-methods which are used to exchange DHT messages with other peers. The
-code for this implementation (module/dht.c) also provides the DHT
+registers two sets of handlers. The first set of handlers are P2P
+handlers which are used to exchange DHT messages with other peers. The
+code for this implementation (module/service.c) also provides the DHT
service API to the rest of the GNUnet core. The DHT service API is
defined in gnunet_dht_service.h.
@@ -18,22 +18,10 @@
provides DHT services to GNUnet clients. In order to make access to
the CS-API more convenient, there exists the GNUnet-DHT client
library. Its functions are defined in gnunet_dht_lib.h. The library
-code is defined in dht/tools together with a couple of demo-tools
-(gnunet-dht-join and gnunet-dht-update).
+code is defined in dht/tools together with a demo-tool
+(gnunet-dht-query).
Low-level details:
-- periodically each peer checks if the buckets in the DHT are full;
- if there are fewer than ALPHA entries it tries to find additional
- peers which run DHT by broadcasting PINGs.
-- each peer participates in 'table 0'. Table 0 is a mapping of table IDs
- to peers participating in that table.
-- each peer periodically performs a 'put' on 'table 0' for each table
- that that peer is participating in
-- get / put have two variants; if the peer has joined the table, the
- lookup goes though that chain; otherwise the peer first performs a
- table-0 lookup to find an entry-point to the table;
-- for each table that the peer has joined, it periodically attempts
- to find peers in its proximity that have also joined that table;
- routing tables are similar to kademlia (in terms of replacement
policy and ID space structure; the bucket size depends on the number
of tables that the peer participates in)
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- [GNUnet-SVN] r3851 - GNUnet/src/applications/dht,
grothoff <=