摘要
邬海涛等[1] 声称“证明了WFQ、WF2 Q等算法并不是P GPS(基于分组的GPS) ,也就不能保证P GPS的时延及服务特性” .不幸的是 ,该文对WFQ系统中一个关键概念“阻塞的连接的集合”的理解是错误的 ,因此导致该文的结论无效 .
Wu Hai tao et al [1] .claim that they“have shown the two scheduling algorithms WFQ and WF 2Q are not PGPS(packet by packet GPS) so that delay and service characteristics of the latter do not hold in the former two”.Unfortunately,there is a fatal misunderstanding in their paper about an important concept,the set of busy sessions,in the WFQ algorithm,leading to the voidness of their claims.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2003年第12期1889-1890,共2页
Acta Electronica Sinica
基金
国家自然科学基金 (No .60 2 730 39
60 1 72 0 75)
国家高技术研究发展计划 (863计划 )课题(No.2 0 0 1AA1 2 1 0 63)
