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

Aditya Gudipati

dblp:63/9226 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2016
—ORCID · none

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

Computer networks · 4 · 3 first-author

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
3 papers
Cellular and mobile networks · 39% Wireless networking · 39% Physical-layer communications · 19%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › channel coding › adaptive coding › rate-adaptive coding
rateless coding
0.322012
AutoMAC: rateless wireless concurrent medium access · MobiCom 2012
Strider: automatic rate adaptation and collision handling · SIGCOMM 2011
Cellular and mobile networks › heterogeneous networks
small cells
0.212016
QuickC: practical sub-millisecond transport for small cells · MobiCom 2016
Wireless networking › medium access control
concurrent transmission
0.112012
AutoMAC: rateless wireless concurrent medium access · MobiCom 2012
Cellular and mobile networks › interference management
interference exploitation
0.112012
AutoMAC: rateless wireless concurrent medium access · MobiCom 2012
Wireless networking
medium access control
0.112012
AutoMAC: rateless wireless concurrent medium access · MobiCom 2012
Wireless networking › link adaptation
rate adaptation
0.112011
Strider: automatic rate adaptation and collision handling · SIGCOMM 2011
Cellular and mobile networks
interference management
0.112016
QuickC: practical sub-millisecond transport for small cells · MobiCom 2016
Cellular and mobile networks
radio access networks
0.112016
QuickC: practical sub-millisecond transport for small cells · MobiCom 2016

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

rateless coding · 0.1prototype implementation · 0.1
YearPublicationVenuePosition
2016 QuickC: practical sub-millisecond transport for small cells
abstract
Cellular operators want to be able to deploy small cells with the same ease as WiFi access points, to quickly address traffic hotspots in dense urban areas. However, deploying small cells has not been easy. The reason is that due to scarcity of licensed spectrum, small cells need to use the same spectrum as the existing macro cells, and they need to explicitly coordinate their spectrum usage with each other to manage interference. The challenge is that this coordination needs to happen with latencies less than a millisecond, otherwise adding small cells does not help scale the overall network capacity. Implementing such tight coordination in dense urban deployments has not been easy in practice.
Rakesh Misra, Aditya Gudipati, Sachin Katti
MobiCom2
2012 AutoMAC: rateless wireless concurrent medium access
abstract
Current wireless network design is built on the ethos of avoiding interference. In this paper we question this long-held design principle. We show that with appropriate design, successful concurrent transmissions can be enabled and exploited on both the uplink and downlink. We show that this counter-intuitive approach of encouraging interference can be exploited to increase network capacity significantly and simplify network design. We design and implement name, a novel MAC and PHY protocol that exploits recently proposed rateless coding techniques to provide such concurrency. We show via a prototype implementation and experimental evaluation that name can provide a 60% increase in network capacity on the uplink compared to traditional Wifi that does omniscient rate adaptation and a $35\%$ median throughput gain on the downlink PHY layer as compared to an omniscient scheme that picks the best conventional bitrate.
Aditya Gudipati, Stephanie Pereira, Sachin Katti
MobiCom1
2011 Strider: automatic rate adaptation and collision handling
abstract
This paper presents the design, implementation and evaluation of Strider, a system that automatically achieves almost the optimal rate adaptation without incurring any overhead. The key component in Strider is a novel code that has two important properties: it is rateless and collision-resilient. First, in time-varying wireless channels, Strider's rateless code allows a sender to effectively achieve almost the optimal bitrate, without knowing how the channel state varies. Second, Strider's collision-resilient code allows a receiver to decode both packets from collisions, and achieves the same throughput as the collision-free scheduler. We show via theoretical analysis that Strider achieves Shannon capacity for Gaussian channels, and our empirical evaluation shows that Strider outperforms SoftRate, a state of the art rate adaptation technique by 70% in mobile scenarios and by upto 2.8× in contention scenarios.
Aditya Gudipati, Sachin Katti
SIGCOMM1
2010 Automatic rate adaptation
abstract
Rate adaptation is a fundamental primitive in wireless networks. Since wireless channel strength varies quickly and unpredictably, senders have to constantly measure the channel and correspondingly adapt the bitrate so that the transmitted packet gets correctly decoded. Prior approaches to this problem can be divided into two classes: those that require constant and expensive feedback from the receiver about channel strength, or those that use coarse and often inaccurate inference based on packet losses to measure channel strength and decide what bitrate to use.
Aditya Gudipati, Sachin Katti
HotNets1