Background: I recently completed doctoral studies at the Computer Science Department, Carnegie Mellon
University, and will join the University of Chicago Booth School of Business as Assistant Professor of Operations Management in 2012. During 2011-12, I will be a post-doctoral researcher at Google Research, New York. I completed my undergraduate education from the Computer Science and Engineering
Department, Indian Institute of Technology, Delhi and was awarded the President's Gold Medal.
Research Interests: My research interests are in Stochastic Modeling and Optimization, Queueing Theory, Applied Probability, Algorithm Design and Analysis, and Mechanism Design. I am particularly interested in developing algorithms for computer networks and distributed systems. Currently, my research focus is in queueing theoretic modeling and analysis of computer systems and scheduling policies. In the past, I have worked on algorithms for Computational Biology and (approximate/exact) string matching.
Robust and Flexible Power-Proportional Storage. SOCC 2010. (with Hrishikesh Amur, Jim Cipar, Michael Kozuch, Greg Ganger, and Karsten Schwan)
On the inapproximability of M/G/K: Why two moments of job size distribution are not enough. Queueing Systems: Theory and Applications: Volume 64, Issue 1. (with Bert Zwart, Jim Dai, and Mor Harchol-Balter)
[pdf of preprint] online version
The Effect of higher moments of job size distribution on the performance of an M/G/K queueing system. Technical Report CMU-CS-08-106. [pdf]
Distributed Caching Algorithms for Content Distribution Networks. INFOCOM 2010. (with Sem Borst and Anwar Walid)
Analysis of Join-the-Shortest-Queue Routing for Web server Farms. Performance 2007 (Performance Evaluation, Vol 64, Issues 9-12). (with Mor Harchol-Balter, Karl Sigman and Ward Whitt) [pdf] [ps]; Supplement with simulation results [pdf] [ps]