I am a postdoctoral scholar at the Systems and Networking group in the Computer Science department at the University of California, San Diego. My current research interests include and network routing and network security. I have some notes on useful techniques. Only slightly related to my work are the statues of Shannon that I have visited. Last but not least, a description of my tempeh incubator.

Publications

R. R. Kompella, K. Levchenko, A. C. Snoeren, and G. Varghese. Every Microsecond Counts: Tracking Fine-Grain Latencies with a Lossy Difference Aggregator. To be presented at SIGCOMM 2009.

C. Kreibich, C. Kanich, K. Levchenko, B. Enright, G. M. Voelker, V. Paxson, and S. Savage. Spamcraft: An Inside Look at Spam Campaign Orchestration. LEET 2009 (workshop).

C. Kanich, C. Kreibich, K. Levchenko, B. Enright, V. Paxson, G. M. Voelker, and S. Savage. Spamalytics: An Empirical Analysis of Spam Marketing Conversion. CCS 2008.

K. Levchenko, G. M. Voelker, R. Paturi, and S. Savage. XL: An Efficient Network Routing Algorithm. SIGCOMM 2008.

C. Kreibich, C. Kanich, K. Levchenko, B. Enright, G. M. Voelker, V. Paxson, and S. Savage. On The Spam Campaign Trail. LEET 2008 (workshop).

C. Kanich, K. Levchenko, B. Enright, G. M. Voelker, and S. Savage. The Heisenbot Uncertainty Problem: Challenges in Separating Bots from Chaff. LEET 2008 (workshop).

J. Ma, K. Levchenko, C. Kreibich, S. Savage, and G. M. Voelker. Unexpected Means of Protocol Inference. IMC 2006.

A. R. Calderbank, A. Gilbert, K. Levchenko, S. Muthukrishnan, and M. Strauss. Improved Range-Summable Random Variable Construction Algorithms. SODA 2005. Note: There is a significant error in the paper; please see explanation.

K. Levchenko, R. Paturi, and G. Varghese. On the Difficulty of Scalably Detecting Network Attacks. CCS 2004.

A. Gilbert and K. Levchenko. Compressing Network Graphs. Presented at the LinkKDD 2004 (workshop).