Dave Andersen

Latest Research

Efficient Similarity Estimation for Systems Exploiting Data Redundancy

(infocom 2010). This paper presents a new method, called Multi-Resolution Handprinting, for efficiently estimating how similar two or more files are if you break the files into variously sized chunks (1KB, 2KB, 4KB, etc.). Part of the DOT project.

Scaling All-Pairs Routing

This CoNEXT 2009 paper presents a new, more scalable all-pairs routing algorithm for use in systems such as RON.

FAWN: A Fast Array of Wimpy Nodes

This SOSP 2009 paper presents the design and implementation of the FAWN-KV scalable, power-efficient key-value cluster architecture.

Accountable Internet Protocol (AIP)

This SIGCOMM 2008 paper describes the overall AIP architecture. AIP provides a solid foundation of accountability for future Internet designs through its use of a self-certifying addressing structure. AIP greatly simplifies the task of securing additional parts of the network infrastructure.

Research

My research interests are in computer systems in the networked environment. I have a particular interest in resilient distributed systems that perform well under a variety of adverse network conditions, and in power-efficient computing.

Papers and Publications

Current Projects

• FAWN (Fast Array of Wimpy Nodes) - creating a low-power cluster architecture for data-intensive workloads.
• AIP - the Accountable Internet Protocol
• Data-Oriented Transfer (DOT)
• The Datapository - a collaborative facility for network monitoring, analysis, and data storage
• Perspectives - using multi-path probing to improve the security of SSH and SSL authentication

Older projects:

• Resilient Overlay Networks (RON)
• Multi-homed Overlay Networks (MONET)
• The Congestion Manager (CM)
• Emulab

---