期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

QL-CSFQ:一种结合队列长度的CSFQ算法 被引量：1

QL-CSFQ:A Queue Length Embedded Core-Stateless Fair Queue Algorithm
下载PDF
导出
摘要 当存在适应流时,网络流量的测量值与实际值存在比较大的误差,这将严重影响CSFQ算法中公平共享速率α值的计算准确性,从而大大降低网络流之间的公平性.针对这一问题,本文提出了一种结合队列长度的CSFQ算法—QL-CSFQ.在QL-CSFQ算法中,采用结合队列长度状态信息来提高公平共享速率α值的计算准确性,从而有效提高了存在适应流情况下的网络流之间的公平性.大量模拟实验结果表明在存在适应流情况下QL-CSFQ有效消除了测量误差对算法公平性的影响,提高了网络流之间的公平性. In CSFQ, when there exist adaptive flows there will be error between the measurement value of throughput and its real value,furthermore the fairness is seriously degraded. To resolve the problem, the paper mainly studies that how to improve the accuracy of the computation of a value,and proposes a queue length embedded core-stateless fair queue algorithm （QL-CSFQ）.In QL-CSFQ, the queue length is concemed to improve the accuracy of the computation of a value. The paper compares QL-CSFQ to CSFQ in fairness, utilization of bandwidth, the queue length and its jitter using large amount of simulations, and the results show that QL-CSFQ can decrease the impact of measurement error on the fairness. ac
作者 王建新 杨湘 陈建二
机构地区 中南大学信息科学与工程学院 武汉科技大学计算机科学与技术学院
出处 《电子学报》 EI CAS CSCD 北大核心 2007年第4期736-742,共7页 Acta Electronica Sinica
基金 国家自然科学基金(No.90304010 No.60673164) 湖南省杰出青年基金(No.06JJ10009) 新世纪优秀人才支持计划基金(No.NCET-05-0683)
关键词 主动队列管理 拥塞控制 核心无状态 公平性 队列长度 tive queue management congestion control core-stateless fairness queue length
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献17

  • 1章淼,吴建平,林闯.互联网端到端拥塞控制研究综述[J].软件学报,2002,13(3):354-363. 被引量：90
  • 2B Braden,D Clark,J Crowcrofi,S Deering,D Estrin,S Floyd,V Jacobason,G Minshall,et al.RFC 2309,IETF,Recommendations on queue management and congestion avoidance in the Internet[S].1998.
  • 3S Floyd,V Jacobson.Random early detection gateways for congestion avoidance[J].IEEE/ACM Transactions on Networking,1993,1(4):397-413.
  • 4D Lin,R Morris.Dynamics of random early detection[A].In Proceedings of Special Interest Group on Data Communication of 1997[C].New York:ACM Press,1997.127-137.
  • 5A Kamra,S Kapila,V Khurana,et al.SFED:A rate control based active queue management discipline[OL].http://www.cse.iitd.ernet.in/～ srajeev/publications.htm,2000-08-16.
  • 6T J Ott,T V Lakshman,L Wong.SRED:Stabilized RED[A].In Proc IEEE INFOCOM of 1999[C].Seattle:IEEE CS Press 1999.1346-1355.
  • 7S Floyd,R Gummadi,S Shenker.Adaptive RED:An algorithm for increasing the robustness of RED's active queue management[OL].Http://www.Icir.Org/floyd/papers.Html,2001-08-01.
  • 8W Feng,K G Shin,D D Kandlur,D Saha.The BLUE active queue management algorithms[J].IEEE/ACM Transactions on Networking,2002,10(4):345-352.
  • 9R Pan,B Prabhakar,K Psounis.CHOKe:A stateless active queue management scheme for approximating fair bandwidth allocation[A].In Proc IEEE INFOCOM'00[C].Seattle:IEEECS Press,2000.942-951.
  • 10Ion Stoica,Scott Shenker,Hui Zhang.Core-stateless fair queue:Achieving approximately fair bandwidth allocations in high speed networks[J].IEEE/ACM Transactions on Networking,2003,11(1):33-46.

二级参考文献85

  • 1[1]Postel,J.Transmission Control Protocol.RFC 793,1981.
  • 2[2]Jacobson,V.Congestion avoidance and control.ACM Computer Communication Review,1988,18(4):314~329.
  • 3[3]Tanenbaum,A.S.Computer Networks.3rd ed.,Prentice Hall,Inc.,1996.
  • 4[4]Jain,R.,Ramakrishnan,K.K.,Chiu,Dah-Ming.Congestion avoidance in computer networks with a connectionless network layer.Technical Report,DEC-TR-506,Digital Equipment Corporation,1988.http://www.cis.ohio-state.edu/~jain.
  • 5[5]Peterson,L.L.,Davie,B.S.Computer Networks:a System Approach.Morgan Kaufmann Publishers,2000.
  • 6[6]Bennett,J.C.R.,Partridge,C.,Shectman,N.Packet reordering is not pathological network behavior.IEEE/ACM Transactions on Networking,1999,7(6):789~798.
  • 7[7]Shenker,S.Fundamental design issues for the future Internet.IEEE Journal on Selected Areas in Communications,1995,13(7):1176~1188.
  • 8[8]Jain,R.Congestion control in computer networks:issues and trends.IEEE Network Magazine,1990,4(3):24~30.
  • 9[9]Balakrishnan,H.M.I.T.6.899 Computer Networks.Tutorial Slides,2000.http://nms.lcs.mit.edu/6.899/.
  • 10[10]Saltzer,J.,Reed,D.,Clark,D.End-to-End arguments in system design.ACM Transactions on Computer Systems,1984,2(4):195~206.

共引文献147

同被引文献12

  • 1谢立峰,叶澄清,顾伟康.高吞吐量的核心无状态公平队列算法[J].计算机工程,2005,31(5):125-127. 被引量：4
  • 2李鹏翀,朱荣,饶小兵,秦前清.CSFQ算法分析与改进[J].计算机工程与设计,2006,27(12):2140-2142. 被引量：4
  • 3SUTER B. Efficient Active Queue Management for Internet Routers [C]//Proc Eng Conf at Interop 1998. New York: IEEE Computer Society Press, 1998.
  • 4LLOYD S, JACOBSON V. Random Early Detection Gateways for Congestion avoidance [J]. IEEE/ACM Transactions on Networking, 1993, 1(4): 397-413.
  • 5BLAKE S, BLAKE D, CARLSON M, et al. An Architecture for Differentiated Services [EB/OL]. (1998-12-21) [2010-02-23]. http: //cs. nyu. edu/courses/fal199/G22, a03a -003/leet4-diffserv-tao. pdf.
  • 6DEMERS A, KESHAV S, SHENKER S. Analysis and Simulation Fair Queuing Algorithm [C]//Proeeedings of ACM SIGCOMM'89. Providence: ACM Press, 1989: 3-12.
  • 7SHREEDHAR M , GEORGE V. Efficient Fair Queuing Using Deficit Round-Robin [J]. IEEE/ACM Transactions on Networking, 1996, 4(3): 375-386.
  • 8STOICS I. Core-stateless Fair Queuing.. Achieving Approximately Fair Bandwidth Allocation in High Speed Networks [C]//Proeeeding of ACM SIGCOMM 1998. Providence.. ACM Press, 1989: 118-130.
  • 9常恒,柯峰,史景伦,向继东.混合网络模型中的QoS路由算法[J].小型微型计算机系统,2008,29(5):913-918. 被引量：2
  • 10章淼,吴建平,林闯.互联网端到端拥塞控制研究综述[J].软件学报,2002,13(3):354-363. 被引量：90

引证文献1

电子学报
2007年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部