摘要
针对传统IPACT算法造成USR较大的问题,构建了基于Agent的动态带宽分配模型,引入了议价博弈的思路,提出了一种基于讨价-还价的局部带宽分配算法,通过将队列中数据包按照用户等级、时延和数据包大小等3个因素进行议价后重新排序,改进了传统IPACT算法中数据包按顺序轮询的思路,较好地解决了多因素共同作用下的带宽分配问题。实验表明该模型能够有效减少USR,提高带宽的分配效率。
Aiming at the problem that traditional IPACT may cause superior USR,the agent dynamic bandwidth allocation model is built. The idea of bargaining game is introduced and a local bandwidth allocation algorithm based on the bargain-bargain is proposed. By re-sequencing the date packets after bargaining according to the user level,delay and packet size,the thinking in traditional IPACT that date packet in order polling is improved. The method may effectively solve the bandwidth allocation problem under the action of many factors. Experiments show that the model can effectively reduce the USR. It can also improve the efficiency of bandwidth allocation.
出处
《现代防御技术》
北大核心
2016年第5期167-172,共6页
Modern Defence Technology
关键词
动态带宽分配
AGENT模型
业务类
周期自适应交叉轮询
博弈
未使用时隙
dynamic bandwidth allocation
Agent model
business class
interleaved polling with adaptive cycle time(IPACT)
bargain
unused slot remainder(USR)