[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[GNUnet-SVN] r1624 - GNUnet-docs/WWW
From: |
grothoff |
Subject: |
[GNUnet-SVN] r1624 - GNUnet-docs/WWW |
Date: |
Sun, 7 Aug 2005 16:05:40 -0700 (PDT) |
Author: grothoff
Date: 2005-08-07 16:05:39 -0700 (Sun, 07 Aug 2005)
New Revision: 1624
Modified:
GNUnet-docs/WWW/faq.php3
GNUnet-docs/WWW/protocol_p2p_afs.php3
Log:
patches
Modified: GNUnet-docs/WWW/faq.php3
===================================================================
--- GNUnet-docs/WWW/faq.php3 2005-08-06 21:24:24 UTC (rev 1623)
+++ GNUnet-docs/WWW/faq.php3 2005-08-07 23:05:39 UTC (rev 1624)
@@ -555,8 +555,7 @@
W("Additionally, directories have two nice properties.");
W("First, they are immutable, meaning that they can′t be tampered with,
but contain exactly those pointers the publisher intended.");
W("The second property is that identical files pointed to by two directories
waste no additional space, even if the directories were built by separate
users.");
-W("This contrasts strongly to the case where similar files were archived by
-e.g. zip or rar, which could double the space usage over the network
+W("This contrasts strongly to the case where similar files were archived by
e.g. zip or tar, which could double the space usage over the network
without any speedups in retrieval time.");
W("By using directories to group the content enables GNUnet to spread the
identical file blocks more efficiently.");
Modified: GNUnet-docs/WWW/protocol_p2p_afs.php3
===================================================================
--- GNUnet-docs/WWW/protocol_p2p_afs.php3 2005-08-06 21:24:24 UTC (rev
1623)
+++ GNUnet-docs/WWW/protocol_p2p_afs.php3 2005-08-07 23:05:39 UTC (rev
1624)
@@ -11,8 +11,8 @@
W("The described algorithm is the best we could come up with so far (while
achieving good anonymity).");
W("Peers can implement a different algorithm and still be protocol
compatible.");
P();
-W("Whenever a peer receives a query, it must make a couple of decisions.");
-W("First, it may decide to just ignore the query.");
+W("Whenever a peer receives a query, it makes a couple of decisions.");
+W("The peer first decides whether to just ignore the query.");
W("This is done if the local load is far too high, if the query is expired or
if the query has already been processed recently.");
W("This first question is among the most difficult.");
W("GAP uses a time-to-live per query, which is a relative, possibly negative
lifetime in milliseconds.");
@@ -23,20 +23,20 @@
"code (routing.c, needsForwarding)"));
P();
-W("Once GAP has decided that a query will be processed, it decides on
performing a local lookup.");
-W("Potential replies are send back (with a random delay) if the bandwidth
allocation code permits it.");
+W("Once GAP has decided that a query will be processed, it performs a local
lookup.");
+W("Potential replies are sent back (with a random delay) if the bandwidth
allocation code permits it.");
W("The code then decides on forwarding the query (with decremented
time-to-live) to a subset of the connected peers.");
W("At most four peers are selected based on a biased random selection.");
-W("The selection is biased based on the recent number of replies received from
a peer for queries that originated from the same previous peer as the current
query.");
+W("The selection is biased towards peers that have recently replied to other
queries that had the same predecessor as the current query.");
W("The exact code can be found %s.",
extlink_("doxygen/html/querymanager_8c.html#a21",
"here (querymanager.c, forwardQuery)"));
-W("Furthermore, queries are forwarded to other peers if this is possible for
free.");
-W("Sending queries for free typically happens when the requirement of
uniform-sized messages leaves enough room for a query (or multiple queries).");
+W("Furthermore, queries may be forwarded to other peers if this is possible
for free.");
+W("Sending queries for free typically happens when assembling a (uniform size)
message has sufficient unused room for a query.");
W("In that case, the bandwidth allocation code polls the %s for possible
bandwidth-fillers.",
extlink_("doxygen/html/querymanager_8c.html#a16",
"query management code (querymanager.c, fillInQuery)"));
-W("The query management then selects suitable recent queries that were so far
not forwarded to the peer in question.");
+W("The query management system then selects suitable recent queries that have
so far not been given to the peer in question.");
P();
W("If GAP receives a reply, it checks its routing table for a matching
entry.");
@@ -50,9 +50,9 @@
P();
W("The philosophy of why this should achieve good anonymity is described in
the %s.",
- extlink_("download/aff.ps", "gap paper"));
-W("The rationale behind correlating queries from the same predecessor lies in
the %s which will yield strong correlations between successive queries from the
same client.",
- extlink_("download/ecrs.ps", "content encoding"));
+ extlink_("download/aff.ps", "GAP paper"));
+W("The rationale behind correlating queries from the same predecessor lies in
the %s which will yield correlations between successive queries from the same
client.",
+ extlink_("download/ecrs.ps", "encoding scheme"));
P();
W("The GAP protocol defines the following messages:");
@@ -114,4 +114,4 @@
N("ECRS-encoded data", NBO_()) => 0)));
include("html_footer.php3");
-?>
\ No newline at end of file
+?>
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- [GNUnet-SVN] r1624 - GNUnet-docs/WWW,
grothoff <=