TCP Pegas: A PSO-based improvement over TCP Vegas

被引:4
作者
Jamali, Shahram [1 ]
Alipasandi, Neda [2 ]
Alipasandi, Bita [3 ]
机构
[1] Univ Mohaghegh, Dept Comp Engn, Ardebil, Iran
[2] Islamic Azad Univ, Ardabil Branch, Sama Tech & Vocat Training Coll, Ardebil, Iran
[3] Islamic Azad Univ, Ardabil Branch, Young Researchers & Elite Club, Ardebil, Iran
关键词
Congestion control; TCP Vegas; Particle swarm optimization; Rerouting; Fairness; CONGESTION AVOIDANCE MECHANISM; PERFORMANCE; PARTICLE; RENO;
D O I
10.1016/j.asoc.2015.03.048
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
TCP Vegas is a source algorithm that offers relatively rich performance in the Internet congestion control. But Vegas has some problems which have serious impacts on its performance. Rerouting is one of these problems. When route of a connection changes and round trip time increases, Vegas misinterprets it as the result of the network congestion and consequently decreases its own sending rate. As another important problem, when a flow joints to the network later than other flows and faces with congested queues, it wrongly considers the measured round trip time as its initial Base(RTT). It means that while other flows decrease their sending rates due to existing congestion, this flow does not sense the congestion and hence unfairly increases its sending rate. These problems mainly have roots in the Vegas estimation procedure of the propagation delay i.e. Base(RTT). In this paper we propose a novel algorithm, named Pegas, in which particle swarm optimization technique is used to dynamic estimation of Base(RTT). Simulation results show that Pegas solves the rerouting and unfairness problems and remarkably enhances Vegas performance in terms of dropped packets, bottleneck utilization, and fairness. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:164 / 174
页数:11
相关论文
共 43 条
[1]   Comparative study of high-speed Linux TCP variants over high-BDP networks [J].
Alrshah, Mohamed A. ;
Othman, Mohamed ;
Ali, Borhanuddin ;
Hanapi, Zurina Mohd .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2014, 43 :66-75
[2]  
[Anonymous], THESIS U PRETORIA
[3]  
Brakmo L. S., 1994, Computer Communication Review, V24, P24, DOI 10.1145/190809.190317
[4]   TCP VEGAS - END-TO-END CONGESTION AVOIDANCE ON A GLOBAL INTERNET [J].
BRAKMO, LS ;
PETERSON, LL .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1995, 13 (08) :1465-1480
[5]   On a fair congestion control scheme for TCP vegas [J].
Byun, HJ ;
Lim, JT .
IEEE COMMUNICATIONS LETTERS, 2005, 9 (02) :190-192
[6]   A Survey of Congestion Control Mechanisms in Linux TCP [J].
Callegari, Christian ;
Giordano, Stefano ;
Pagano, Michele ;
Pepe, Teresa .
DISTRIBUTED COMPUTER AND COMMUNICATION NETWORKS, 2014, 279 :28-42
[7]   Bandwidth estimation schemes for TCP over wireless networks [J].
Capone, A ;
Fratta, L ;
Martignon, F .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2004, 3 (02) :129-143
[8]   Performance improvement of congestion avoidance mechanism for TCP vegas [J].
Chan, YC ;
Chan, CT ;
Chen, YC ;
Ho, CY .
TENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 2004, :605-612
[9]   RoVegas: a router-based congestion avoidance mechanism for TCP Vegas [J].
Chan, YC ;
Chan, CT ;
Chen, YC .
COMPUTER COMMUNICATIONS, 2004, 27 (16) :1624-1636
[10]   CODE TCP: A competitive delay-based TCP [J].
Chan, Yi-Cheng ;
Lin, Chia-Liang ;
Chan, Chia-Tai ;
Ho, Cheng-Yuan .
COMPUTER COMMUNICATIONS, 2010, 33 (09) :1013-1029