Arvind Krishnamurthy

Expressive Privacy Control with Pseudonyms

S. Han, V. Liu, Q. Pu, S. Peter, T. Anderson, A. Krishnamurthy, D. WetherallProc. of Sigcomm, 2013.

PoiRoot: Investigating the Root Cause of Interdomain Path Changes

U. Javed, I. Cunha, D. Choffnes, E. Katz-Bassett, T. Anderson, A. KrishnamurthyProc. of Sigcomm, 2013.

Demystifying Page Load Performance with WProf

X. Wang, A. Balasubramanian, A. Krishnamurthy, D. WetherallProc. of NSDI, 2013.

F10: Fault Tolerant Engineered Networks

V. Liu, D. Halperin, A. Krishnamurthy, T. AndersonProc. of NSDI, 2013.

Unifying FSM-inference Algorithms through Declarative Specification

I. Beschastnikh, Y. Brun, J. Abrahamson, M. Ernst, A. KrishnamurthyProc. of ICSE, 2013.

FreeDOM: a New Baseline for the Web

R. Cheng, W. Scott, A. Krishnamurthy, T. AndersonProc. of HotNets, 2012.

Unifying FSM-inference algorithms through declarative specification

I. Beschastnikh, Y. Brun, J. Abrahamson, M.D. Ernst, A. KrishnamurthyUniversity of Washington Department of Computer Science and Engineering:UW-CSE-12-08-02, 2012.

FairCloud: Sharing The Network In Cloud Computing

L. Popa, G. Kumar, M. Chowdhury, A. Krishnamurthy, S. Ratnasamy, I. StoicaProc. of Sigcomm, 2012.

LIFEGUARD: Practical Repair of Persistent Route Failures

E. Katz-Bassett, C. Scott, D. Choffnes, I. Cunha, V. Valancius, N. Feamster, H. Madhyastha, T. Anderson, A. KrishnamurthyProc. of Sigcomm, 2012.

Making Middleboxes Someone Else’s Problem: Network Processing as a Cloud Service

J. Sherry, S. Hasan, C. Scott, A. Krishnamurthy, S. Ratnasamy, V. SekarProc. of Sigcomm, 2012.

Mining temporal invariants from partially ordered logs

I. Beschastnikh, Y. Brun, M.D. Ernst, A. Krishnamurthy, T.E. AndersonSIGOPS Operating Systems Review 45:3, 2011.

Bandsaw: Log-powered test scenario generation for distributed systems

I. Beschastnikh, Y. Brun, M.D. Ernst, A. Krishnamurthy, T.E. AndersonSOSP Work In Progress, 2011.

Mining temporal invariants from partially ordered logs

I. Beschastnikh, Y. Brun, M.D. Ernst, A. Krishnamurthy, T.E. AndersonWorkshop on Managing Large-Scale Systems via the Analysis of System Logs and the Application of Machine Learning Techniques (SLAML '11), 2011.

Scalable Consistency in Scatter

L. Glendenning, I. Beschastnikh, A. Krishnamurthy, T. AndersonProc. of SOSP, 2011.

FairCloud: Sharing The Network In Cloud Computing

L. Popa, A. Krishnamurthy, S. Ratnasamy, I. StoicaProc. of HotNets, 2011.

Machiavellian Routing: Poisoning ISPs to Avoid Routing Problems

E. Katz-Bassett, D. Choffnes, C. Scott, I. Cunha, T. Anderson, A. KrishnamurthyProc. of HotNets, 2011.

Tor Instead of IP

V. Liu, S. Han, A. Krishnamurthy, T. AndersonProc. of HotNets, 2011.

Heat-seeking honeypots: design and experience

J. John, F. Yu, Y. Xie, A. Krishnamurthy, M. AbadiProc. of WWW, 2011.

deSEO: Combating Search-Result Poisoning

J. John, F. Yu, Y. Xie, A. Krishnamurthy, M. AbadiProc. of Usenix Security, 2011.

ETTM: A Scalable Fault Tolerant Network Manager

C. Dixon, H. Uppal, V. Brajkovic,  D,  Brandon, T. Anderson, A. KrishnamurthyProc. of NSDI, 2011.

A Cost Comparison of Datacenter Network Architectures

L. Popa, S. Ratnasamy, G. Iannaccone, A. Krishnamurthy, I. StoicaProc. of CoNEXT, 2010.

Comet: An Active Distributed Key-Value Store

R. Geambasu, A. Levy, T. Kohno, A. Krishnamurthy, H. LevyProc. of OSDI, 2010.

Contracts: Practical Contribution Incentives for P2P Live Streaming

M. Piatek, A. Krishnamurthy, A. Venkataramani, R. Yang, D. ZhangProc. of NSDI, 2010.

Privacy-preserving P2P data sharing with OneSwarm

T. Isdal, M. Piatek, A. Krishnamurthy, T. AndersonProc. of Sigcomm, 2010.

Resolving IP Aliases with Prespecified Timestamps

J. Sherry, E. Katz-Bassett, M. Pimenova, H. Madhyastha, T. Anderson, A. KrishnamurthyProc. of IMC, 2010.

Retaining Sandbox Containment Despite Bugs in Privileged Memory-safe Code

J. Cappos, A. Dadgar, J. Rasley, J. Samuel, I. Beschastnikh, C. Barsan, A. Krishnamurthy, T. AndersonProc. of CCS, 2010.

Reverse Traceroute

E. Katz-Bassett, H. Madhyastha, V. Adhikari, C. Scott, J. Sherry, P. Wessep, T. Anderson, A. KrishnamurthyProc. of NSDI, 2010.

Searching the searchers using SearchAudit

J. John, F. Yu, Y. Xie, M. Abadi, A. KrishnamurthyProc. of Usenix Security, 2010.

An End to the Middle

C. Dixon, A. Krishnamurthy, T. AndersonProc. of HotOS, 2009.

iPlane Nano: Path Prediction for Peer-to-Peer Applications

H. Madhyastha, E. Katz-Bassett, T. Anderson, A. Krishnamurthy, A. VenkataramaniProc. of NSDI, 2009.

Moving Beyond End-to-End Path Information to Optimize CDN Performance

R. Krishnan, H. Madhyastha, S. Srinivasan, S. Jain, A. Krishnamurthy, T. Anderson, J. GaoProc. of IMC, 2009.

Pitfalls for ISP-friendly P2P Design

M. Piatek, H. Madhyastha, J. John, A. Krishnamurthy, T. AndersonProc. of Hotnets, 2009.

Seattle: The Internet as a Testbed

J. Cappos, I. Beschastnikh, A. Krishnamurthy, T. AndersonProc. of SIGCSE, 2009.

Studying Spamming Botnets using Botlab

J. John, A. Moshchuk, S. Gribble, A. KrishnamurthyProc. of NSDI, 2009.

Consensus routing: the Internet as a distributed system

J. John, E. Katz-Bassett, A. Krishnamurthy, T. Anderson, A. VenkataramaniProc. of NSDI, 2008.

One hop Reputations for Peer to Peer File Sharing Workloads

M. Piatek, T. Isdal, A. Krishnamurthy, T. AndersonProc. of NSDI, 2008.

P4P: Provider Portal for (P2P) Applications

H. Xie, R. Yang, A. Krishnamurthy, Y. Liu, A. SilberschatzProc. of Sigcomm, 2008.

Phalanx: Withstanding multimillion-node botnets

C. Dixon, T. Anderson, A. KrishnamurthyProc. of NSDI, 2008.

Privacy-Preserving Location Tracking of Lost or Stolen Devices: Cryptographic Techniques and Replacing Trusted Third Parties with DHTs

T. Ristenpart, G. Maganis, A. Krishnamurthy, T. KohnoProc. of Usenix Security, 2008.

Studying blackholes in the Internet with Hubble

E. Katz-Bassett, H. Madhyastha, J. John, A. Krishnamurthy, D. Wetherall, T. AndersonNSDI, 2008.

A case for holistic incentive design

M. Piatek, T. Anderson, A. KrishnamurthyProc. of FuDiCo, 2007.

Building BitTyrant and a (More) Strategic BitTorrent Client

M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, A. Venkataramani;login:, 2007.

Do incentives build robustness in BitTorrent?

M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, A. VenkataramaniProc. of NSDI, 2007.

Leveraging BitTorrent for End Host Measurements

T. Isdal, M. Piatek, A. Krishnamurthy, T. AndersonProc. of PAM, 2007.

Profiling a million user DHT

J. Falkner, M. Piatek, J. John, A. Krishnamurthy, T. AndersonProc. of IMC, 2007.

Do incentives build robustness in BitTorrent?

M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, A. VenkataramaniProc. of the 4th USENIX Symp. on Networked Systems Design and Implementation (NSDI), 2007. Best student paper award.

A Structural Approach to Latency Prediction

H. Madhyastha, T. Anderson, A. Krishnamurthy, N. Spring, A. VenkataramaniProc. of IMC, 2006.

iPlane: An Information Plane for Distributed Services

H. Madhyastha, T. Isdal, M. Piatek, C. Dixon, T. Anderson, A. Krishnamurthy, A. VenkataramaniProc. of OSDI, 2006.

Oasis: An Overlay-Aware Network Stack

H. Madhyastha, A. Venkataramani, A. Krishnamurthy, T. AndersonOperating Systems Review, 2006.

Optimal Capacity Sharing of Network with Multiple Overlays

Z. Ma, J. Chen, R. Yang, A. KrishnamurthyProc. of IWQoS, 2006.

PCP: Efficient Endpoint Congestion Control

T. Anderson, A. Collins, A. Krishnamurthy, J. ZahorjanProc. of NSDI, 2006.

Secure Routing

I. Avramopoulos, H. Kobayashi, A. Krishnamurthy, R. WangNetwork Security and Wiley, 2006.

Towards IP Geolocation using Delay and Topology Measurements

E. Katz-Bassett, J. John, A. Krishnamurthy, D. Wetherall, T. Anderson, Y. ChawatheProc. of IMC, 2006.

A Collision Model for Randomized Routing in Fat-Tree Networks

V. Strumpen, A. KrishnamurthyJournal of Parallel and Distributed Computing, 2005.

Bridging the digital divide: storage media + postal network = generic high-b/w communication

N. Garg, S. Sobti, F. Zheng,  J.Lai, K. Li, A. Krishnamurthy, R. WangACM Transactions on Storage Systems, 2005.

Brushwood: Distributed Trees in Peer-to-Peer Systems

C. Zhang, A. Krishnamurthy, R. WangProc. of IPTPS, 2005.

Combining Flexibility and Scalability in a Peer-to-Peer Publish/Subscribe System

C. Zhang, A. Krishnamurthy, R. WangProc. of Middleware, 2005.

Network Localization in Partially Localizable Networks

D. Goldenberg, A. Krishnamurthy, W. Maness, R. Yang, A. Young, A. SavvidesProc. of Infocom, 2005.

Stable Route Selection for Interdomain Traffic Engineering

R. Yang, H. Xie, H. Wang, L. Li, Y. Liu, A. Silberschatz, A. KrishnamurthyIEEE Network, 2005.

A Transport Layer Approach for Improving End-to-End Performance Using Redundant Paths

M. Zhang, J. Lai, A. Krishnamurthy, L. Peterson, R. WangProc. of Usenix Annual Technical Conference, 2004.

Highly Secure and Efficient Routing

I. Avramopoulos, H. Kobayashi, R. Wang, A. KrishnamurthyProc. of Infocom, 2004.

Load Balancing and Locality in Range-Queriable Data Structures

J. Aspnes, J. Kirsch, A. KrishnamurthyProc. of PODC, 2004.

Managing a Portfolio of Overlay Paths

D. Antonova, A. Krishnamurthy, Z. Ma, R. SundaramProc. of NOSSDAV, 2004.

Network-Embedded Programmable Storage and Its Applications

S. Sobti, J. Lai, Y. Shao, N. Garg, C. Zhang, F. Zheng, A. Krishnamurthy, R. WangProc. of IFIP Conference on Networking, 2004.

Overlay Mesh Construction Using Interleaved Spanning Trees

A. Young, J. Chen, Z. Ma, A. Krishnamurthy, L. Peterson, R. WangProc. of Infocom, 2004.

Segank: A Distributed Mobile Storage System

S. Sobti, N. Garg, F. Zheng, J. Lai, A. Krishnamurthy, R. WangProc. of FAST, 2004.

Turning the Postal System into a Generic Digital Communication Mechanism

R. Wang, N. Garg, S. Sobti, E. Ziskind, J. Lai, A. KrishnamurthyProc. of Sigcomm, 2004.

Approximation and Collusion in Multicast Cost Sharing

A. Archer, J. Feigenbaum, A. Krishnamurthy, R. Sami, S. ShenkerGames and Economic Behavior, 2003.

Considering the Energy Consumption of Mobile Storage Alternatives

F. Zheng, S. Sobti, N. Garg, C. Zhang, A. Krishnamurthy, R. WangProc. of IEEE Symposium on Modeling Analysis and Simulation of Computer Systems, 2003.

Exploiting Bias in the Hysteresis Bit of 2-bit Saturating Counters in Branch Predictors

G. Loh, D. Henry, A. KrishnamurthyJournal of Instruction Level Parallelism, 2003.

Hardness results for multicast cost sharing

J. Feigenbaum, A. Krishnamurthy, R. Sami, S. ShenkerTheoretical Computer Science, 2003.

Modeling Hard Disk Power Consumption

J. Zedlewski, S. Sobti, N. Garg, A. Krishnamurthy, R. WangProc. of FAST, 2003.

Polynomial-time algorithms for enforcing sequential consistency in SPMD programs with arrays

W. Chen, A. Krishnamurthy, K. YelickProc. of Languages and Compilers for Parallel Computing, 2003.

Configuring and Scheduling an Eager-Writing Disk Array

C. Zhang, X. Yu, A. Krishnamurthy, R. WangProc. of FAST, 2002.

PersonalRAID: Mobile Storage for Distributed and Disconnected Computers

S. Sobti, N. Garg, X. Yu, C. Zhang, A. Krishnamurthy, R. WangProc. of FAST, 2002.

Probabilistic Packet Scheduling: Achieving Proportional Bandwidth Allocation

M. Zhang, R. Wang, L. Peterson, A. KrishnamurthyProc. of Infocom, 2002.

Approximation and Collusion in Multicast Cost Sharing

J. Feigenbaum, A. Krishnamurthy, R. Sami, S. ShenkerProc. of ACM Conference on E-Commerce, 2001.

Trading Capacity for Performance in Disk Array

X. Yu, R. Wang, K. Li, A. Krishnamurthy, T. AndersonProc. of OSDI, 2000.

Modeling Communication Pipeline Latency

R. Wang, A. Krishnamurthy, R. Martin, T. Anderson, D. CullerProc. of SIGMETRICS, 1998.

Titanium: A High-Performance Java Dialect

K.A. al.Proc. of ACM Workshop on Java for High-Performance Network Computing. Also in Concurrency: Practice and Experience, 1998.

Analyses and Optimizations for Shared Address Space Programs

A. Krishnamurthy, K. YelickJournal of Parallel and Distributed Computation, 1996.

Evaluation of Architectural Support for Global Address-Based Communication in Large Scale Parallel Machines

A. Krishnamurthy, K. Schauser, C. Scheiman, R. Wang, D. Culler, K. YelickProc. of ASPLOS, 1996.

Efficient Parallel Algorithms for Permutation Graphs

A. Krishnamurthy, V. Kamakoti, C.P. RanganJournal of Parallel and Distributed Computing, 1995.

Empirical Evaluation of the CRAY-T3D: A Compiler Perspective

R. Arpaci, D. Culler, A. Krishnamurthy, S. Steinberg, K. YelickProc. of ISCA, 1995.

Optimizing Parallel Programs with Explicit Synchronization

A. Krishnamurthy, K. YelickProc. of PLDI, 1995.

Portable Parallel Irregular Applications.

K. Yelick, C.P. Wen, S. Chakrabarti, E. Deprit, J. Jones, A. KrishnamurthyProc. of Workshop on Parallel Symbolic Languages and Systems, 1995.

Runtime Support for Portable Distributed Data Structures

C.P. Wen, S. Chakrabarti, E. Deprit, A. Krishnamurthy, K. YelickProc. of Workshop on Languages Compilers and and Runtime Systems for Scalable Computers, 1995.

Towards Modeling the Performance of a Fast Connected Components Algorithm on Parallel Machines

S. Lumetta, A. Krishnamurthy, D. CullerProc. of Supercomputing, 1995.

Connected Components on Distributed Memory Machines

A. Krishnamurthy, S. Lumetta, D. Culler, K. YelickProc. of Parallel Algorithms Dimacs Series in Discrete Mathematics and Theoretical Computer Science, 1994.

Optimizing Parallel SPMD Programs

A. Krishnamurthy, K. YelickProc. of Workshop on Languages and Compilers for Parallel Computing, 1994.

Connected domination and Steiner set on Weighted Permutation Graphs

A. Krishnamurthy, C.P. RanganInformation Processing Letters, 1993.

Data Structures for Irregular Applications

K. Yelick, S. Chakrabarti, E. Deprit, J. Jones, A. Krishnamurthy, C.P. WenProc. of DIMACS Workshop on Parallel Algorithms for Unstructured and Dynamic Problems, 1993.

Parallel Programming in Split-C

D. Culler, A. Dusseau, S. Goldstein, A. Krishnamurthy, S. Lumetta, T. Eicken, K. YelickProc. of Supercomputing, 1993.