Danushka Menikkumbura

Danushka Menikkumbura

Auto-generated profile, based on publicly available information

Danushka Menikkumbura

Department of Computer Science, Purdue University, West Lafayette, IN, USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 March 2023 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Open access
DMDanushka Menikkumbura
Danushka Menikkumbura
PTParvin Taheri
Parvin Taheri
EVErico Vanini
Erico Vanini
SFSonia Fahmy
Sonia Fahmy
PEPatrick Eugster
Patrick Eugster
TETom Edsall
Tom Edsall
In this article, we present RoCC , a robust congestion control approach for datacenter networks based on RDMA. RoCC leverages switch queue size as an input to a PI controller, which computes the fair data rate of flows in the queue. The PI parameters are self-tuning to guarantee stability, rapid convergence, and fair and near-optimal throughput in a wide range of congestion scenarios. Our simulation and DPDK implementation results show that RoCC can achieve up to $7\times$ reduction in PFC frames generated under high load levels, compared to DCQCN. At the same time, RoCC can achieve $1.7-4.5\times$ and $1.4-3.9\times$ lower tail latency for long flows and $2.1-7\times$ and $3.5-8.2\times$ lower tail latency for short flows, compared to DCQCN and HPCC, respectively. We also find that RoCC does not require PFC. The functional components of RoCC can be efficiently implemented in P4 and FPGA-based switch hardware.

6 August 2020 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
KKKirill Kogan
Kirill Kogan
DMDanushka Menikkumbura
Danushka Menikkumbura
GPGustavo Petri
Gustavo Petri
YNYOUNG-TAE NOH
YOUNG-TAE NOH
SNSergey Nikolenko
Sergey Nikolenko
PEPatrick Eugster
Patrick Eugster
Buffering architectures and policies for their efficient management are core ingredients of a network architecture. However, despite strong incentives to experiment with and deploy new policies, opportunities for changing anything beyond minor elements are limited. We introduce a new specification language, OpenQueue, that allows to express virtual buffering architectures and management policies representing a wide variety of economic models. OpenQueue allows users to specify entire buffering architectures and policies conveniently through several comparators and simple functions. We show examples of buffer management policies in OpenQueue and empirically demonstrate its impact on performance in various settings.

17 March 2016
Verified
Conference Paper
Open access
KKKirill Kogan
Kirill Kogan
DMDanushka Menikkumbura
Danushka Menikkumbura
GPGustavo Petri
Gustavo Petri
YNYOUNG-TAE NOH
YOUNG-TAE NOH
SNSergey Nikolenko
Sergey Nikolenko
PEPatrick Eugster
Patrick Eugster