Conference Papers

Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506

Browse

Filters

2016 - 20204

Settings

Author: search.filters.author.Tahiliani, M.P.Subject: search.filters.subject.Active Queue Management

Search Results

Now showing 1 - 4 of 4
  • No Thumbnail Available
    Item
    Implementation and evaluation of Proportional Integral Controller Enhanced (PIE) algorithm in ns-3
    (Association for Computing Machinery acmhelp@acm.org, 2016) Shravya, K.S.; Murali, S.; Tahiliani, M.P.
    This paper proposes a new ns-3 model and presents the evaluation results for Proportional Integral controller Enhanced (PIE), a recently designed Active Queue Management (AQM) mechanism to address the problem of bufferbloat. The problem of bufferbloat arises due to the presence of large unmanaged buffers in routers. This leads to high queuing latency and significantly degrades the performance of time-sensitive and interactive traffic. AQM mechanisms that aim to address the problem of bufferbloat try to achieve an optimal trade-off between high link utilization and low mean queue length. PIE is a lightweight AQM mechanism that tries to achieve the same. To our knowledge, ns-3 network simulator does not have a model for simulating PIE. Hence, in this paper, we implement a ns-3 model for PIE, and show that the results obtained from it are in line with those obtained from the ns-2 model of PIE, implemented by its authors. © 2016 ACM.
  • No Thumbnail Available
    Item
    Design and implementation of AQM evaluation suite for ns-3
    (Association for Computing Machinery acmhelp@acm.org, 2017) Deepak, A.; Shravya, K.S.; Tahiliani, M.P.
    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.
  • No Thumbnail Available
    Item
    Implementation and validation of random exponential marking (REM) in ns-3
    (Institute of Electrical and Electronics Engineers Inc., 2018) Tarte, I.; Joshi, A.R.; Navya, R.S.; Tahiliani, M.P.
    The 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.
  • No Thumbnail Available
    Item
    BBRvl vs BBRv2: Examining Performance Differences through Experimental Evaluation
    (IEEE Computer Society help@computer.org, 2020) Nandagiri, A.; Tahiliani, M.P.; Misra, V.; Ramakrishnan, K.K.
    BBR, a congestion control algorithm proposed by Google, regulates the source sending rate by deriving an estimate of the bottleneck's available bandwidth and RTTof the path. The initial version of BBR, called BBRvl, was found to be unfair, getting higher than the fair share of bandwidth when co-existing on bottleneck links with other congestion control algorithms. It also does not perform as well with networks having routers with shallow buffers. To overcome these concerns, a newer version, called BBRv2, has been proposed. Our goal in this paper is to understand the differences between the two versions and examine the primary reasons behind the improvement in performance of BBRv2. We present an experimental evaluation of BBRvl and BBRv2, evaluating their fairness across connections using the same protocol (intra-protocol fairness) and using different protocols (inter-protocol fairness) as well as delay and link utilization. From experiments with shallow and deep buffers, BBRv2 is most effective when it uses Explicit Congestion Notification (ECN), but fairness issues continue to exist in BBRv2 when ECN is disabled. A concern for BBRv2 is that it is somewhat complex to deploy in Wide Area Networks (WAN) because of the dependency with the DCTCP-style reduction of the congestion window, which is primarily usable in low-feedback delay Data Center Networks. © 2020 IEEE.