期刊文献+

一种适用于无线通信网络的随机提前检测算法 被引量:1

Novel RED Algorithm for Wireless Communication Network
下载PDF
导出
摘要 在无线通信网络环境下,提出了一种改进的基于平均队列长度和等待时间的随机提前检测算法。这种算法根据平均队列长度和等待时间计算数据包的丢弃概率。仿真结果表明,与单纯基于平均队列长度的RED算法相比较,在大的数据业务负荷条件下可以获得相对更大的吞吐量、更低的丢包率以及较低的时延抖动,从而能更有效地实现无线网络中的拥塞控制。 Under the wireless communication network environment, based on the average queue length and waiting time, an improved Random Early Detection ( RED ) algorithm is proposed. The algorithm calculated packet loss rate according to the average queue length and waiting time. Simulation results show that, compared with traditional RED algorithm, the novel algorithm could realize congestion control for mobile networks more effectively.
出处 《计算机应用研究》 CSCD 北大核心 2007年第2期302-304,共3页 Application Research of Computers
基金 国家自然科学基金资助项目(60496310)
关键词 服务质量 拥塞控制 随机提前检测 无线网络 QoS Congestion Control RED(Random Early Detection) Mobile Network
  • 相关文献

参考文献8

二级参考文献19

  • 1Postel J. Transmission Control Protocol. RFC 793[ S]. 1981.
  • 2Jacobson V, Kards MJ. Congestion avoidance and control [ J ] .IEEE/ACM Transactions on Networking, 1988, 6(3) : 314 - 329.
  • 3Braden B, Clark D, Crowcroft J, et al. Recommendations on queue management and congestion avoidance in the Internet RFC 2309[ S]. 1994.
  • 4Floyd S, Jacobson V. Random early detection gateways for congestion avoidance[ J]. IEEE/ACM Transactions on Networking, 1993, 1(4) : 397 - 413.
  • 5Wu CF, Kandlur DD, Saha D, et al. A self-configuring RED gateway[ A]. Doshi B. Proceedings of IEEE INFOCOM[ C]. New York:IEEE Communications Society, 1999. 1320 - 1328.
  • 6Ott TJ, Lakshman TV, Wong LH. SRED: Stabilized RED[ A]. Doshi B. Proceedings of IEEE INFOCOM[ C]. New York: IEEE Communications Society, 1999. 1346 - 1355.
  • 7Wu CF, Kandlur D, Saha D, et al. BLUE : A new class of active queue management algorithms[ D]. Michigan: University of Michigan, 1999.
  • 8Sally Floyd and Van Jacobson, Random Early Detection Gateways for Congestion Avoidance, IEEE/ACM Transactions on Networking, 1999, 8:458-472.
  • 9Bonald T, May M and Bolot J. Analytic evaluation of RED performance [C]. IEEE Incom' 99, SanFrancisco,CA, November 1999 47-54.
  • 10EIIoumi O, De Cnodder S, and Pauwels K. Usefulness of Three Drop Prededences in Assured , Forwarding Service. Intemet Draft, draft - elloumi - diffserv - threevstwo-00. txt, July 1999.

共引文献20

同被引文献11

  • 1任丰原,林闯,黄小猛,刘卫东.主动队列管理算法的分类器实现[J].电子学报,2004,32(11):1796-1800. 被引量:9
  • 2Steven H Low. TCP congestion controls: Algorithms and models [R]. New Orleans, USA: Tutorial Slides, Presented in IEEE ICC, 2000.
  • 3Hollot C V, Misra V, FTowsley D, et al. A control theoretic analysis of RED[C]. Anchorage, Alaska, USA: Proc of INFOCOM,2001:1510-1519.
  • 4Carl SMarshall. Cartoon rendering[C]. Mark A. Deloura Game Programming Geme. America: Posts &Telecommunications Press, 2003:376-388.
  • 5Johan Claes, Fabian Di Fiore, Gert Vansichem. Fast 3D cartoon rendering with improved quality by exploiting graphics hardware [C]. Annecy, France: Proceedings of the 3rd International Symposium on Non-photorealistic Animation and Rendering, 2004:129-137.
  • 6Anjum F, Tassiulas L. Fair bandwidth sharing among adaptive and nonadaptive flows in the intemet [C]. New York, USA: Proc of IEEE INFOCOM, 1999:1412-1420.
  • 7Bodin U, Schelen O, Pink S. Load tolerant differentiation with active queue management [C]. USA: SIGCOMM Computer Communication Review, 2000,30(3):4-19.
  • 8Floyd S, Gummadi R, Shenker S. Adaptive RED: An algorithm for increasing the robustness of RED'S active queue management [DB/OL] .http://www.icir.org/floyd/Papers adaptive RED. pdf.
  • 9Feng W, Kandlur D, Saha D. A self configuring RED gateway [J]. IEEE INFOCOM'99,1999,5(3): 1320-1328.
  • 10Floyd S. Recommendation on using the "gentle-"variant of RED [DB/OL]. http://www.acin.org/floyd/red/gentle.html.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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