[Dcplusplus-commit] SF.net SVN: adc:[129] trunk/ADC-EXT.txt

[<em...@us...>]

Revision: 129
          http://sourceforge.net/p/adc/code/129
Author:   emtee
Date:     2025-05-07 11:11:26 +0000 (Wed, 07 May 2025)
Log Message:
-----------
Add implementation notes to BLOM

Modified Paths:
--------------
    trunk/ADC-EXT.txt

Modified: trunk/ADC-EXT.txt
===================================================================
--- trunk/ADC-EXT.txt	2025-05-06 13:44:39 UTC (rev 128)
+++ trunk/ADC-EXT.txt	2025-05-07 11:11:26 UTC (rev 129)
@@ -15,6 +15,7 @@
 
 == Version 1.0.9, UNRELEASED
 
+* Added implementation notes to BLOM
 * Added 'CCPM' extension for client to client private messages
 * Editorial updates
 * Clarified HH field in PING to be an ADC URL
@@ -374,7 +375,7 @@
 |m |Size of the bloom filter in bits
 |k |Number of sub-hashes constructed from the file hash
 |h |Number of bits to use for each sub-hash
-|p |Propability of a false positive
+|p |Probability of a false positive
 |=====
 
 The hub chooses k, h and m.
@@ -431,6 +432,11 @@
 
 For test vectors, see the https://adc.sourceforge.io/wiki/index.php/Talk:BLOM[ADC wiki talk page].
 
+==== Implementation notes
+Clients do not signal each atomic user update of the share using the SF flag. Instead, they tend to send a cumulative result of multiple updates in a timely fashion. However, an unambiguous summary of the number of hash additions and removals may result in a lack of an update signal. Therefore, hubs are recommended to look for and process INFs containing the SS flag as well, since an incoming SS flag (especially when not accompanied by an SF) may also indicate an update in the hashes, one that occurs without a change in the total number of files shared.
+
+Clients shall strive to signal multiple share updates in an unambiguous manner, thus enabling hubs to request the most accurate and up-to-date version of the client's bloom filter.
+
 === NATT - NAT traversal
 NAT traversal allow two passive clients to connect to each other. This specification is based on the TCP hole punching algorithm described in footnoteref:[Peer-to-Peer Communication Across Network Address Translators, B. Ford and P. Srisuresh and and D. Kegel. "Peer-to-Peer Communication Across Network Address Translators". In USENIX Technical Conference 2005 - pages 179–192. Online version: https://bford.info/pub/net/p2pnat/].
 

This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.