Conference Papers

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

Browse

Filters

2019 - 20202

Settings

Author: search.filters.author.Anand, T.

Search Results

Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    Adaptive RED for FreeBSD: Design, Implementation and Challenges
    (Institute of Electrical and Electronics Engineers Inc., 2019) Pandey, A.; Anand, T.; Shah, M.; Tahiliani, M.P.
    Bufferbloat problem arises due to buffering of large amounts of data in queues, owing to the large size of these queues. Bufferbloat being a relatively new phenomenon meant that earlier queue management algorithms did not specifically address this problem. Despite this issue, there is merit in analysing and evaluating old queue management algorithms which have helped alleviate the undesirable performance issues that arose due to persistently full buffers. One of the earliest and most significantly studied Active Queue Management (AQM) algorithms is Random Early Drop (RED). RED helps to keep the average size of the queues low and allow occasional bursts of packets through the queue. Once the number of packets queued crosses a minimum threshold, incoming packets are dropped with a random probability. However, the resulting average queue length is quite sensitive to the level of congestion and the RED parameter settings. Adaptive RED (ARED) solves most of the issues faced by RED with minimal changes and leaves its basic idea intact. The ARED algorithm regularly adapts the value of the maximum dropping probability and ensures that the queue length stays within the targeted range. Despite its ability to resolve the inherent problems in RED, ARED went largely unnoticed for several years, until the issue of Bufferbloat arose. Although ARED predates Bufferbloat, its fundamental design makes it an effective solution to handle Bufferbloat. This discovery led to the implementation of ARED in Linux and in network simulators like ns-3. Besides Linux, FreeBSD is one of the most popular open source operating systems. Although RED is supported in FreeBSD, ARED is not. Since ARED is one of the viable solutions to tackle Bufferbloat, this paper discusses the design and implementation of ARED in FreeBSD. We also detail the challenges faced during the implementation, and validate through real testbed experiments that our implementation in FreeBSD exhibits ARED's key characteristics. © 2019 IEEE.
  • No Thumbnail Available
    Item
    DPDK-FQM: Framework for Queue Management Algorithms in DPDK
    (Institute of Electrical and Electronics Engineers Inc., 2020) Pandey, A.; Bargaje, G.; Avinash; Krishnam, S.; Anand, T.; Monis, L.; Tahiliani, M.P.
    The advantages of Network Function Virtualization (NFV) have attracted many use cases ranging from virtual Customer Premises Equipment (vCPE) to virtual Radio Access Network (vRAN) and virtual Evolved Packet Core (vEPC). Fast packet processing libraries such as Data Plane Development Kit (DPDK) are necessary to enable NFV. Currently, DPDK provides a framework for Quality of Service (QoS) which is used for queue management, traffic shaping and policing, but it lacks a general purpose queue management framework. In this paper, we propose DPDK-FQM, a framework to implement queue management algorithms in DPDK, run them and collect the desired statistics. Subsequently, we implement Proportional Integral controller Enhanced (PIE) and Controlled Delay (CoDel) queue management algorithms by using the proposed framework. We develop a new DPDK application to demonstrate the usage of APIs in DPDK-FQM, and verify the correctness of the framework and implementations of PIE and CoDel. Our experiments on a high speed network testbed show that PIE and CoDel exhibit their key characteristics by controlling the queue delay at a desired target, while fully utilizing the bottleneck bandwidth. © 2020 IEEE.