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

Rahul Arvind Jadhav

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

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

Computer networks · 2 · 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 · 77% Wireless networking · 23%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › TCP
TCP acknowledgment
0.922021
Revisiting Acknowledgment Mechanism for Transport Control: Modeling, Analysis, and Implementation · IEEE/ACM Trans. Netw. 2021
TACK: Improving Wireless Transport Performance by Taming Acknowledgments · SIGCOMM 2020
Wireless networking
WLAN
0.322021
Revisiting Acknowledgment Mechanism for Transport Control: Modeling, Analysis, and Implementation · IEEE/ACM Trans. Netw. 2021
TACK: Improving Wireless Transport Performance by Taming Acknowledgments · SIGCOMM 2020

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

simulation · 0.5implementation · 0.5
YearPublicationVenuePosition
2021 Revisiting Acknowledgment Mechanism for Transport Control: Modeling, Analysis, and Implementation
abstract
The shared nature of the wireless medium induces contention between data transport and backward signaling, such as acknowledgment. The current way of TCP acknowledgment induces control overhead which is counter-productive for TCP performance especially in wireless local area network (WLAN) scenarios. In this paper, we present a new acknowledgment called TACK (“Tame ACK”), as well as its TCP implementation TCP-TACK. TACK seeks to minimize ACK frequency, which is exactly what is required by transport. TCP-TACK works on top of commodity WLAN, delivering high wireless transport goodput with minimal control overhead in the form of ACKs, without any hardware modification. Evaluation results show that TCP-TACK achieves significant advantages over legacy TCP in WLAN scenarios due to less contention between data packets and ACKs. Specifically, TCP-TACK reduces over 90% of ACKs and also obtains an improvement of up to 28% on goodput. A TACK-based protocol is a good replacement of the legacy TCP to compensate for scenarios where the acknowledgment overhead is non-negligible.
Tong Li 0014, Kai Zheng 0003, Ke Xu 0002, Rahul Arvind Jadhav, Keith Winstein, Kun Tan 0002
IEEE/ACM Trans. Netw.4
2020 TACK: Improving Wireless Transport Performance by Taming Acknowledgments
abstract
The shared nature of the wireless medium induces contention between data transport and backward signaling, such as acknowledgement. The current way of TCP acknowledgment induces control overhead which is counter-productive for TCP performance especially in wireless local area network (WLAN) scenarios.
Tong Li 0014, Kai Zheng 0003, Ke Xu 0002, Rahul Arvind Jadhav, Keith Winstein, Kun Tan 0002
SIGCOMM4