基于S排队的被动队列管理算法  

Passive queue management algorithm based on synchronized queue

作　　者：谢立春[1] 

机构地区：[1]浙江工业职业技术学院电气工程学院,浙江绍兴312000

出　　处：《计算机应用》2012年第10期2716-2718,共3页journal of Computer Applications

基　　金：浙江省自然科学基金资助项目(y1080023)

摘　　要：为了解决网络拥塞问题,基于"弃头"方式建立了一种新的被动队列管理算法(DFSQ)。该算法首先利用S排队推导网络队长的数学表达式,并提出丢包概率和丢包策略。同时,通过仿真实验深入研究了影响网络队长的关键因素,并将DFSQ与随机早期检测算法(RED)、"弃尾"算法进行对比分析,结果表明DFSQ算法性能更优。In order to mitigate the network congestion problem, a new passive queue management algorithm Drop Front n based on Synchronized Queue （DFSQ） was proposed by Drop Front. In this algorithm, the network queue length was deducted with synchronized queue, and drop packet probability and drop packet strategy were presented. Then, a simulation was conducted to research on the key influencing factors of queue length. The results show that, compared with Random Early Detection （RED） and Drop Tail algorithm, the performance of DFSQ is better.

关 键 词：被动队列管理 弃头 S排队 队长 丢包 

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