期刊文献+

基于流量感知的多虚队列AQM算法 被引量:1

Multiple virtual queue algorithm flow sensing based on AQM
下载PDF
导出
摘要 针对带宽分配的公平性问题,提出一种基于流量感知的多虚拟队列AQM算法(FVQ算法)。FVQ引入"流粒度"思想,区分和维护每个经过瓶颈路由的业务流信息。实验结果表明,FVQ能较好地适应网络变化,相对其他算法,具有较快的收敛速度和稳定的稳态队列控制性能。 In order to solve the problem of fair bandwidth allocation, proposes a virtual queue algorithm of AQM flow based on perception (FVQ algorithm). FVQ introduced "flow granularity" thought, distinguish and maintenance by each bottleneck routing traffic flow information. The experimental results show that, FVQ can better adapt to network changes, relative to other algorithms, with steady-state queue control performance and faster convergence speed and stability.
作者 王方红
出处 《大众科技》 2013年第10期18-20,共3页 Popular Science & Technology
关键词 带宽分配 虚拟队列 流粒度 收敛 队列控制 Bandwidth allocation virtual queue flow granularity convergence queue control
  • 相关文献

参考文献10

  • 1鲁维.三网融合时代的机遇和挑战[J].电信科学,2011,27(2):7-11. 被引量:9
  • 2刘强,崔莉,陈海明.物联网关键技术与应用[J].计算机科学,2010,37(6):1-4. 被引量:602
  • 3V.Jacobson. Congestion avoidance and control[J], ACM Computer Communication Review.1988,18(4): 314-329.
  • 4Van Kranenburg R. The Intemet of Things [M].Amsterdam: Waag Society, 2008.
  • 5罗万明,林闯,阎保平.TCP/IP拥塞控制研究[J].计算机学报,2001,24(1):1-18. 被引量:196
  • 6Afimsyev A,Tilley N,Reiher P, et a/Host-to-Host Congestion Control for TCP[J].IEEE. Communications Surveys & Tutofiak2010, 12(3):304-342.
  • 7章淼,吴建平,林闯.互联网端到端拥塞控制研究综述[J].软件学报,2002,13(3):354-363. 被引量:90
  • 8Braden B. Recommendations on queue management and congestion avoidance in the Intemet[Z].IETF RFC2309, 1998.
  • 9Jong-Hwan K,Ikjun Y. Reducing Queue Oscillation at a Congested Link [J]. IEEE Transactions on Parallel and Distributed Systems,2008,19(3):394-407.
  • 10陈伟杰.基于主动队列管理的拥塞控制策略及其稳定性研究[D].浙江:浙江工业大学,2010,20-30.

二级参考文献84

  • 1崔莉,鞠海玲,苗勇,李天璞,刘巍,赵泽.无线传感器网络研究进展[J].计算机研究与发展,2005,42(1):163-174. 被引量:730
  • 2吕海寰.美国军事卫星通信系统的现状与发展[J].军事通信技术,1994,15(3):1-12. 被引量:5
  • 3[1]Postel,J.Transmission Control Protocol.RFC 793,1981.
  • 4[2]Jacobson,V.Congestion avoidance and control.ACM Computer Communication Review,1988,18(4):314~329.
  • 5[3]Tanenbaum,A.S.Computer Networks.3rd ed.,Prentice Hall,Inc.,1996.
  • 6[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.
  • 7[5]Peterson,L.L.,Davie,B.S.Computer Networks:a System Approach.Morgan Kaufmann Publishers,2000.
  • 8[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.
  • 9[7]Shenker,S.Fundamental design issues for the future Internet.IEEE Journal on Selected Areas in Communications,1995,13(7):1176~1188.
  • 10[8]Jain,R.Congestion control in computer networks:issues and trends.IEEE Network Magazine,1990,4(3):24~30.

共引文献882

同被引文献17

  • 1赵东风,丁洪伟,杨志军.连续时间型轮询系统并行调度策略研究[J].云南大学学报(自然科学版),2003,25(3):212-216. 被引量:5
  • 2ALTINTAS O.Urgency-based round robin:A new sched- uling discipline for packet switching networks [ C ]. IEEE INFOCOMM ' 98,1998 : 1 197-1 183.
  • 3GOLESTANI S J.A self-clocked fair queuing scheme for broadband applications [ C ]. IEEE INFOCOMM ' 94, 1994 : 636- 645.
  • 4SURI S,VARGHESE G, CHANDRANMENON G. Leap forward virtual eloek:a new fair queuing scheme with guaranteed delays and throughput fairness [ C ] .IEEE IN-FOCOMM ' 97,1997:557-565.
  • 5BENNETT R, ZHANG H.WF2Q : Worst-case fair weigh- ted fair queuing [ C ]. IEEE INFOCOM ' 96, 1996 : 120- 128.
  • 6GURIN R,PERIS V.Quality-of-service in packet net- works basic mechanisms and directions [ J ]. Computer Networks, 1999,31 ( 3 ) : 169-179.
  • 7ZHANG H, FERRARI D. Rate-contrled service disci- plines[ J ]. Journal of High Speed Networks, 1995, 3 (4) :389-412.
  • 8CRUZ L.Quality of service guarantees in virtual circuit switched networks[ J ] .IEEE Journal Selected Areas in Communications, 1995,13(6) : 1 048-1 056.
  • 9SANRIOWAN H, CRUZ L. Scheduling for quality of services guarantees via service curves [ C ]. IEEE IN- FOCOMM ' 95,1995 : 512-520.
  • 10STOICA I, ZHANG H, EUGENENG T S, et al. Aierar- chical fair service curve algorithm for link-sharing, real -time and priority services [ J ] . IEEE/ACM Transac- tions on Networking, 2000,8 (2) : 185-199.

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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