令牌漏桶算法实现限流

最新推荐文章于 2023-03-10 11:34:56 发布

peng646138471

最新推荐文章于 2023-03-10 11:34:56 发布

阅读量308

点赞数

文章标签：算法 php 并发编程

本文链接：https://blog.csdn.net/peng646138471/article/details/105582961

版权

1.思维流程图：
在这里插入图片描述

2.代码如下

<?php
class RateLimit
{
    private $minNum = 100; //单个用户每分访问数
	
	//主函数
    public function handle($uid)
    {
        $minNumKey = $uid . '_minNum';
        $dayNumKey = $uid . '_dayNum';
        $resMin    = $this->getRedis($minNumKey, $this->minNum, 60);
        if (!$resMin['status']) {
            return ['status'=>0,'info'=>'人数较多,请稍候'];
        }else{
            return ['status'=>1,'info'=>'正常'];
        }
    }


    protected function getRedis($key, $initNum, $expire)
    {
        $nowtime  = time();
        $result   = ['status' => true, 'msg' => ''];
        $ip = "127.0.0.1"; 
        $port = 6379; 
        $redis = new \Redis();
        $redis->connect($ip, $port);
        $redis->watch($key);
        $limitVal = $redis->get($key);
        if ($limitVal) {
            $limitVal = json_decode($limitVal, true);
            $newNum   = min($initNum, ($limitVal['num'] - 1) + (($initNum / $expire) * ($nowtime - $limitVal['time'])));
            if ($newNum > 0) {
                $redisVal = json_encode(['num' => $newNum, 'time' => time()]);
            } else {
                return ['status' => false, 'msg' => '当前时刻令牌消耗完！'];
            }
        } else {
            $redisVal = json_encode(['num' => $initNum, 'time' => time()]);
        }
        $redis->multi();
        $redis->set($key, $redisVal);
        $rob_result = $redis->exec();
        if (!$rob_result) {
            $result = ['status' => false, 'msg' => '访问频次过多！'];
        }
        return $result;
    }
}