如果存在正在等待的请求，那么令牌将分配给下一个请求，并且将该请求从队列中删除。
If there are requests waiting, the token is assigned to the next request, which is removed from the queue.
如果一个组中的所有端点的所有令牌都已分配出去，那么仲裁流请求将储存在一个fifo队列中，直至有令牌转变成未占用状态。
IF all tokens of all endpoints in the group are assigned, the mediation flow request is stored in a FIFO queue until a token becomes free.
如果队列中的令牌超过20个，颜色将变为红色以指示重大的任务积压。
If more than twenty tokens are in the queue, the color goes to red to indicate a large back-up.
Step1的两个实例是活动的，其他传入令牌必须在该任务前面的队列中等待。
Two instances of Step 1 are active, with the other incoming tokens having to wait in the queue in front of the task.
某个优先级队列的令牌如果不够用，允许向其他优先级队列借用令牌，或收回借出的令牌，从而实现带宽的动态分配。
If one queue's tokens are not enough, it can borrow some from other queues, or take back the ones it has lent out; this can realize dynamic bandwidth allocation.
某个优先级队列的令牌如果不够用，允许向其他优先级队列借用令牌，或收回借出的令牌，从而实现带宽的动态分配。
If one queue's tokens are not enough, it can borrow some from other queues, or take back the ones it has lent out; this can realize dynamic bandwidth allocation.
应用推荐