ARCHIVE/xahaud
3
0
Fork 0
mirror of https://github.com/Xahau/xahaud.git synced 2025-12-06 17:27:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

Change how cluster load is computed from average-ish to median-ish.

Browse Source
This commit is contained in:
JoelKatz
2013-11-01 16:47:19 -07:00
parent cf71680aee
commit 5f4a1917a6
1 changed files with 11 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

29
src/ripple_app/peers/UniqueNodeList.cpp
View File

@@ -383,32 +383,25 @@ public:
uint32 getClusterFee ()
{
int thresh = getApp().getOPs().getNetworkTimeNC() - 120;
uint32 a = 0, b = 0;
int thresh = getApp().getOPs().getNetworkTimeNC() - 90;
ScopedUNLLockType sl (mUNLLock, __FILE__, __LINE__);
std::vector<uint32> fees;
{
for (std::map<RippleAddress, ClusterNodeStatus>::iterator it = m_clusterNodes.begin(),
end = m_clusterNodes.end(); it != end; ++it)
ScopedUNLLockType sl (mUNLLock, __FILE__, __LINE__);
{
if (it->second.getReportTime() >= thresh)
for (std::map<RippleAddress, ClusterNodeStatus>::iterator it = m_clusterNodes.begin(),
end = m_clusterNodes.end(); it != end; ++it)
{
uint32 fee = it->second.getLoadFee();
if (fee > b)
{
if (fee > a)
{
b = a;
a = fee;
}
else
b = fee;
}
if (it->second.getReportTime() >= thresh)
fees.push_back(it->second.getLoadFee());
}
}
}
return (b == 0) ? a : ((a + b + 1) / 2);
if (fees.empty())
return 0;
std::sort (fees.begin(), fees.end());
return fees[fees.size() / 2];
}
//--------------------------------------------------------------------------