2013-08-08 21:20:35 +00:00
|
|
|
/*
|
2015-02-17 21:11:34 +00:00
|
|
|
* ZeroTier One - Network Virtualization Everywhere
|
|
|
|
* Copyright (C) 2011-2015 ZeroTier, Inc.
|
2013-08-08 21:20:35 +00:00
|
|
|
*
|
|
|
|
* This program is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*
|
|
|
|
* --
|
|
|
|
*
|
|
|
|
* ZeroTier may be used and distributed under the terms of the GPLv3, which
|
|
|
|
* are available at: http://www.gnu.org/licenses/gpl-3.0.html
|
|
|
|
*
|
|
|
|
* If you would like to embed ZeroTier into a commercial application or
|
|
|
|
* redistribute it in a modified binary form, please contact ZeroTier Networks
|
|
|
|
* LLC. Start here: http://www.zerotier.com/
|
|
|
|
*/
|
|
|
|
|
2013-12-07 00:49:20 +00:00
|
|
|
#ifndef ZT_BWACCOUNT_HPP
|
|
|
|
#define ZT_BWACCOUNT_HPP
|
2013-08-08 21:20:35 +00:00
|
|
|
|
2013-09-07 16:23:53 +00:00
|
|
|
#include <stdint.h>
|
2013-08-08 21:20:35 +00:00
|
|
|
#include <math.h>
|
2013-08-13 01:25:36 +00:00
|
|
|
|
|
|
|
#include "Constants.hpp"
|
2013-08-08 21:20:35 +00:00
|
|
|
#include "Utils.hpp"
|
|
|
|
|
2014-01-18 01:09:59 +00:00
|
|
|
#ifdef __WINDOWS__
|
|
|
|
#define round(x) ((x-floor(x))>0.5 ? ceil(x) : floor(x))
|
|
|
|
#endif
|
|
|
|
|
2013-08-08 21:20:35 +00:00
|
|
|
namespace ZeroTier {
|
|
|
|
|
|
|
|
/**
|
2013-09-04 13:27:56 +00:00
|
|
|
* Bandwidth account used for rate limiting multicast groups
|
2013-08-08 21:20:35 +00:00
|
|
|
*
|
2013-08-30 20:47:54 +00:00
|
|
|
* This is used to apply a bank account model to multicast groups. Each
|
|
|
|
* multicast packet counts against a balance, which accrues at a given
|
|
|
|
* rate in bytes per second. Debt is possible. These parameters are
|
|
|
|
* configurable.
|
|
|
|
*
|
|
|
|
* A bank account model permits bursting behavior, which correctly models
|
|
|
|
* how OSes and apps typically use multicast. It's common for things to
|
|
|
|
* spew lots of multicast messages at once, wait a while, then do it
|
|
|
|
* again. A consistent bandwidth limit model doesn't fit.
|
2013-08-08 21:20:35 +00:00
|
|
|
*/
|
2013-09-04 13:27:56 +00:00
|
|
|
class BandwidthAccount
|
2013-08-08 21:20:35 +00:00
|
|
|
{
|
|
|
|
public:
|
|
|
|
/**
|
2013-09-04 13:27:56 +00:00
|
|
|
* Create an uninitialized account
|
2013-08-08 21:20:35 +00:00
|
|
|
*
|
|
|
|
* init() must be called before this is used.
|
|
|
|
*/
|
2013-09-04 13:27:56 +00:00
|
|
|
BandwidthAccount() throw() {}
|
2013-08-08 21:20:35 +00:00
|
|
|
|
|
|
|
/**
|
2013-09-04 13:27:56 +00:00
|
|
|
* Create and initialize
|
2013-08-30 20:47:54 +00:00
|
|
|
*
|
2013-08-08 21:20:35 +00:00
|
|
|
* @param preload Initial balance to place in account
|
2013-09-07 16:23:53 +00:00
|
|
|
* @param maxb Maximum allowed balance (> 0)
|
|
|
|
* @param acc Rate of accrual in bytes per second
|
2013-08-08 21:20:35 +00:00
|
|
|
*/
|
2013-09-11 20:08:31 +00:00
|
|
|
BandwidthAccount(uint32_t preload,uint32_t maxb,uint32_t acc)
|
2013-08-08 21:20:35 +00:00
|
|
|
throw()
|
|
|
|
{
|
2013-09-10 18:13:04 +00:00
|
|
|
init(preload,maxb,acc);
|
2013-08-08 21:20:35 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2013-09-04 13:27:56 +00:00
|
|
|
* Initialize or re-initialize account
|
2013-08-08 21:20:35 +00:00
|
|
|
*
|
|
|
|
* @param preload Initial balance to place in account
|
2013-09-07 16:23:53 +00:00
|
|
|
* @param maxb Maximum allowed balance (> 0)
|
|
|
|
* @param acc Rate of accrual in bytes per second
|
2013-08-08 21:20:35 +00:00
|
|
|
*/
|
2013-09-11 20:08:31 +00:00
|
|
|
inline void init(uint32_t preload,uint32_t maxb,uint32_t acc)
|
2013-08-08 21:20:35 +00:00
|
|
|
throw()
|
|
|
|
{
|
|
|
|
_lastTime = Utils::nowf();
|
|
|
|
_balance = preload;
|
2013-09-07 16:23:53 +00:00
|
|
|
_maxBalance = maxb;
|
|
|
|
_accrual = acc;
|
2013-08-08 21:20:35 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2013-09-11 20:08:31 +00:00
|
|
|
* Update and retrieve balance of this account
|
2013-08-08 21:20:35 +00:00
|
|
|
*
|
2013-09-11 20:08:31 +00:00
|
|
|
* @return New balance updated from current clock
|
2013-08-08 21:20:35 +00:00
|
|
|
*/
|
2013-09-11 20:08:31 +00:00
|
|
|
inline uint32_t update()
|
2013-08-08 21:20:35 +00:00
|
|
|
throw()
|
|
|
|
{
|
2013-08-09 20:36:58 +00:00
|
|
|
double lt = _lastTime;
|
2013-09-07 16:23:53 +00:00
|
|
|
double now = Utils::nowf();
|
|
|
|
_lastTime = now;
|
2013-09-11 20:08:31 +00:00
|
|
|
return (_balance = std::min(_maxBalance,(uint32_t)round((double)_balance + ((double)_accrual * (now - lt)))));
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Update balance and conditionally deduct
|
|
|
|
*
|
|
|
|
* If the deduction amount fits, it is deducted after update. Otherwise
|
|
|
|
* balance is updated and false is returned.
|
|
|
|
*
|
|
|
|
* @param amt Amount to deduct
|
|
|
|
* @return True if amount fit within balance and was deducted
|
|
|
|
*/
|
|
|
|
inline bool deduct(uint32_t amt)
|
|
|
|
throw()
|
|
|
|
{
|
|
|
|
if (update() >= amt) {
|
|
|
|
_balance -= amt;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
2013-08-13 19:14:03 +00:00
|
|
|
}
|
|
|
|
|
2013-09-12 21:27:10 +00:00
|
|
|
/**
|
|
|
|
* @return Most recent balance without update
|
|
|
|
*/
|
|
|
|
inline uint32_t balance() const
|
|
|
|
throw()
|
|
|
|
{
|
|
|
|
return _balance;
|
|
|
|
}
|
|
|
|
|
2013-08-08 21:20:35 +00:00
|
|
|
private:
|
|
|
|
double _lastTime;
|
2013-09-11 20:08:31 +00:00
|
|
|
uint32_t _balance;
|
|
|
|
uint32_t _maxBalance;
|
|
|
|
uint32_t _accrual;
|
2013-08-08 21:20:35 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
} // namespace ZeroTier
|
|
|
|
|
|
|
|
#endif
|