@ARTICLE{Brachman_Agnieszka_On_2011, author={Brachman, Agnieszka and Chrost, Łukasz}, volume={vol. 23}, number={No 1}, journal={Theoretical and Applied Informatics}, howpublished={online}, year={2011}, publisher={Committee of Informatics of Polish Academy of Science}, publisher={Institute of Theoretical and Applied Informatics of Polish Academy of Science}, abstract={The main idea of all Active Queue Management algorithms, is to notify the TCP sender about incoming congestion by dropping packets, to prevent from the buffer overflow, and its negative consequences. However, most AQM algorithms proposed so far, neglect the impact of the high speed and long delay links. As a result, the algorithms’ efficiency, in terms of throughput and/or queue stability, is usually significantly decreased. The contribution of this paper is twofold. First of all, the performance of the well known AQM algorithms in high speed and long delay scenarios is evaluated and compared. Secondly, a new AQM algorithm is proposed, to improve the throughput in the large delay scenarios and to exclude the usage of random number generator.}, type={Artykuły / Articles}, title={On the search of efficient AQM for large delay networks}, URL={http://journals.pan.pl/Content/93625/mainfile.pdf}, keywords={active queue management, large delay network, throughput}, }