网络拥塞控制及RED算法改进策略研究
|
摘要
随着互联网规模和高速网络中多媒体应用的发展，人们对网络服务质量(QoS)的需求越来越高，不但对网络有很高的带宽要求，而且要求信息传输的低延迟和低抖动等，需要提供端到端的QoS控制和保证。而网络拥塞是影响网络服务质量的重要因素，实施拥塞控制也是其它QoS机制正常工作的必要前提。因此，如何避免拥塞、如何进行拥塞控制保证QoS是当前的研究热点。
主动式队列管理机制(AQM)是IETF推荐的基于路由器拥塞控制的关键技术，它和TCP端到端的拥塞控制相结合，是解决目前Internet拥塞控制问题的一个主要途径。AQM通过评估网络状态、预测拥塞的出现，对分组进行有目的的丢弃，从而可以使发送端更及时地了解到网络状况并调整发送速率。RED(RandomEarly Detection)算法就是AQM的一个典型代表，但是现有算法在响应速度、稳定性及环境敏感性等方面仍有缺陷。对此，本文通过对的RED算法进行详细分析的基础上，总结出已有算法的优势和不足，提出了一种新的AQM算法——CARED(Cauchy Adaptive RED)算法。
CARED算法对原有RED算法的分组丢弃概率Pb的计算方法和参数Pmax的取值进行修改。其一：利用模糊理论中的升半哥西分布的隶属函数代替原来的线性增加分组丢弃概率的函数。CARED分组丢弃概率计算采用升半哥西分布函数，以平均队列长度为样本来获得，将控制范围扩展为最小阈值到最大缓冲之间，实现了分组丢弃概率变化的平滑化，保证在每一阶段系统都能迅速地对拥塞作出反应。
其二：CARED通过计算出路由器队列单位时间间隔内的平均队列长度，分别与最大阈值或最小阈值的比较，根据二者差值的大小动态地调整Pmax的大小，调整向源端发送拥塞通知的速率，维持队列长度的稳定，避免不必要的传输延时和抖动。并且Pmax的值不是每个时间间隔都更新，而只有当连续两个时间间隔内Status都处于相同状态，那么就可以更精确的认为缓冲队列中负载过大或过小，算法就会动态增加或减少Pmax的值，这样避免了Pmax的改变过于频繁，从而提高了链路的利用率。
其三：CARED算法的健壮性来自它对Pmax的规律性调整，如果大量突发数据包导致网络拥塞程度发生急剧变化，则Pmax则需要过一段时间甚至10秒或20秒才能适应。为了保证算法在这段时间里性能不会过度下降，本文将Pmax的范围限制在[0.01，0.5]之间，这样，即使这段时间内平均队列长度Qav不在目标范围内，平均延时和吞吐量也不会下降太多，使算法虽然在理论使不能得到最优，但其性能可得到保证。
在NS2网络仿真器上对算法进行了验证，一系列仿真实验表明，CARED能够有效地适应网络流量的变化，保持队列长度的稳定，减少了队列溢出和空闲现象的发生，在保持队列长度稳定以及提高链路利用率方面明显优于RED算法。
With the unceasing development of Internet scale > people have an ever-growing demand for the quality of service of computer networks (QoS). And nowadays, in the high-speed network multimedia's application not only has the very high bandwidth requirement to the network, but also requires intelligence transmission low delay and the low vibration and so on, needs to provide the end_to_end control and guarantee of QoS. The network congestion is a great factor to affect the network quality of service , so the implementation congestion control is prerequisite for other QoS mechanism normal work .At present, congestion control mechanism of Internet and quality of service are the central issues of the current research.
The active queue management mechanism( AQM) is, which the IETF recommends, the essential technology based on the router congestion control, which combines with the TCP end-to-end congestion control , being a main method to solve the congestion control question of the present Internet .By evaluation the state of network and foretelling the appearance of the congestion, AQM can drop the packet purposefully so that the sending end can be informed of the state of network and then adjust it's sending rate. But the current algorithms aren't still perfect in terms of response's time, stability and sensitivity to the environment and so forth. In this paper, the advantages and disadvantages of the existent algorithms are concluded based on analysing the current prevalent congestion control algorithms RED in detail, an improved algorithm CARED of active queue management (AQM) is proposed.
As a result, CARED algorithm has made the modifications of original RED algorithm in the computational method of probability of packet drop -P_b and the adapting of the parameter -P_(max). First, based on the fuzzy math, instead of the probability function of drop, we use the membership function of ascend demi-cauchy distribution. Original RED algorithm based on the average queue size of the buffer to adjust probability of drop, and when the average queue size reaches the Q_(max)(denoted by Q_(max)), the dropping rate increases linearly from P_(max) to 1. This jump will aggravate the jitter of buffer queue. CARED improve probability calculation used a ascend half-cauchy distribution function, to extend the scope of control from the minimum threshold to the buffersize. It can also achieve the smoothness from part to complete marking or discarding. Second : CARED calculates the average queue length in the router unit- time-gap, and by comparing it with the maximum value and the minimum value, the interpolation can be obtained. Based on the interpolation's size, CARED can adjust dynamically the size of P_(max), and therefore adjust the sending rate of congestion notification to the source end in time and maintain the stability of the queue length, in order to avoid the unnecessary delay of transmission and vibration .
The algorithm is verified in NS2 network simulation machine as well. By the indication of a series of simulation experiments, CARED can validly adapt the change of network flow effectively, hold stability of queue length , reduce phenomenon occurrence of the queue overflow or the idle greatly. And It is superior to the RED algorithm in maintaining the stability of queue length and enhancing the utilization ratio of the links.
主动式队列管理机制(AQM)是IETF推荐的基于路由器拥塞控制的关键技术，它和TCP端到端的拥塞控制相结合，是解决目前Internet拥塞控制问题的一个主要途径。AQM通过评估网络状态、预测拥塞的出现，对分组进行有目的的丢弃，从而可以使发送端更及时地了解到网络状况并调整发送速率。RED(RandomEarly Detection)算法就是AQM的一个典型代表，但是现有算法在响应速度、稳定性及环境敏感性等方面仍有缺陷。对此，本文通过对的RED算法进行详细分析的基础上，总结出已有算法的优势和不足，提出了一种新的AQM算法——CARED(Cauchy Adaptive RED)算法。
CARED算法对原有RED算法的分组丢弃概率Pb的计算方法和参数Pmax的取值进行修改。其一：利用模糊理论中的升半哥西分布的隶属函数代替原来的线性增加分组丢弃概率的函数。CARED分组丢弃概率计算采用升半哥西分布函数，以平均队列长度为样本来获得，将控制范围扩展为最小阈值到最大缓冲之间，实现了分组丢弃概率变化的平滑化，保证在每一阶段系统都能迅速地对拥塞作出反应。
其二：CARED通过计算出路由器队列单位时间间隔内的平均队列长度，分别与最大阈值或最小阈值的比较，根据二者差值的大小动态地调整Pmax的大小，调整向源端发送拥塞通知的速率，维持队列长度的稳定，避免不必要的传输延时和抖动。并且Pmax的值不是每个时间间隔都更新，而只有当连续两个时间间隔内Status都处于相同状态，那么就可以更精确的认为缓冲队列中负载过大或过小，算法就会动态增加或减少Pmax的值，这样避免了Pmax的改变过于频繁，从而提高了链路的利用率。
其三：CARED算法的健壮性来自它对Pmax的规律性调整，如果大量突发数据包导致网络拥塞程度发生急剧变化，则Pmax则需要过一段时间甚至10秒或20秒才能适应。为了保证算法在这段时间里性能不会过度下降，本文将Pmax的范围限制在[0.01，0.5]之间，这样，即使这段时间内平均队列长度Qav不在目标范围内，平均延时和吞吐量也不会下降太多，使算法虽然在理论使不能得到最优，但其性能可得到保证。
在NS2网络仿真器上对算法进行了验证，一系列仿真实验表明，CARED能够有效地适应网络流量的变化，保持队列长度的稳定，减少了队列溢出和空闲现象的发生，在保持队列长度稳定以及提高链路利用率方面明显优于RED算法。
With the unceasing development of Internet scale > people have an ever-growing demand for the quality of service of computer networks (QoS). And nowadays, in the high-speed network multimedia's application not only has the very high bandwidth requirement to the network, but also requires intelligence transmission low delay and the low vibration and so on, needs to provide the end_to_end control and guarantee of QoS. The network congestion is a great factor to affect the network quality of service , so the implementation congestion control is prerequisite for other QoS mechanism normal work .At present, congestion control mechanism of Internet and quality of service are the central issues of the current research.
The active queue management mechanism( AQM) is, which the IETF recommends, the essential technology based on the router congestion control, which combines with the TCP end-to-end congestion control , being a main method to solve the congestion control question of the present Internet .By evaluation the state of network and foretelling the appearance of the congestion, AQM can drop the packet purposefully so that the sending end can be informed of the state of network and then adjust it's sending rate. But the current algorithms aren't still perfect in terms of response's time, stability and sensitivity to the environment and so forth. In this paper, the advantages and disadvantages of the existent algorithms are concluded based on analysing the current prevalent congestion control algorithms RED in detail, an improved algorithm CARED of active queue management (AQM) is proposed.
As a result, CARED algorithm has made the modifications of original RED algorithm in the computational method of probability of packet drop -P_b and the adapting of the parameter -P_(max). First, based on the fuzzy math, instead of the probability function of drop, we use the membership function of ascend demi-cauchy distribution. Original RED algorithm based on the average queue size of the buffer to adjust probability of drop, and when the average queue size reaches the Q_(max)(denoted by Q_(max)), the dropping rate increases linearly from P_(max) to 1. This jump will aggravate the jitter of buffer queue. CARED improve probability calculation used a ascend half-cauchy distribution function, to extend the scope of control from the minimum threshold to the buffersize. It can also achieve the smoothness from part to complete marking or discarding. Second : CARED calculates the average queue length in the router unit- time-gap, and by comparing it with the maximum value and the minimum value, the interpolation can be obtained. Based on the interpolation's size, CARED can adjust dynamically the size of P_(max), and therefore adjust the sending rate of congestion notification to the source end in time and maintain the stability of the queue length, in order to avoid the unnecessary delay of transmission and vibration .
The algorithm is verified in NS2 network simulation machine as well. By the indication of a series of simulation experiments, CARED can validly adapt the change of network flow effectively, hold stability of queue length , reduce phenomenon occurrence of the queue overflow or the idle greatly. And It is superior to the RED algorithm in maintaining the stability of queue length and enhancing the utilization ratio of the links.
引文
[1] 林闯．多媒体信息网络QoS的控制．软件学报，1999，10(10)：1016-1024．
[2] 章淼，吴建平，林闯．互联网端到端拥塞控制研究综述，软件学报，2002，13(3)：354-363
[3] Van Jacobson, Michael J. Karels..Congestion Avoidance and Control. ACM Computer Communication Review, 1988, 18(4):314-329
[4] Jain, R.Congestion Control in computer networks:issues and trends.IEEE Network Magazine, 1990, 4(3):24-30
[5] Shenker, S.Fundamental design issues for the future Internet.IEEE Journal on Selected Areas in Communications, 1995, 13(7):1176-1188
[6] Braden, B., Clark, D., Crowcroft, J., et al.Recommendations on Queue Management and Congestion Avoidance in the Internet.RFC 2309, 1998
[7] Crawley E, Nair R, Rajagopalan B, Sandick H.A framework for QoS-based routing in the internet. IETF Internet RFC 2386, 1998
[8] Brakmo, L., Peterson L.TCP vegas:end-to-end congestion avoidance on a global Internet.IEEE Journal on Selected Areas in Communication, 1995, 13(8):1465-1480
[9] Floyd S.The addition of explicit congestion notification(ECN)to IP. 1996, http://www.aciri.org/floyd/papers.html
[10] Nagle, J.On packet switches with infinite storage.IEEE Transactions On Communications, 1987, 35(4):435-438
[11] Sally Floyd, Ramakrishna Gummadi, and Scott Shenker.Adaptive RED: An A lgorithm for Increasing the Robustness of RED's Active Queue Management.http//www.cs.berkeley.edu
[12] Hashem, E.Analysis of random drop for gateway congestion control.Report MIT/LCS/TR-465, Laboratory for Computer Science, 1989
[13] Anjum F, Tassiulas L.Balanced-RED:An algorithm to achieve fairness in Internet.In:IEEE INFOCOM'99.New York, USA, 1999
[14] Kunniyur S, Srikant R.A time-scale decomposition approach to adaptive ECN marking.In:Proceedings of the INFOCOMM 2001.Alaska:IEEE Computer Society, 2001
[15] Kunniyur S, Srikant R.Analysis and design of an adaptive queue(AVQ) algorithm for active queue management.In: ACM SIGCOMM 2001.San Diego, 2001
[16] Braden R, Clark D, Shenker S. Integrated Services in the Internet Architecture: An Overview. IETF Internet RFC 1633, 1994
[17] Braden R, Zhang L, Berson S, et al. Resource Reservation Protocol (RSVP) Version 1 Functional Specification. IETF Internet RFC 2205, 1997
[18] Blake S, Black D, Carlson M, et al. An Architecture for Differentiated Services.IETF Internet RFC 2475, 1998
[19] Bernet Y. A Framework for Differentiated Services. http://www.ietf.org/proceedings/99jul/I-D/draft-ieff-diffserv-framework-02.txt, 1998
[20] S Brim, B Carpenter and F Le Faucheur. Per hop behavior identification codes.IETF Internet RFC 2836, 2000
[21] Shenker S, Wroclawski J. Network element service specification template. IETF Internet RFC 2216, 1997
[22] Shenker S, Wroclawski J. General characterization parameters for integrated service network elements. IETF Intemet RFC 2215, 1997
[23] 林闯，单志广，盛立杰，吴建平．Internet区分服务及其几个热点问题的研究．计算机学报，2000，23(4)：419-431
[24] Braden R, Clark D, Shenker S. Integrated Services in the Internet Architecture: An Overview. IETF Internet RFC 1633, 1994
[25] J Heinanen, F Baker, W Weiss, J Wroclawski. Assured Forwarding PHB Group. IETF Internet RFC 2597, 1999
[26] 陈彦萍，李增智，宋承谦等．基于IntServ和DiffServ的端到端QoS研究[J]．微电子学与计算机，2003，11：24-26
[27] Shenker S, Partridge C, Guerin R.Specification of guaranteed quality of service. IETF RFC 2212, September 1997
[28] Wroclawski J. Specification of the controlled-load network element service. IETF RFC 2212, September 1997
[29] Grossman D. New technology for DiffServ. IETF Internet, October 1999.
[30] Sally Floyd. TCP and explicit congestion notification. ACM Computer Communications Review, 1994.24 (5):10-23
[31] Jacobson V, Nichols K and K Poduri. An Expedited Forwarding PHB. IETF Internet RFC 2598, 1999
[32] Nichols K, Blake S, Baker F, et al. Definition of the differentiated services field (DS field) in the IPv4 and IPv6 header. IETF Internet RFC 2474, 1998
[33] Ramakrishan K, Floyd S. A proposal to add explicit congestion notification(ECN) to IP. IETF Internet RFC 2481, January 1999
[34] Sally Floyd. TCP and explicit congestion notification. ACM Computer Communications Review, 1994.24 (5):10～23
[35] S Brim, B Carpenter and F Le Faucheur. Per hop behavior identification codes.IETF Internet RFC 2836, 2000
[36] 罗万明，林闯，阎保平．TCP／IP拥塞控制研究，计算机学报，Vol．24，No．1，1-18，2001
[37] 任丰原，林闯，刘卫东．IP网络中的拥塞控制[J]．计算机学报，2003，29(9)：1025-1034
[38] Panos Gevros, Jon Crowcraft, Peter Kirstein, and Saleem Bhatti, Congestion Control mechanisms ant the best effort service model, IEEE Network, 16-26, May 2001
[39] S. Savage et al., TCP Congestion Control with a Misbehaving Receiver. ACM Comp.Commun. Rev. 1999, vol (29): 71-78
[40] S. Floyd, K. Fall, Promoting the use of end-to-end congestion control in the Internet, IEEE/ACM Transactions Networking 7 (4), 458-472, 1999
[41] Floyd, 5., Jacobson, V.On traffic phase effects in packet-switched gateways.Internetworking:Research and Experience, 1992, 3 (3): 115-156
[42] Raj Jain, K.K.Ramakrishnam, Dah-Ming Chiu.Congestion Avoidance in Computer Networks with a connectionless Network Layer.DEC-TR-506, 1998
[43] Larry l.Peterson and Bruce S.Davie.Computer Networks:A System Approach.Morgan Kaufmann Publishers, 2000
[44] M.Jaffe.Bottleneck Flow Control.IEEE Transactions on Communication, Vol.29, no.7, July 1981, pp:954-62
[45] R. Jain, A. Durresi, G. Babic. Throughput Fairness Index: An Explanation, ATM Forurm/99-0045
[46] F. P. Kelly. Charging and Rate Control for Elastic Traffic. Euro. Trans. Telecommun., vol. 8, 33-37, 1997
[47] Floyd, S., Jacobson, V.Random early detection gateways for congestion avoidance.IEEE/ACM Transactions on Networking, 1993, 1(4):397-413
[48] Floyd, S.A report on some recent developments in TCP congestion control.IEEE Communication.Magazine, April 2001
[49] Floyd S.Recommendation on using the "gentle_" variant of RED algorithm.http://www.aciri.org/floyd/red/gentle.html
[50] M.Mathis AND J.Semke and J.Mahdavi and T.ott.The macroscopic behavior of the TCP congestion avoidance.IEEE/ACM Computer Communication Review, 1997, 27(3)
[51] Hollot C, Misra V, Towsley D, Shin K.Blue:Anew class of active queue management algorithm. In:IEEE INFOCOM 2001.Anchorage, Alaska, 2001.1726-1734
[52] 计算机网络的服务质量(QoS)／林闯，单志广，任丰原．--北京：清华大学出版社，2004，ISBN 7-302-08076-3
[53] Hutchison D, Coulsom G, Campbell A, et al. Quality of service management in distributed systems. In:Sloman M, ed. Network and Distributed SystemsManagement. Chapter 11. Addison Wesley, 1994
[54] Teunis J Qu.T V Lakshman.Lang Wong. SRED:Stabilized RED[C].In:Proc IEEE Infocom99.1999-03
[55] 李仁发，莫铁强，刘钰锋等．随机早期诊断(RED)队列管理算法的改进研究[J]．小型微型计算机系统，2003，24(3)：491-494
[56] 姜明，吴春明，朱淼良．确保服务中一种基于动态阈值的数据包标记算法[J]．计算机研究与发展，2004，41(1)：83-91
[57] 文宏，朱培栋，唐玉华．基于网络拥塞控制的主动队列管理算法研究[J]．计算机工程与应用，2005，41(9)：144-146
[58] 曲延光，刘云超．Internet主动队列管理算法研究．[J]．计算机应用，2003，23(10)
[59] 李方敏，李仁发，欧青立．路由队列管理机制[J]．计算机工程，2001，27(8)：29-32
[60] 姜宁康，李毓麟．NS网络仿真技术及其应用分析[J]．小型微型计算机系统，2002，22(4)：415-417
[61] 金烨，樊隽．NS中数据流传输处理机制分析及流分析器的实现[J]．计算机工程与应用，2003(22)：153-155
[62] 石志强，吴志美，梁进．基于参数估计的随机早期探测改进算法[J]．电子学报，2000，28(11)：88-91
[63] 张顺亮，叶澄清，李方敏．一种加强的主动队列管理算法——EBLUE[J]．通信学报，2003，24(11)：109-115
[64] 尹逊和，任丰原，任勇等．鲁棒的主动队列管理新算法[J]．计算机学报，2002，25(10)：1018-1023
[65] 严云洋，冯径．TCP拥塞控制的实现与改进[J]．计算机应用研究，1999，1：35-36
[66] 闫友彪，陈元琰，罗晓曙等．Internet拥塞控制研究的最新进展分析与展望[J]．计算机应用研究，2005，2：9-13
[67] 杨湘，陈建二，王建新．QoS体系中的主动队列管理算法研究综述[J]．现代电子技术，2005，15：47-49
[68] 李鹏，安建平，钟曼莉．提供IP QoS保障的区分服务系统模型及算法[J]．计算机工程与应用，2003，5：164-168
[2] 章淼，吴建平，林闯．互联网端到端拥塞控制研究综述，软件学报，2002，13(3)：354-363
[3] Van Jacobson, Michael J. Karels..Congestion Avoidance and Control. ACM Computer Communication Review, 1988, 18(4):314-329
[4] Jain, R.Congestion Control in computer networks:issues and trends.IEEE Network Magazine, 1990, 4(3):24-30
[5] Shenker, S.Fundamental design issues for the future Internet.IEEE Journal on Selected Areas in Communications, 1995, 13(7):1176-1188
[6] Braden, B., Clark, D., Crowcroft, J., et al.Recommendations on Queue Management and Congestion Avoidance in the Internet.RFC 2309, 1998
[7] Crawley E, Nair R, Rajagopalan B, Sandick H.A framework for QoS-based routing in the internet. IETF Internet RFC 2386, 1998
[8] Brakmo, L., Peterson L.TCP vegas:end-to-end congestion avoidance on a global Internet.IEEE Journal on Selected Areas in Communication, 1995, 13(8):1465-1480
[9] Floyd S.The addition of explicit congestion notification(ECN)to IP. 1996, http://www.aciri.org/floyd/papers.html
[10] Nagle, J.On packet switches with infinite storage.IEEE Transactions On Communications, 1987, 35(4):435-438
[11] Sally Floyd, Ramakrishna Gummadi, and Scott Shenker.Adaptive RED: An A lgorithm for Increasing the Robustness of RED's Active Queue Management.http//www.cs.berkeley.edu
[12] Hashem, E.Analysis of random drop for gateway congestion control.Report MIT/LCS/TR-465, Laboratory for Computer Science, 1989
[13] Anjum F, Tassiulas L.Balanced-RED:An algorithm to achieve fairness in Internet.In:IEEE INFOCOM'99.New York, USA, 1999
[14] Kunniyur S, Srikant R.A time-scale decomposition approach to adaptive ECN marking.In:Proceedings of the INFOCOMM 2001.Alaska:IEEE Computer Society, 2001
[15] Kunniyur S, Srikant R.Analysis and design of an adaptive queue(AVQ) algorithm for active queue management.In: ACM SIGCOMM 2001.San Diego, 2001
[16] Braden R, Clark D, Shenker S. Integrated Services in the Internet Architecture: An Overview. IETF Internet RFC 1633, 1994
[17] Braden R, Zhang L, Berson S, et al. Resource Reservation Protocol (RSVP) Version 1 Functional Specification. IETF Internet RFC 2205, 1997
[18] Blake S, Black D, Carlson M, et al. An Architecture for Differentiated Services.IETF Internet RFC 2475, 1998
[19] Bernet Y. A Framework for Differentiated Services. http://www.ietf.org/proceedings/99jul/I-D/draft-ieff-diffserv-framework-02.txt, 1998
[20] S Brim, B Carpenter and F Le Faucheur. Per hop behavior identification codes.IETF Internet RFC 2836, 2000
[21] Shenker S, Wroclawski J. Network element service specification template. IETF Internet RFC 2216, 1997
[22] Shenker S, Wroclawski J. General characterization parameters for integrated service network elements. IETF Intemet RFC 2215, 1997
[23] 林闯，单志广，盛立杰，吴建平．Internet区分服务及其几个热点问题的研究．计算机学报，2000，23(4)：419-431
[24] Braden R, Clark D, Shenker S. Integrated Services in the Internet Architecture: An Overview. IETF Internet RFC 1633, 1994
[25] J Heinanen, F Baker, W Weiss, J Wroclawski. Assured Forwarding PHB Group. IETF Internet RFC 2597, 1999
[26] 陈彦萍，李增智，宋承谦等．基于IntServ和DiffServ的端到端QoS研究[J]．微电子学与计算机，2003，11：24-26
[27] Shenker S, Partridge C, Guerin R.Specification of guaranteed quality of service. IETF RFC 2212, September 1997
[28] Wroclawski J. Specification of the controlled-load network element service. IETF RFC 2212, September 1997
[29] Grossman D. New technology for DiffServ. IETF Internet, October 1999.
[30] Sally Floyd. TCP and explicit congestion notification. ACM Computer Communications Review, 1994.24 (5):10-23
[31] Jacobson V, Nichols K and K Poduri. An Expedited Forwarding PHB. IETF Internet RFC 2598, 1999
[32] Nichols K, Blake S, Baker F, et al. Definition of the differentiated services field (DS field) in the IPv4 and IPv6 header. IETF Internet RFC 2474, 1998
[33] Ramakrishan K, Floyd S. A proposal to add explicit congestion notification(ECN) to IP. IETF Internet RFC 2481, January 1999
[34] Sally Floyd. TCP and explicit congestion notification. ACM Computer Communications Review, 1994.24 (5):10～23
[35] S Brim, B Carpenter and F Le Faucheur. Per hop behavior identification codes.IETF Internet RFC 2836, 2000
[36] 罗万明，林闯，阎保平．TCP／IP拥塞控制研究，计算机学报，Vol．24，No．1，1-18，2001
[37] 任丰原，林闯，刘卫东．IP网络中的拥塞控制[J]．计算机学报，2003，29(9)：1025-1034
[38] Panos Gevros, Jon Crowcraft, Peter Kirstein, and Saleem Bhatti, Congestion Control mechanisms ant the best effort service model, IEEE Network, 16-26, May 2001
[39] S. Savage et al., TCP Congestion Control with a Misbehaving Receiver. ACM Comp.Commun. Rev. 1999, vol (29): 71-78
[40] S. Floyd, K. Fall, Promoting the use of end-to-end congestion control in the Internet, IEEE/ACM Transactions Networking 7 (4), 458-472, 1999
[41] Floyd, 5., Jacobson, V.On traffic phase effects in packet-switched gateways.Internetworking:Research and Experience, 1992, 3 (3): 115-156
[42] Raj Jain, K.K.Ramakrishnam, Dah-Ming Chiu.Congestion Avoidance in Computer Networks with a connectionless Network Layer.DEC-TR-506, 1998
[43] Larry l.Peterson and Bruce S.Davie.Computer Networks:A System Approach.Morgan Kaufmann Publishers, 2000
[44] M.Jaffe.Bottleneck Flow Control.IEEE Transactions on Communication, Vol.29, no.7, July 1981, pp:954-62
[45] R. Jain, A. Durresi, G. Babic. Throughput Fairness Index: An Explanation, ATM Forurm/99-0045
[46] F. P. Kelly. Charging and Rate Control for Elastic Traffic. Euro. Trans. Telecommun., vol. 8, 33-37, 1997
[47] Floyd, S., Jacobson, V.Random early detection gateways for congestion avoidance.IEEE/ACM Transactions on Networking, 1993, 1(4):397-413
[48] Floyd, S.A report on some recent developments in TCP congestion control.IEEE Communication.Magazine, April 2001
[49] Floyd S.Recommendation on using the "gentle_" variant of RED algorithm.http://www.aciri.org/floyd/red/gentle.html
[50] M.Mathis AND J.Semke and J.Mahdavi and T.ott.The macroscopic behavior of the TCP congestion avoidance.IEEE/ACM Computer Communication Review, 1997, 27(3)
[51] Hollot C, Misra V, Towsley D, Shin K.Blue:Anew class of active queue management algorithm. In:IEEE INFOCOM 2001.Anchorage, Alaska, 2001.1726-1734
[52] 计算机网络的服务质量(QoS)／林闯，单志广，任丰原．--北京：清华大学出版社，2004，ISBN 7-302-08076-3
[53] Hutchison D, Coulsom G, Campbell A, et al. Quality of service management in distributed systems. In:Sloman M, ed. Network and Distributed SystemsManagement. Chapter 11. Addison Wesley, 1994
[54] Teunis J Qu.T V Lakshman.Lang Wong. SRED:Stabilized RED[C].In:Proc IEEE Infocom99.1999-03
[55] 李仁发，莫铁强，刘钰锋等．随机早期诊断(RED)队列管理算法的改进研究[J]．小型微型计算机系统，2003，24(3)：491-494
[56] 姜明，吴春明，朱淼良．确保服务中一种基于动态阈值的数据包标记算法[J]．计算机研究与发展，2004，41(1)：83-91
[57] 文宏，朱培栋，唐玉华．基于网络拥塞控制的主动队列管理算法研究[J]．计算机工程与应用，2005，41(9)：144-146
[58] 曲延光，刘云超．Internet主动队列管理算法研究．[J]．计算机应用，2003，23(10)
[59] 李方敏，李仁发，欧青立．路由队列管理机制[J]．计算机工程，2001，27(8)：29-32
[60] 姜宁康，李毓麟．NS网络仿真技术及其应用分析[J]．小型微型计算机系统，2002，22(4)：415-417
[61] 金烨，樊隽．NS中数据流传输处理机制分析及流分析器的实现[J]．计算机工程与应用，2003(22)：153-155
[62] 石志强，吴志美，梁进．基于参数估计的随机早期探测改进算法[J]．电子学报，2000，28(11)：88-91
[63] 张顺亮，叶澄清，李方敏．一种加强的主动队列管理算法——EBLUE[J]．通信学报，2003，24(11)：109-115
[64] 尹逊和，任丰原，任勇等．鲁棒的主动队列管理新算法[J]．计算机学报，2002，25(10)：1018-1023
[65] 严云洋，冯径．TCP拥塞控制的实现与改进[J]．计算机应用研究，1999，1：35-36
[66] 闫友彪，陈元琰，罗晓曙等．Internet拥塞控制研究的最新进展分析与展望[J]．计算机应用研究，2005，2：9-13
[67] 杨湘，陈建二，王建新．QoS体系中的主动队列管理算法研究综述[J]．现代电子技术，2005，15：47-49
[68] 李鹏，安建平，钟曼莉．提供IP QoS保障的区分服务系统模型及算法[J]．计算机工程与应用，2003，5：164-168