DocumentCode :
261496
Title :
TCP-AQM Algorithms which combat the computer networks´ congestion
Author :
Stancescu, Stefan ; Luca, Adrian-Alexandru ; Caraivan, Alexandru
Author_Institution :
Fac. of Telecommun., Polytech. Univ. of Bucharest, Bucharest, Romania
fYear :
2014
fDate :
25-27 Nov. 2014
Firstpage :
182
Lastpage :
185
Abstract :
The best congestion control occurs on when TCP (Transmission Control Protocol) and AQM (Active Queue Management) algorithms work together. Most exploited AQM algorithm is RED (Random Early Detection) known under a set of flavors. RED only algorithms have performances depending on the proper setting of cache/queue parameters. As all RED algorithms depend on the average value of the tail and tend to react somehow late to events occurring in network, especially when congestion is inevitable, it should be developed a more aggressive alternative within an imminent congestion. We propose a modification of the function of probability of RED algorithm to a sigmoid form, in view to calculate the chance of throwing the package.
Keywords :
cache storage; computer networks; queueing theory; telecommunication congestion control; transport protocols; RED only algorithms; TCP-AQM algorithms; active queue management; cache-queue parameters; computer network congestion; congestion control; random early detection; transmission control protocol; Approximation algorithms; Approximation methods; Delays; Graphics; Probability; Robustness; Telecommunications; RED; TCP-AQM; congestion control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Telecommunications Forum Telfor (TELFOR), 2014 22nd
Conference_Location :
Belgrade
Print_ISBN :
978-1-4799-6190-0
Type :
conf
DOI :
10.1109/TELFOR.2014.7034385
Filename :
7034385
Link To Document :
بازگشت