摘要
针对带宽分配的公平性问题,提出一种基于流量感知的多虚拟队列AQM算法(FVQ算法)。FVQ引入"流粒度"思想,区分和维护每个经过瓶颈路由的业务流信息。实验结果表明,FVQ能较好地适应网络变化,相对其他算法,具有较快的收敛速度和稳定的稳态队列控制性能。
In order to solve the problem of fair bandwidth allocation, proposes a virtual queue algorithm of AQM flow based on perception (FVQ algorithm). FVQ introduced "flow granularity" thought, distinguish and maintenance by each bottleneck routing traffic flow information. The experimental results show that, FVQ can better adapt to network changes, relative to other algorithms, with steady-state queue control performance and faster convergence speed and stability.
出处
《大众科技》
2013年第10期18-20,共3页
Popular Science & Technology
关键词
带宽分配
虚拟队列
流粒度
收敛
队列控制
Bandwidth allocation
virtual queue
flow granularity
convergence
queue control