Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/8047
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTahiliani, M.P.-
dc.contributor.authorShet, K.C.-
dc.contributor.authorBasavaraju, T.G.-
dc.date.accessioned2020-03-30T10:18:02Z-
dc.date.available2020-03-30T10:18:02Z-
dc.date.issued2012-
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, Vol.7135 LNCS, , pp.435-443en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/8047-
dc.description.abstractRandom Early Detection (RED) is a widely deployed active queue management mechanism to improve the performance of the network in terms of throughput and packet drop rate. The effectiveness of RED, however, highly depends on appropriate setting of its parameters. In this paper, we propose a Fast Adapting Random Early Detection (FARED) algorithm which efficiently varies the maximum drop probability to improve the overall performance of the network. Based on extensive simulations, we show that FARED algorithm reduces the packet drop rate and achieves better throughput than Adaptive RED (ARED) and Refined Adaptive RED (Re-ARED). Moreover, FARED algorithm does not introduce new parameters to improve the performance and hence can be deployed without any additional complexity. � 2012 Springer-Verlag.en_US
dc.titleFARED: Fast adapting RED gateways for TCP/IP networksen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
File Description SizeFormat 
8047.pdf86.62 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.