Conference Papers

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

Browse

Search Results

Now showing 1 - 6 of 6
  • Item
    TCP evaluation suite for ns-3
    (Association for Computing Machinery acmhelp@acm.org, 2016) Mishra, D.K.; Vankar, P.; Tahiliani, M.P.
    Congestion Control (CC) algorithms are essential to quickly restore the network performance back to stable whenever congestion occurs. A majority of the existing CC algorithms are implemented at the transport layer, mostly coupled with TCP. Over the past three decades, CC algorithms have incrementally evolved, resulting in many extensions of TCP. A thorough evaluation of a new TCP extension is a huge task. Hence, the Internet Congestion Control Research Group (ICCRG) has proposed a common TCP evaluation suite that helps researchers to gain an initial insight into the working of their proposed TCP extension. This paper presents an implementation of the TCP evaluation suite in ns-3, that automates the simulation setup, topology creation, traffic generation, execution, and results collection. We also describe the internals of our implementation and demonstrate its usage for evaluating the performance of five TCP extensions available in ns-3, by automatically setting up the following simulation scenarios: (i) single and multiple bottleneck topologies, (ii) varying bottleneck bandwidth, (iii) varying bottleneck RTT and (iv) varying the number of long flows. © 2016 ACM.
  • 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.
  • 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.
  • Item
    Common TCP evaluation suite for ns-3: Design, implementation and open issues
    (Association for Computing Machinery acmhelp@acm.org, 2017) Nagori, K.; Balachandran, M.; Deepak, A.; Tahiliani, M.P.; Chandavarkar, B.R.
    This paper presents the design and implementation of a Common TCP Evaluation Suite for ns-3. The proposed evaluation suite uses Tmix to generate realistic synthetic TCP traéc, and is designed in line with the recommendations from Internet Congestion Control Research Group (ICCRG). We discuss the Tmix integration in ns-3, shu.ing connection vectors of the real traces, architecture and validation of the proposed evaluation suite. The correctness of the evaluation suite is verified by comparing the results obtained from it to those from an existing implementation of such a suite in ns-2. Several open issues discovered with Tmix are also discussed in the paper. © 2017 ACM.
  • Item
    Proportional rate reduction for ns-3 TCP
    (Association for Computing Machinery acmhelp@acm.org, 2018) Mittal, V.; Jain, V.; Tahiliani, M.P.
    The implementation of Transmission Control Protocol (TCP) in the Linux kernel has kept pace with its ongoing research. However, it is not the case with the implementations of TCP in network simulators. This limitation has been a major hindrance in thoroughly evaluating the performance of new TCP extensions, since carrying out real-time experimental evaluations is a non-trivial task. Recently, there have been significant efforts to align the TCP implementation in ns-3 to that of Linux. Nonetheless, there still exist several features that the implementation of TCP in ns-3 lacks. In this work, the TCP implementation in ns-3 has been extended to support Proportional Rate Reduction (PRR) algorithm. PRR is a de facto loss recovery algorithm used since Linux kernel 3.2. This paper describes the implementation and validation of PRR algorithm in ns-3 and also highlights the need to modularize the implementation of loss recovery algorithms in ns-3. © 2018 Copyright held by the owner/author(s).
  • Item
    Design and implementation of TCP BBR in ns-3
    (Association for Computing Machinery acmhelp@acm.org, 2018) Jain, V.; Mittal, V.; Tahiliani, M.P.
    Bottleneck Bandwidth and Round-trip propagation time (BBR) is a congestion based congestion control algorithm recently proposed by Google. Although it can be deployed with any transport protocol that supports data delivery acknowledgement, BBR is presently implemented alongside TCP (known as TCP BBR) in Linux kernel since 4.9 and is the default congestion control used in Google Cloud Platform. However, to the best of our knowledge, TCP BBR is not yet supported in popular network simulators such as ns-3. This limitation is a major hindrance in thoroughly studying the benefits of TCP BBR since carrying out large-scale and real-time experimental evaluations is a non-trivial task. In this paper, we discuss the design and implementation of a new model for TCP BBR in ns-3. We validate the proposed model by performing different sets of simulations to ensure that the model in ns-3 exhibits key characteristics of TCP BBR. © 2018 Copyright held by the owner/author(s).