一种短流优先的公平带宽分配机制(英文)  

A Fair Bandwidth Allocation Mechanism with Preference to Short Flows

作　　者：张鹤颖[1] 蒋杰[1] 窦文华[1] 

机构地区：[1]国防科学技术大学计算机学院,湖南长沙410073

出　　处：《软件学报》2007年第3期765-774,共10页Journal of Software

基　　金：Supported by the National Natural Science Foundation of China under Grant No.60603064(国家自然科学基金)

摘　　要：提出一种短流优先的公平带宽分配机制FPIP(fair PIP).通过区别处理短流和长流的报文,FPIP能够将带宽优先分配给短流,然后将剩余的带宽在长流之间公平分配.此外,FPIP采用主动队列管理机制AQM(active queue management)检测拥塞并控制队列长度.仿真结果表明,FPIP在保证公平性、控制队列长度、减小Web流的响应时间等方面具有良好的性能.This paper proposes a fair bandwidth allocation mechanism FPIP （fair PIP）. Dealing differently with the packets of long flows and short flows at routers, the mechanism can preferentially allocate the bandwidth of the router to short flows and allocate the remaining among the competing long flows. Furthermore, it can keep the queue length of the router at a reference value using a well-designed active queue management AQM （active queue management） algorithm. The simulation results show that this new mechanism can outperform CSFQ （core-stateless fair queueing） in terms of fairness, queue length and the response time of Web flows.

关 键 词：公平带宽分配 队列长度 响应时间 短流 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]