摘要
针对网络最大流问题,基于丢包概率提出了一种新的计算方法(Network Maximum Flow based on Dropping rate,NMFD).该方法首先利用实际队列长度和到达速率定义了丢包策略,并在以前的研究基础上对最大流的计算方法进行了改进.同时,通过仿真实验对比分析了该算法与DINIC算法、FORD算法的性能,结果表明NMFD具有较好的适应性.
In order to mitigate the network maximum flow problem, a novel calculation method （Network Maxi- mum Flow based on Dropping rate, NMFD） was proposed by dropping rate. In this algorithm, the dropping strategy was defined with accrual queue length and arrival velocity, and the calculation of network maximum flow was improved by previous research foundation. Then, a simulation was conducted to research on the algorithm performance between NMFD and DINIC algorithm, as well as FORD algorithm. The result showed that it was better adaptability for NMFD.
出处
《广东技术师范学院学报》
2014年第11期41-44,共4页
Journal of Guangdong Polytechnic Normal University
基金
福建省信息安全重点项目(0030822711)
关键词
最大流
丢包
队列长度
到达速率
network maximum flow
dropping
queue length
arrival velocity
