Rachit Agarwal

Orcid: 0000-0001-6731-9938

Affiliations:
  • Cornell University, NY, USA
  • University of California, Berkeley, CA, USA (former)
  • University of Illinois at Urbana-Champaign, IL, USA (former)


According to our database1, Rachit Agarwal authored at least 53 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Host Congestion Control.
Proceedings of the ACM SIGCOMM 2023 Conference, 2023

Karma: Resource Allocation for Dynamic Demands.
Proceedings of the 17th USENIX Symposium on Operating Systems Design and Implementation, 2023

Formal Methods for Network Performance Analysis.
Proceedings of the 20th USENIX Symposium on Networked Systems Design and Implementation, 2023

2022
SHORTSTACK : Distributed, Fault-tolerant, Oblivious Data Access.
IACR Cryptol. ePrint Arch., 2022

Optimal oblivious reconfigurable networks.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Towards <i>μ</i>s tail latency and terabit ethernet: disaggregating the host network stack.
Proceedings of the SIGCOMM '22: ACM SIGCOMM 2022 Conference, Amsterdam, The Netherlands, August 22, 2022

dcPIM: near-optimal proactive datacenter transport.
Proceedings of the SIGCOMM '22: ACM SIGCOMM 2022 Conference, Amsterdam, The Netherlands, August 22, 2022

From Switch Scheduling to Datacenter Scheduling: Matching-Coordinated Greed is Good.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Understanding host interconnect congestion.
Proceedings of the 21st ACM Workshop on Hot Topics in Networks, 2022

Jiffy: elastic far-memory for stateful serverless analytics.
Proceedings of the EuroSys '22: Seventeenth European Conference on Computer Systems, Rennes, France, April 5, 2022

2021
Incentives in Resource Allocation under Dynamic Demands.
CoRR, 2021

Understanding host network stack overheads.
Proceedings of the ACM SIGCOMM 2021 Conference, Virtual Event, USA, August 23-27, 2021., 2021

Rearchitecting Linux Storage Stack for µs Latency and High Throughput.
Proceedings of the 15th USENIX Symposium on Operating Systems Design and Implementation, 2021

CodedBulk: Inter-Datacenter Bulk Transfers using Network Coding.
Proceedings of the 18th USENIX Symposium on Networked Systems Design and Implementation, 2021

2020
PANCAKE: Frequency Smoothing for Encrypted Data Stores.
IACR Cryptol. ePrint Arch., 2020

Wide-Area Data Analytics.
CoRR, 2020

Building An Elastic Query Engine on Disaggregated Storage.
Proceedings of the 17th USENIX Symposium on Networked Systems Design and Implementation, 2020

TCP ≈ RDMA: CPU-efficient Remote Storage Access with i10.
Proceedings of the 17th USENIX Symposium on Networked Systems Design and Implementation, 2020

2019
Shoal: A Network Architecture for Disaggregated Racks.
Proceedings of the 16th USENIX Symposium on Networked Systems Design and Implementation, 2019

Confluo: Distributed Monitoring and Diagnosis Stack for High-speed Networks.
Proceedings of the 16th USENIX Symposium on Networked Systems Design and Implementation, 2019

2018
Sincronia: near-optimal network design for coflows.
Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication, 2018

Obladi: Oblivious Serializable Transactions in the Cloud.
Proceedings of the 13th USENIX Symposium on Operating Systems Design and Implementation, 2018

Distributed Network Monitoring and Debugging with SwitchPointer.
Proceedings of the 15th USENIX Symposium on Networked Systems Design and Implementation, 2018

2017
ZipG: A Memory-efficient Graph Store for Interactive Queries.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

MiniCrypt: Reconciling Encryption and Compression for Big Data Stores.
Proceedings of the Twelfth European Conference on Computer Systems, 2017

2016
Simplifying Datacenter Network Debugging with PathDump.
Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation, 2016

Network Requirements for Resource Disaggregation.
Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation, 2016

Universal Packet Scheduling.
Proceedings of the 13th USENIX Symposium on Networked Systems Design and Implementation, 2016

BlowFish: Dynamic Storage-Performance Tradeoff in Data Stores.
Proceedings of the 13th USENIX Symposium on Networked Systems Design and Implementation, 2016

2015
On the Scalability of Routing With Policies.
IEEE/ACM Trans. Netw., 2015

CherryPick: tracing packet trajectory in software-defined datacenter networks.
Proceedings of the 1st ACM SIGCOMM Symposium on Software Defined Networking Research, 2015

Succinct: Enabling Queries on Compressed Data.
Proceedings of the 12th USENIX Symposium on Networked Systems Design and Implementation, 2015

pHost: distributed near-optimal datacenter transport over commodity network fabric.
Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies, 2015

FastLane: making short flows shorter with agile drop notification.
Proceedings of the Sixth ACM Symposium on Cloud Computing, 2015

2014
The Space-Stretch-Time Tradeoff in Distance Oracles.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Low latency queries on big graph data
PhD thesis, 2013

Shortest Paths in Microseconds.
CoRR, 2013

Distance Oracles for Stretch Less Than 2.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Brief announcement: a simple stretch 2 distance oracle.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
CoRR, 2012

Shortest paths in less than a millisecond.
Proceedings of the 2012 ACM workshop on Workshop on Online Social Networks, 2012

2011
Slick packets.
Proceedings of the SIGMETRICS 2011, 2011

Debugging the data plane with anteater.
Proceedings of the ACM SIGCOMM 2011 Conference on Applications, 2011

Combinatorial lower bound for list decoding of codes on finite-field Grassmannian.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Approximate distance queries and compact routing in sparse graphs.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010
When Watchdog Meets Coding.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Guaranteeing BGP Stability with a Few Extra Paths.
Proceedings of the 2010 International Conference on Distributed Computing Systems, 2010

2009
Error resilient data transport in sensor network applications: A generic perspective.
Int. J. Circuit Theory Appl., 2009

2007
On Computation of Error Locations and Values in Hermitian Codes
CoRR, 2007

A Low Complexity Algorithm and Architecture for Systematic Encoding of Hermitian Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

A Parallel Architecture for Hermitian Decoders: Satisfying Resource and Throughput Constraints.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2007), 2007

Low cost error recovery in Delay-Intolerant Wireless Sensor Networks.
Proceedings of the 18th European Conference on Circuit Theory and Design, 2007

2006
A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons.
Nord. J. Comput., 2006


  Loading...