Faculty Publications
Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736
Publications by NITK Faculty
Browse
3 results
Search Results
Item CARED: Cautious Adaptive RED gateways for TCP/IP networks(2012) Tahiliani, M.P.; Shet, K.C.; Basavaraju, T.G.Random Early Detection (RED) is a widely deployed active queue management algorithm that improves the overall performance of the network in terms of throughput and delay. The effectiveness of RED algorithm, however, highly depends on appropriate setting of its parameters. Moreover, the performance of RED is quite sensitive to abrupt changes in the traffic load. In this paper, we propose a Cautious Adaptive Random Early Detection (CARED) algorithm that dynamically varies maximum drop probability based on the level of traffic load to improve the overall performance of the network. Based on extensive simulations conducted using Network Simulator-2 (ns-2), we show that CARED algorithm reduces the packet drop rate and achieves high throughput as compared to RED, Adaptive RED and Refined Adaptive RED. Unlike other RED based algorithms, CARED algorithm does not introduce new parameters to achieve performance gain and hence can be deployed without any additional complexity. © 2011 Elsevier Ltd. All rights reserved.Item Minstrel PIE: Curtailing queue delay in unresponsive traffic environments(Elsevier B.V., 2019) Patil, S.D.; Tahiliani, M.P.Active Queue Management (AQM) algorithms aim to maintain a proper trade-off between queue delay and bottleneck link utilization. However, it is often noticed that this trade-off is not achieved convincingly when unresponsive UDP flows coexist with responsive TCP flows. This paper proposes an extension to Proportional Integral controller Enhanced (PIE) algorithm called Minstrel PIE, which adapts the reference queue delay to improve the trade-off between queue delay and link utilization when unresponsive flows share the same bottleneck queue as responsive flows. Extensive evaluations through simulations and real time experiments demonstrate that Minstrel PIE improves the performance of PIE in the presence of unresponsive flows, and delivers similar performance otherwise. Moreover, the Minstrel PIE algorithm does not introduce new knobs to improve the performance of PIE and hence, can be easily deployed without any additional complexity. © 2019 Elsevier B.V.Item Revisiting design choices in queue disciplines: The PIE case(Elsevier B.V., 2020) Imputato, P.; Avallone, S.; Tahiliani, M.P.; Ramakrishnan, G.Bloated buffers in the Internet add significant queuing delays and have a direct impact on the user perceived latency. There has been an active interest in addressing the problem of rising queue delays by designing easy-to-deploy and efficient Active Queue Management (AQM) algorithms for bottleneck devices. The real deployment of AQM algorithms is a complex task because the efficiency of every algorithm depends on appropriate setting of its parameters. Hence, the design of AQM algorithms is usually entrusted on simulation environments where it is relatively straightforward to evaluate the algorithms with different parameter configurations. Unfortunately, several factors that affect the efficiency of AQM algorithms in real deployment do not manifest during simulations, and therefore, lead to inefficient design of the AQM algorithm. In this paper, we revisit the design considerations of Proportional Integral controller Enhanced (PIE), an algorithm widely considered for network deployment, and extensively evaluate its performance using a Linux based testbed. Our experimental study reveals some performance anomalies in certain circumstances and we prove that they can be attributed to a specific design choice of PIE, namely the use of the estimated departure rate to compute the expected queuing delay. Therefore, we designed an alternative approach based on packet timestamps, implemented it in the Linux kernel and proved its effectiveness through an experimental campaign. © 2020