I2P_Developers/i2p.android.base
3
0
Fork 2
Code Issues 39 Pull Requests Actions 1 Packages Projects Releases Wiki Activity

2005-08-31 jrandom

Browse Source 
* Don't publish leaseSets to the netDb if they will never be looked for -
      namely, if they are for destinations that only establish outbound
      streams.  I2PTunnel's 'client' and 'httpclient' proxies have been
      modified to tell the router that it doesn't need to publish their
      leaseSet (by setting the I2CP config option 'i2cp.dontPublishLeaseSet'
      to 'true').
    * Don't publish the top 10 peer rankings of each router in the netdb, as
      it isn't being watched right now.
This commit is contained in:
jrandom
2005-09-01 00:26:20 +00:00
committed by zzz
parent b43114f61b
commit ccb73437c4
2 changed files with 13 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
history.txt
View File

@ -1,4 +1,14 @@
$Id: history.txt,v 1.231 2005/08/27 17:15:38 jrandom Exp $
$Id: history.txt,v 1.232 2005/08/29 20:59:13 jrandom Exp $
2005-08-31 jrandom
* Don't publish leaseSets to the netDb if they will never be looked for -
namely, if they are for destinations that only establish outbound
streams. I2PTunnel's 'client' and 'httpclient' proxies have been
modified to tell the router that it doesn't need to publish their
leaseSet (by setting the I2CP config option 'i2cp.dontPublishLeaseSet'
to 'true').
* Don't publish the top 10 peer rankings of each router in the netdb, as
it isn't being watched right now.
2005-08-29 jrandom
* Added the new test Floodfill netDb

3
router/java/src/net/i2p/router/StatisticsManager.java
View File

@ -100,7 +100,8 @@ public class StatisticsManager implements Service {
stats.setProperty("core.id", CoreVersion.ID);
if (_includePeerRankings) {
stats.putAll(_context.profileManager().summarizePeers(_publishedStats));
if (false)
stats.putAll(_context.profileManager().summarizePeers(_publishedStats));
includeThroughput(stats);
includeRate("router.invalidMessageTime", stats, new long[] { 10*60*1000 });