Controlling chaos in Internet congestion control model

被引:33
作者
Chen, L [1 ]
Wang, XF [1 ]
Han, ZZ [1 ]
机构
[1] Shanghai Jiao Tong Univ, Sch Elect & Informat Technol & Elect Engn, Shanghai 200030, Peoples R China
基金
中国国家自然科学基金;
关键词
D O I
10.1016/j.chaos.2003.09.037
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The TCP end-to-end congestion control plus RED router queue management can be modeled as a discrete-time dynamical system, which may create complex bifurcating and chaotic behavior. Based on the basic features of the TCP-RED model, we propose a time-dependent delayed feedback control algorithm to control chaos in the system by perturbing the accessible RED parameter p(max). This method is able to stabilized a router queue occupancy at a level without knowing the exact knowledge of the network. Further, we study the situation of the presence of the UDP traffic. (C) 2003 Elsevier Ltd. All rights reserved.
引用
收藏
页码:81 / 91
页数:11
相关论文
共 22 条
[1]  
[Anonymous], 1988, ACM SIGCOMM COMPUTER
[2]   REM: Active queue management [J].
Athuraliya, S ;
Low, SH ;
Li, VH ;
Yin, QH .
IEEE NETWORK, 2001, 15 (03) :48-53
[3]   A control theoretic approach to active queue management [J].
Aweya, J ;
Ouellette, M ;
Montuno, DY .
COMPUTER NETWORKS, 2001, 36 (2-3) :203-235
[4]  
BRADEN B, 1998, IETF REQUESTS COMMEN, P2309
[5]  
Chen G., 1998, CHAOS ORDER PERSPECT
[6]  
Chen G., 1999, CONTROLLING CHAOS BI
[7]  
FIROIU V, 2000, P IEEE INF
[8]   A report on recent developments in TCP congestion control [J].
Floyd, S .
IEEE COMMUNICATIONS MAGAZINE, 2001, 39 (04) :84-90
[9]  
FLOYD S, 2000, ADAPTIVE RED ALGORIT
[10]  
FLOYD S, 1997, IEEE T NETWORKING, V1, P397