期刊文献+

一种自适应的FRED缓存管理算法 被引量:1

An adaptive FRED buffer management scheme
下载PDF
导出
摘要 如何保证业务流的公平性,特别是在存在UDP业务流的情况下,有效地保护TCP流一直是一个热点研究课题。本文提出了一种自适应的FRED缓存管理算法AFRED,通过动态的调节分组丢弃的门限,保护了TCP流,提高了系统的公平性,同时保证了带宽利用的有效性。算法的复杂度与FRED相近,但是能获得更好地性能。 Providing flow fairness, in particular, protecting adaptive TCP flows in the presence of non-adaptive UDP flows is a hot topic in recent years. In this paper, an adaptive fair queue management algorithm (modified version of FRED) is proposed. By dynamically varying the threshold of each flow that could be allowed into the buffer and the drop probability, AFRED is made adaptive and can achieve high fairness and efficiency. Implementation complexity of AFRED is comparable to FRED, but its performance is better than FRED.
出处 《电路与系统学报》 CSCD 北大核心 2008年第1期12-17,共6页 Journal of Circuits and Systems
关键词 RED FRED 缓存管理 RED FRED buffer management
  • 相关文献

参考文献7

  • 1HANDLEY M, PADHYE J, FLOYD S, et al. TCP friendly rate control (TFRC): protocol specification. IETF Internet-Draft [EB/OL]. http://www.ietf.org/2001.
  • 2FLOYD S, FALL K, TIEU K. Estimating arrival rates from the red packet drop history [EB/OL]. http://www.aciri.org/floyd/ end2endpaper.html.
  • 3温蜀山,李乐民,孙海荣.Internet中分组丢弃缓存管理技术的研究[J].通信学报,2002,23(7):98-106. 被引量:3
  • 4PADHYE J, FIROIU V, TOWSLEY D F, KUROSE J F. Modeling TCP Reno performance: a simple model and its empirical validation [J]. IEEE/ACM Transactions on Networking, 2000, 8(2): 133-145.
  • 5LIN D, MORRIS R. Dynamics of random early detection [A]. ACM SIGCOMM 97 [C]. Cannes: 1997. 127-137.
  • 6ANJUM F, TASSIULAS L. Comparative study of various TCP versions over a wireless link with correlated losses [J]. IEEE/ACM Transactians an Netwarking, 2003, 11(3): 370-383.
  • 7CNODDER S, ELLOUMI O, PAUWELS K. Effect of different packet sizes on RED performance [EB/OL]. http://www.aciri.org/floyd/red/Elloumi99.pdf/1999

二级参考文献25

  • 1[1]BRADEN B,CLARK D,CROWCROFT J, et al. RFC (Request For Comment) 2309. Recommendations on queue management and congestion avoidance in the Internet[EB/OL]. http://www.ietf.org/1998.
  • 2[2]FLOYD S, FALL K. Promoting the use of end-to-end congestion control in the Internet[J]. IEEE/ACM Tran on Networking, 1999, 7(4):458-472.
  • 3[3]FLOYD S. RED with drop from front[EB/OL]. ftp://ftp.ee.lbl.gov/email/sf.98mar11.txt/1998.
  • 4[4]LBNL network research group. NS: network simulator[EB/OL]. http://www.isi.edu/nsnam/ns/1999.
  • 5[5]LAKSHMAN T V, NEIDHARDT A, OTT T. The drop from front strategy in TCP over ATM and its interworking with other control features[A]. IEEE INFOCOM 96[C].San Francisco: 1996. 1242-1250.
  • 6[6]FLOYD S, JACOBSON V. On traffic phase effects in packet-switched gateways[J]. Internetworking: Research and Experience, 1992, 3(3): 115-156.
  • 7[7]GAYNOR M. Proactive packet dropping methods for TCP gateways[EB/OL]. http://www.eecs.harvard.edu/~gaynor/final.ps/ 1996.
  • 8[8]FLOYD S, JACOBSON V. Random early detection gateways for congestion avoidance[J]. IEEE/ACM Trans on Networking, 1993, 1(4): 397-413.
  • 9[9]FLOYD S. Recommendation on using the "gentle" variant of RED[EB/OL]. http://www.aciri.org/floyd/red/gentle.html, 2000.
  • 10[10]FENG W, KANDLUR D, SAHA D, et al. A self-configuring RED gateway[A]. IEEE INFOCOM 99[C]. New York: 1999. 1320-1328.

共引文献2

同被引文献1

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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