Please use this identifier to cite or link to this item:
https://idr.l3.nitk.ac.in/jspui/handle/123456789/7642
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Deepak, A. | |
dc.contributor.author | Shravya, K.S. | |
dc.contributor.author | Tahiliani, M.P. | |
dc.date.accessioned | 2020-03-30T10:02:35Z | - |
dc.date.available | 2020-03-30T10:02:35Z | - |
dc.date.issued | 2017 | |
dc.identifier.citation | ACM International Conference Proceeding Series, 2017, Vol.Part F128360, , pp.87-94 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/7642 | - |
dc.description.abstract | Excessive buffering in network devices should be avoided because it leads to a series of performance issues such as high queuing latency and variations in delay. Active Queue Management (AQM) algorithms play a vital role in monitoring and controlling the queue length in these devices. Recently there has been a significant progress in the design and development of new AQM algorithms. However, thoroughly evaluating the performance of AQM algorithms is a nontrivial task. In an effort to simplify this, the Active Queue Management and Packet Scheduling Working Group at IETF have proposed informational guidelines in RFC 7928 to test the applicability, performance and deployment complexity of AQM algorithms. This paper presents the design and implementation of an AQM evaluation framework for ns-3 which helps to quickly study the performance of AQM algorithms based on the guidelines mentioned in RFC 7928. The proposed framework automates simulation setup, topology creation, trafi�c generation, program execution, results collection and their graphical representation using ns-3, based on the scenarios mentioned in the RFC. � 2017 ACM. | en_US |
dc.title | Design and implementation of AQM evaluation suite for ns-3 | en_US |
dc.type | Book chapter | en_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.