chromium/components/reporting/util/rate_limiter_leaky_bucket.h

// Copyright 2023 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#ifndef COMPONENTS_REPORTING_UTIL_RATE_LIMITER_LEAKY_BUCKET_H_
#define COMPONENTS_REPORTING_UTIL_RATE_LIMITER_LEAKY_BUCKET_H_

#include <cstddef>

#include "base/functional/bind.h"
#include "base/memory/weak_ptr.h"
#include "base/sequence_checker.h"
#include "base/task/sequenced_task_runner.h"
#include "base/time/time.h"
#include "components/reporting/util/rate_limiter_interface.h"

namespace reporting {

// Rate limiter implementation of the leaky bucket algorithm.

// A leaky bucket works as if filling up with water. The water represents the
// incoming events, and the bucket represents the system's capacity to accept
// them. The bucket has a hole in the bottom, which represents the rate at which
// the system can accept events. Water is not allowed to overflow the bucket.
//
// `max_level` is the maximum total size of events that can be in the bucket at
// any given time. `filling_time` represents the leakage rate at which events
// are allowed to go through the bucket. `filling_period` indicates how often do
// we want to update the level (the more frequently we do it, the fewer tokens
// we add each time).
//
// When a new event arrives, its size is released from the bucket, but only if
// the bucket is full, otherwise the event is rejected. After that the bucket
// resumes filling in at the prescribed rate - the time it takes is proportional
// to the event size.
//
// The outcome is that the events are accepted at no more than the leakage rate.
// It works well for averaging events rate over time.
//
class RateLimiterLeakyBucket : public RateLimiterInterface { … };
}  // namespace reporting

#endif  // COMPONENTS_REPORTING_UTIL_RATE_LIMITER_LEAKY_BUCKET_H_