Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/10150
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTahiliani, M.P.-
dc.contributor.authorShet, K.C.-
dc.contributor.authorBasavaraju, T.G.-
dc.date.accessioned2020-03-31T08:18:39Z-
dc.date.available2020-03-31T08:18:39Z-
dc.date.issued2012-
dc.identifier.citationJournal of Network and Computer Applications, 2012, Vol.35, 2, pp.857-864en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/10150-
dc.description.abstractRandom Early Detection (RED) is a widely deployed active queue management algorithm that improves the overall performance of the network in terms of throughput and delay. The effectiveness of RED algorithm, however, highly depends on appropriate setting of its parameters. Moreover, the performance of RED is quite sensitive to abrupt changes in the traffic load. In this paper, we propose a Cautious Adaptive Random Early Detection (CARED) algorithm that dynamically varies maximum drop probability based on the level of traffic load to improve the overall performance of the network. Based on extensive simulations conducted using Network Simulator-2 (ns-2), we show that CARED algorithm reduces the packet drop rate and achieves high throughput as compared to RED, Adaptive RED and Refined Adaptive RED. Unlike other RED based algorithms, CARED algorithm does not introduce new parameters to achieve performance gain and hence can be deployed without any additional complexity. 2011 Elsevier Ltd. All rights reserved.en_US
dc.titleCARED: Cautious Adaptive RED gateways for TCP/IP networksen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
File Description SizeFormat 
10150.pdf905.24 kBAdobe PDFThumbnail
View/Open


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