Repository : ssh://git@open-mesh.org/doc

On branches: backup-redmine/2017-07-13,master

commit 4d61fabf1a1fc809a1bc641ec28cfd4985fce65d Author: Antonio Quartulli a@unstable.cc Date: Sat Mar 3 01:15:39 2012 +0000

doc: batman-adv/DistributedArpTable

4d61fabf1a1fc809a1bc641ec28cfd4985fce65d batman-adv/DistributedArpTable.textile | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/batman-adv/DistributedArpTable.textile b/batman-adv/DistributedArpTable.textile index 9795033c..688b3a44 100644 --- a/batman-adv/DistributedArpTable.textile +++ b/batman-adv/DistributedArpTable.textile @@ -1,6 +1,6 @@ h1. Distributed ARP Table

-D.A.T. (Distributed ARP Table) is a feature aimed to solve the unreliability problem of the [[http://en.wikipedia.org/wiki/Address_Resolution_Protocol%7CARP]] dialogue +D.A.T. (Distributed ARP Table) is a feature aimed to solve the unreliability problem of the ARP:http://en.wikipedia.org/wiki/Address_Resolution_Protocol dialogue in sparse wireless networks, where the experienced packet loss is not negligible.

h2. The Problem @@ -21,7 +21,7 @@ the correct destination, thus dramatically increasing the latency of establishin h2. A possible solution

The idea behind D.A.T. is to reduce as much as possible the usage of broadcast packets by replacing them with unicasts. In order to accomplish this task D.A.T. dat uses -part of the theory behind the [[http://en.wikipedia.org/wiki/Distributed_hash_table%7CDHT (Distributed Hash Tables)]], in particular it uses the DHT to store the ARP entries +part of the theory behind the DHT(Distributed Hash Tables):http://en.wikipedia.org/wiki/Distributed_hash_table, in particular it uses the DHT to store the ARP entries so becoming able to later query a particular node in order to get the data which the requester is looking for.

h2. DHT basics