Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Akshit Singhal

dblp:177/7943 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Transport protocols and congestion control · 64% Internet architecture and protocols · 16% Network optimization and economics · 16%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › multipath transport
multipath TCP
0.612022
Two Families of Optimal Multipath Congestion Control Protocols · ICNP 2022
Transport protocols and congestion control › optimization-based congestion control
utility-based congestion control
0.612022
Two Families of Optimal Multipath Congestion Control Protocols · ICNP 2022
Transport protocols and congestion control › multipath transport
multipath congestion control
0.412020
HOLNET: A Holistic Traffic Control Framework for Datacenter Networks · ICNP 2020
Network optimization and economics › resource allocation
network utility maximization
0.412020
HOLNET: A Holistic Traffic Control Framework for Datacenter Networks · ICNP 2020
Internet architecture and protocols › traffic management
traffic control
0.412020
HOLNET: A Holistic Traffic Control Framework for Datacenter Networks · ICNP 2020
Transport protocols and congestion control
multipath transport
0.212022
Two Families of Optimal Multipath Congestion Control Protocols · ICNP 2022
Datacenter networks
load balancing
0.112020
HOLNET: A Holistic Traffic Control Framework for Datacenter Networks · ICNP 2020

Methods — techniques the papers use, named apart from their topics

network utility maximization · 0.6concave utility · 0.6simulation · 0.4optimization · 0.4
YearPublicationVenuePosition
2022 Two Families of Optimal Multipath Congestion Control Protocols
abstract
Multiple Path Transmission Control Protocols (MPTCPs) allow flows to explore path diversity of datacenter networks and multihoming to improve throughput, reliability, and network resource utilization. However, the existing MPTCPs are largely empirical by design and fall short of achieving satisfactory tradeoffs among responsiveness, TCP fairness and throughput. By leveraging the TCP utility and a network-utility-maximization (NUM) solution for concave utilities, in this paper, we derive and implement in Linux kernels two distinct families of NUM-optimal MPTCP protocols, EUTCP ($\gamma$), a function of a rate-scaling vector of the sub-flow rate-scaling coefficients,$\gamma$, and WUTCP ($\omega$), a function of a utility weight vector of the sub-flow weights,$\omega$, respectively. While the former allows resource pooling, the latter does not. We then show that the Semicoupled algorithm and EWTCP are in fact EUTCP(1) and WUTCP$(1/m^{2})$, where$m$is the number of sub-flow paths, and hence, are NUM-optimal. The performance of the two families with equal weight and equal rate-scaling coefficient for all sub-flows when coexisting with TCP is also analyzed based on experiments in a testbed. In particular, the test results demonstrate that the family members of EUTCP ($\gamma$) with rate-scaling coefficient in the range of [1, 1.1] outperform three well-known MPTCPs with resource pooling capability, including LIA, OLIA and Balia, in terms of achieving satisfactory tradeoffs among responsiveness, fairness and throughput. Finally, the effectiveness of the proposed algorithms compared to the existing ones is further confirmed by simulation in a fat-tree datacenter network topology running both long and short flows.
Akshit Singhal, Zhijun Wang 0001, Hao Che, Hong Jiang 0001
ICNP1
2020 HOLNET: A Holistic Traffic Control Framework for Datacenter Networks
abstract
In this paper, we put forward a HOListic traffic control framework for datacenter NETworks (HOLNET). HOLNET reformulates the network utility maximization (NUM) framework into a HOLNET NUM framework that fully harnesses the potential of the existing NUM-based solutions to allow large families of traffic control protocols of various degrees of sophistication to be developed, i.e., host-based, single or multiple Class-of-Service (CoS) enabled, single or multi-path congestion control, with or without in-network load balancing. Unlike the existing solutions that are largely empirical and point by design, HOLNET is a principled, systematic framework. All the protocols in a family developed under HOLNET share a common, user-defined global optimization objective and fairness criterion. As a result, the protocols in a family can be fairly compared and carefully selected to fully explore the performance, scalability and design complexity tradeoffs. Case studies, based on both a single and a multi-path host-based solutions, demonstrate the viability and flexibility in HOLNET design space exploration. To further test the backward compatibility and performance with respect to some existing lightweight solutions, we develop HOLNET-UTA, an integrated congestion control and load balancing protocol, achieving TCP-fair resource allocation. HOLNET-UTA is found by simulation to improve the average flow completion time (FCT) by more than 20%, compared to DRILL with DCTCP.
Zhijun Wang 0001, Akshit Singhal, Yunxiang Wu, Chuwen Zhang, Hao Che, Hong Jiang 0001, Bin Liu 0001, Constantino M. Lagoa
ICNP2