期刊文献+

LA-CHOKe:负载自适应的CHOKe算法 被引量:4

下载PDF
导出
摘要 分析了几种具有代表性的改进公平性主动队列管理算法,通过理论分析和仿真实验说明了它们的不足。在此基础上,提出了一种负载自适应的CHOKe算法,该算法通过对网络负载的测量,更有效地检测网络拥塞,同时根据网络负载情况自适应地调整对非响应流的惩罚力度,并且在原有的CHOKe算法基础上,更充分地利用了取出分组的统计信息,从而能更有效、更精确地对非响应流实施惩罚。这些方法的应用并没有增加原有算法的计算量和复杂度,保持了算法的无状态性和可伸缩性。仿真实验结果表明,改进算法较原有算法在公平性等方面得到了有效的提高。
作者 彭禹 高文宇
出处 《计算机应用》 CSCD 北大核心 2007年第B12期35-38,40,共5页 journal of Computer Applications
  • 相关文献

参考文献11

  • 1FLOYD S, JACOBSON V. Random early detection gateways for congestion avoidance[ J]. IEEE/ACM Transactions on Networking, 1993,1 (4) : 397 -413.
  • 2BRADEN B, CLARK D, CROWCROFT J, et al. IETF RFC2309, Recommendations on queue management and congestion avoidance in the internet[ S]. USA: RFC Editor, 1998.
  • 3LIN D, MORRIS R, Dynamics of random early detection[ J], ACM SIGCOMM Computer Communication Review, 1997, 27( 4): 127 - 137.
  • 4STOICA I, SHENKER S, ZHANG H. Core-stateless fair queue: Achieving approximately fair bandwidth allocations in high speed networks[J]. IEEE/ACM Transactions on Networking, 2003, 11 (1) : 33 -46.
  • 5PAN R, PRABHAKAR B, PSOUNIS K. CHOKe, A stateless active queue management scheme for approximating fair bandwidth allocation[ C]// Proceedings of IEEE INFOCOM'00, March 26 - 30, 2000, Tel Aviv, Israel. Washington, USA: IEEE CS Press, 2000, 2:942 -951.
  • 6WANG J, TANG A, LOW S H. Maximum and asymptotic UDP throughput under CHOKe [ C ]// Proceedings of the International Conference on Measurements and Modeling of Computer Systems, June 9-14, 2003, San Diego, CA, USA. New York, USA: ACM Press, 2003:82-90.
  • 7TANG A, WANG J. LOW S H. Understanding CHOKe: throughput and spatial characteristics[ J]. IEEE/ACM Transactions on Networking, 2004, 12(4):694-707.
  • 8DEMERS A, KESHAV S, SHENKER S. Analysis and simulation of a fair queuing algorithm[ C]// Proceedings of ACM SIGCOMM'89, September 25-27, 1989, Austin, Texas, USA. New York, USA: ACM Press, 1989:1- 12.
  • 9STOICA I, ZHANG H. Providing guaranteed services without per flow management[ C]// Proceedings of ACM SIGCOMM'99, August 30-September03, 1999, Cambridge, Massachusetts, USA. New York, USA: ACM Press, 1999:81-94.
  • 10STOICA I. Stateless core: a scalable approach for quality of service in the internet[D]. Pittsburgh, PA, USA: Carnegie Mellon University, Department of Electrical and Computer Engineering, 2000.

同被引文献37

  • 1高文宇,陈松乔,王建新.动态的时间驱动的分组采样技术[J].通信学报,2005,26(4):24-29. 被引量:2
  • 2王建新,周雄伟,杨湘.一种惩罚非适应流的无状态主动队列管理算法[J].系统工程与电子技术,2006,28(12):1935-1939. 被引量:6
  • 3FLOYD S , JACOBSON V . Random early detection gateways for congestion avoidance[ J]. IEEE/ACM Transactions on Networking, 1993, 1(4) : 397 -413.
  • 4PAN R, PRABHAKAR B, PSOUNIS K. CHOKe: A stateless active queue management scheme for approximating fair bandwidth allocation[ C] // Proceedings of IEEE INFOCOM00. Washington, DC: IEEE Computer Society, 2000, 2:942 -951.
  • 5CHHABRA P, JOHN A, SARAN H, et al. Controlling malicious sources at Intemet gateways[ C] // IEEE International Conference on Communication. [ S. l. ] : IEEE, 2003, 3:1636 - 1640.
  • 6LIN D, MORRIS R. Dynamics of random early detection[J]. ACM SIGCOMM Computer Communication Review, 1997, 27(4) : 127 - 137.
  • 7STOICA I, SHENKER S, ZHANG H. Core-stateless fair queue: Achieving approximately fair bandwidth allocation in high speed networks[ J]. IEEE/ACM Transactions on Networking, 2003, 11 (1) : 33 - 46.
  • 8BRADEN B, CLARK D, et al. Recommendations on Queue Managementand CongestionAvoidance in the Intemet, IEEF RFC 2309[ S]. 1998.
  • 9Pan R, Prabhakar B, Psounis K. CHOKe: A stateless active queue management scheme for approximating fair bandwidth allo-cafion[ A]. Proceedings of IEEE INFOCOM'2000[ C ]. Piscataway: IEEE Press, 2000.2.942 - 951.
  • 10C Parminder, C Shobhit, G Anttrag, J Ajita, K Abhishek, S Huzur, S Rajeev. xCHOKe: Malicious source control for congestion avoidance at intemet gateways [A]. Proceedings of IEEE International Conference on Network Protocols (ICNP- 02) [C]. Paris: IEEE Press ,2002. 186 - 187.

引证文献4

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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