期刊文献+

QoS体系中的主动队列管理算法研究综述 被引量:1

Overview of Active Queuing Management Algorithm in QoS Architecture
下载PDF
导出
摘要 随着Internet的迅速发展,服务质量(Qo S)正成为当前研究的热点之一。为了达到Q o S的性能指标,拥塞控制作为一个很重要的方面在发挥着作用。主动队列管理是实现拥塞控制的重要手段之一,长期以来一直受到广泛的关注,基于不同理论的各种主动队列管理的算法也随之涌现。这些队列管理算法在一定程度上完成网络拥塞控制的任务,但是也不同程度地在公平性、可扩展性以及算法的复杂度上存在缺陷。本文通过对目前几种主要队列管理算法的实现原理的分析,考察了这些队列管理算法的优点和其可能存在的一些问题,而这些可能存在的问题也是下一步研究的起点。 With the rapid development of Internet,QoS is becoming a hot spot of present research.To achieve the performance index of QoS control,congestion control acts as a very important component.Active queue management absorbed much attention as an one of the important methods to achieve congest control,and many active queue management algorithms are proposed.Although these algorithms can provide congest control in some manner,they have shortcomings in some aspects such as fairness,scalability and complexity etc.We survey the advantages and problems that maybe exist,through the analysis of some major active queue management algorithms,and these problems will be start point of next researches.
出处 《现代电子技术》 2005年第15期47-49,53,共4页 Modern Electronics Technique
基金 国家自然科学基金重大研究计划 (90 30 4 0 1 0 )
关键词 服务质量 主动队列管理 拥塞控制 公平性 可扩展性 复杂度 QoS active queue management congest control fairness scalability complexity
  • 相关文献

参考文献16

  • 1Floyd S,Jacobson V.Random Early Detection Gateways for Congestion Avoidance[M].IEEE/ACM Transactions on Networking,1993,1(4):397-413.
  • 2Lin D,Morris R.Dynamics of Random Early Detection[G].In:Proc Sigcomm′97,1997.127-137.
  • 3Kamra A,Kapila S,Khurana V,et al.SFED: A Rate Control Based Active Queue Management Discipline[J].IBM IRL Research Report,New Delhi,India,2000.
  • 4Ott T J,Lakshman T V,Wong L.SRED: Stabilized RED[J].In Proceedings of IEEE INFOCOM ′99,1999.1 346-1 355.
  • 5Floyd S,Gummadi R,Shenker S.Adaptive RED: AnAlgorithm for Increasing the Robustness of RED. Technical Report,ICSI,2001.
  • 6Pan R,Prabhakar B,Psounis K.CHOKe:A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation.IEEE INFOCOM′00,2000.
  • 7Core-stateless Fair Queue: Achieving Approximately FairBandwidth Allocations in High Speed Networks[J].IEEE/ACM Transactions on Networking,2003,11(1): 33-46.
  • 8Demers A,Keshav S,Shenker S.Analysis and Simulation ofa Fair Queuing Algorithm[G].In:Proc Sigcomm′89,1989.
  • 9Stoica I,Zhang H.Providing Guaranteed Services withoutPer Flow Management.ACM Sigcomm′99,1999.
  • 10Pan R,Breslau L,Prabhakar B,et al.Flow Table BasedDesign to Approximate Fairness[J]. Proceedings of Hot Interconnect X.,Stanford Symposium on High Performance Interconnects,2002.37-42.

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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