I just completed my Ph.D. in computer science at the University of Washington, where I was advised by Tom Anderson and Arvind Krishnamurthy. My thesis work focused on how to build Internet-scale services without relying on expensive, trusted infrastructure. I enjoy building and improving real, actively used systems. To that end, I’ve incorporated my research into a number of widely deployed software releases, listed below.
In 2009, I received the Google Ph.D. Fellowship in Computer Networking. I spent most of the past year at Google working on infrastructure systems, and I’ve been at Google full-time since August, 2011.
At Google
- Thialfi: A Client Notification Service for Internet-Scale Applications
Previous projects
- OneSwarm: Privacy preserving P2P data sharing
- Contracts: Practical contribution incentives for P2P live video streaming
- Tracking the trackers: Exposing weaknesses in copyright monitoring and enforcement
on the Internet
- BitTyrant: A selfish BitTorrent client that exploits altruism to improve performance
- BitProbes: Measuring the Internet’s edge opportunistically by piggybacking on peer-to-peer traffic
- iPlane: Using coordinated, intelligent measurement to predict path properties between arbitrary Internet endpoints
Prior to graduate school, I worked on topics in computational mathematics, focusing on geometry.
- RidgeRunner: Curve tightening with thickness and curvature constraints
- tsnnls: A sparse least squares solver with non-negativity constraints
Papers
Networking, distributed systems
Workshop on Future Directions in Distributed Computing (
FuDiCo III), 2007.
Technical report: UW-CSE-06-11-01
Computational mathematics
Experimental Mathematics 20(1): 57-90, 2011.
Macromolecules, 41(12): 4444-4451, 2008.
J. Knot Theory Ramifications, 17(5): 601-631, 2008.
