|Table of Contents|

Lock-out and Chaos in TCP Congestion Control


Research Field:
Publishing date:


Lock-out and Chaos in TCP Congestion Control
JIANG Wen-gang12 SUN Jin-sheng1WANG Zhi-quan1
1. School of Automation,NUST,Nanjing 210094,China; 2. School of Electronics and Information, Jiangsu University of Science and Technology,Zhenjiang 212003,China
lock-out chaos congestion control congestion window logistic map
In order to study the phenomenon of lock-out and chaos in transmission control protocol ( TCP) congestion control, this paper presents a way of relieving the lock-out for TCP senders to avoid the unfairness of network transmission caused by lock-out. Analyzing the influence of their initial values on the state of logistic map, this paper proves that different initial values can change the state of chaotic systems. This evidence is used for analysing the TCP congestion control. Different initial values for network systems with determined parameters can cause periodic changes,chaos or instability, and lock-out is a kind of instability of network. Lock-out can be avoided by changing the initial values of the TCP senders. Simulations show that this method can effectively relieve lock-out,enable the network back to chaotic state,and improve the fairness of network transmission.


[1] Jacebson V. Congestion avoidance and control[J]. ACM Computer Communications Review,1988,18 ( 4) : 314-329.
[2] Kevin F,Floyd S. Simulation-based comparisons of tahoe, reno,and sack TCP[J]. ACM Computer Communication Review, 1996, 26( 3) : 5-21.
[3] Braden B,Clark D,Crowcroft J,et al. Recommendations on queue management and congestion avoidance in the internet[R]. New York,USA: IETF RFC 2309, 1998.
[4] Zheng Changyong,Dai Yuehua,Chen Junning. Is current active queue management really necessary [A]. Proceedings of the First International Workshop on Education Technology and Computer Science[C]. Wuhan,China: IEEE Computer Society,2009: 538 -541.
[5] Veres A,Boda M. The chaotic nature of TCP congestion control[A]. Proceedings of IEEE INFOCOM[C]. Tel Aviv,Israel: IEEE Computer Society,2000: 1715 -1723.
[6] William D,Toshinori M. Principles and applications of chaotic systems[J]. Communications of the ACM, 1995, 38( 11) : 96-102.
[7] Ranjan P,Abed E H. Bifurcation analysis of TCP-RED dynamics[A]. Proceedings of ACC[C]. Anchorage, USA: American Control Conference, 2002: 2443-2448.
[8] Ranjan P,Abed E H. Chaotic behavior in TCP-RED [A]. Proceedings of CDC[C]. Las Vegas,USA: The 41st IEEE Conference on Decision and Control, 2002: 540-542.
[9] Gao J,Rao N S V. TCP AIMD dynamics over internet connections[J]. IEEE Communication Letters, 2005,9 ( 1) : 4-6.
[10] Packard N H,Crutchfield J P,Farmer J D, et al. Geometry from a time series[J]. Physical Review Letters, 1980, 45( 9) : 712-716.
[11] 张雪锋,范九伦. 一种新的分段非线性混沌映射及 其性能分析[J]. 物理学报,2010,59 ( 4 ) : 2298 -2304.
[12] 陆锦军,王执铨. 基于内模补偿的网络拥塞控制新 算法: IC-AQM[J]. 南京理工大学学报,2006,30 ( 2) : 162-166.


Last Update: 2012-10-23