节点文献
一种近似公平的网络带宽分配算法
An Approximately Fair Algorithm for Network Bandwidth Allocation
【摘要】 Internet业务流由大量相互竞争的数据流构成。为了保障各种网络业务所需的服务质量,需要在这些数据流之间进行近似公平的带宽分配。文章提出了采用多令牌桶进行带宽分配的机制,提供了一定的流间隔离与保护。仿真实验表明,该算法在保护网关的缓冲区和控制带宽的公平分配方面是有效的。
【Abstract】 The Internet traffic is a mix of large number of competing data flows.For the provision of various quality of service,bandwidth should be allocated fairly among these flows.The paper presents a new bandwidth allocating algorithm based on the multiple token buckets mechanism,which to a certain extent provides the desired isolation and protection among flows.The result from simulation shows that the algorithm is effective in protecting the gateway buffer and controlling the fair allocation of bandwidth.
【关键词】 带宽分配;
服务质量;
多令牌桶;
【Key words】 Bandwidth allocation; Quality of service; Multiple token buckets;
【Key words】 Bandwidth allocation; Quality of service; Multiple token buckets;
【基金】 国家自然科学基金项目(编号:69983005);国家教育部博士点基金项目(编号:RFDP1999048602)
- 【文献出处】 计算机工程与应用 ,Computer Engineering and Applications , 编辑部邮箱 ,2003年11期
- 【分类号】TP393.03
- 【下载频次】81