Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/8251
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTarte, I.
dc.contributor.authorJoshi, A.R.
dc.contributor.authorNavya, R.S.
dc.contributor.authorTahiliani, M.P.
dc.date.accessioned2020-03-30T10:18:16Z-
dc.date.available2020-03-30T10:18:16Z-
dc.date.issued2018
dc.identifier.citation11th IEEE International Conference on Advanced Networks and Telecommunications Systems, ANTS 2017, 2018, Vol., , pp.1-6en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/8251-
dc.description.abstractThe problem of bufferbloat has reignited interest in studying Active Queue Management (AQM) algorithms. Significant efforts have been taken by AQM and Packet Scheduling Working Group at IETF to bring more awareness about the performance benefits of deploying AQM algorithms in the Internet. However, experimental analysis of these algorithms is necessary prior to real time deployment. Network simulators like ns-3 are useful tools to perform such preliminary studies. Random Exponential Marking (REM) is one of the popular AQM algorithms. It decouples congestion measure from performance measure, and aims to stabilize the performance measure around the target queue length regardless of the number of users. This paper presents the implementation of a new model for REM in ns-3. The correctness of the proposed model has been validated by comparing the results obtained from it, to those obtained from the ns-2 model developed by authors of REM. � 2017 IEEE.en_US
dc.titleImplementation and validation of random exponential marking (REM) in ns-3en_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


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