commit 6fa88dfb29c9621e7a1c2de29f0cc269794d5d27
parent 2eabac0ae82fe5d92b67c8627235ca68e131a407
Author: Martin Schanzenbach <schanzen@gnunet.org>
Date: Sat, 24 Feb 2024 11:40:15 +0100
move accounting
Diffstat:
| M | about.rst | | | 68 | ++++++++++++++++++++++++++++++++++---------------------------------- |
1 file changed, 34 insertions(+), 34 deletions(-)
diff --git a/about.rst b/about.rst
@@ -278,40 +278,6 @@ specify the corresponding public key first.
For more information, refer to RFC 9498.
-Accounting to Encourage Resource Sharing
-----------------------------------------
-
-Most distributed P2P networks suffer from a lack of defenses or
-precautions against attacks in the form of freeloading. While the
-intentions of an attacker and a freeloader are different, their effect
-on the network is the same; they both render it useless. Most simple
-attacks on networks such as Gnutella involve flooding the network with
-traffic, particularly with queries that are, in the worst case,
-multiplied by the network.
-
-In order to ensure that freeloaders or attackers have a minimal impact
-on the network, GNUnet’s file-sharing implementation (FS) tries to
-distinguish good (contributing) nodes from malicious (freeloading)
-nodes. In GNUnet, every file-sharing node keeps track of the behavior of
-every other node it has been in contact with. Many requests (depending
-on the application) are transmitted with a priority (or importance)
-level. That priority is used to establish how important the sender
-believes this request is. If a peer responds to an important request,
-the recipient will increase its trust in the responder: the responder
-contributed resources. If a peer is too busy to answer all requests, it
-needs to prioritize. For that, peers do not take the priorities of the
-requests received at face value. First, they check how much they trust
-the sender, and depending on that amount of trust they assign the
-request a (possibly lower) effective priority. Then, they drop the
-requests with the lowest effective priority to satisfy their resource
-constraints. This way, GNUnet’s economic model ensures that nodes that
-are not currently considered to have a surplus in contributions will not
-be served if the network load is high.
-
-For more information, refer to the following paper: Christian Grothoff.
-An Excess-Based Economic Model for Resource Allocation in Peer-to-Peer
-Networks. Wirtschaftsinformatik, June 2003.
-(https://git.gnunet.org/bibliography.git/plain/docs/ebe.pdf)
Anonymity
@@ -431,4 +397,38 @@ Grothoff, Tzvetan Horozov, and Jussi T. Lindgren. An Encoding for
Censorship-Resistant Sharing. 2009.
(https://git.gnunet.org/bibliography.git/plain/docs/ecrs.pdf)
+Accounting to Encourage Resource Sharing
+----------------------------------------
+
+Most distributed P2P networks suffer from a lack of defenses or
+precautions against attacks in the form of freeloading. While the
+intentions of an attacker and a freeloader are different, their effect
+on the network is the same; they both render it useless. Most simple
+attacks on networks such as Gnutella involve flooding the network with
+traffic, particularly with queries that are, in the worst case,
+multiplied by the network.
+
+In order to ensure that freeloaders or attackers have a minimal impact
+on the network, GNUnet’s file-sharing implementation (FS) tries to
+distinguish good (contributing) nodes from malicious (freeloading)
+nodes. In GNUnet, every file-sharing node keeps track of the behavior of
+every other node it has been in contact with. Many requests (depending
+on the application) are transmitted with a priority (or importance)
+level. That priority is used to establish how important the sender
+believes this request is. If a peer responds to an important request,
+the recipient will increase its trust in the responder: the responder
+contributed resources. If a peer is too busy to answer all requests, it
+needs to prioritize. For that, peers do not take the priorities of the
+requests received at face value. First, they check how much they trust
+the sender, and depending on that amount of trust they assign the
+request a (possibly lower) effective priority. Then, they drop the
+requests with the lowest effective priority to satisfy their resource
+constraints. This way, GNUnet’s economic model ensures that nodes that
+are not currently considered to have a surplus in contributions will not
+be served if the network load is high.
+
+For more information, refer to the following paper: Christian Grothoff.
+An Excess-Based Economic Model for Resource Allocation in Peer-to-Peer
+Networks. Wirtschaftsinformatik, June 2003.
+(https://git.gnunet.org/bibliography.git/plain/docs/ebe.pdf)
