限流之令牌桶

最新推荐文章于 2024-11-01 14:48:20 发布

Darren啊

最新推荐文章于 2024-11-01 14:48:20 发布

阅读量381

点赞数

文章标签： java

本文链接：https://blog.csdn.net/menglunguo/article/details/121446682

版权

	<dependency>
      <groupId>com.google.guava</groupId>
      <artifactId>guava</artifactId>
      <scope>23.0</scope>
    </dependency>

/**
 * @author: gml
 * @date: 2021/11/20 21:37
 * @description: 令牌桶算法的原理是系统会以一个恒定的速度往桶里放入令牌, 而如果请求需要被处理, 则需要先从桶里获取一个令牌,
 * 当桶里没有令牌可取时,则拒绝服务.
 */
public class TokenBucketDemo {

    //QPS=10
    RateLimiter rateLimiter = RateLimiter.create(10);

    public void doRequest() {
        if (rateLimiter.tryAcquire()) { //获得令牌成功
            System.out.println(Thread.currentThread().getName() + "->请求成功");
        } else {
            System.out.println(Thread.currentThread().getName() + "请求失败");
        }
    }

    public static void main(String[] args) throws IOException {
        final TokenBucketDemo tokenBucketDemo = new TokenBucketDemo();
        final CountDownLatch latch = new CountDownLatch(1);
        final Random random = new Random(10);
        for (int i = 0; i < 20; i++) {
            new Thread(() -> {
                try {
                    latch.await();
                    Thread.sleep(random.nextInt(1000));
                    tokenBucketDemo.doRequest();
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }

            }, "t" + i).start();
        }
        latch.countDown();
        System.in.read();
    }
}