Dave Andersen

Latest Research

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.

FAWNdamentally Power-efficient Clusters

This paper lays out the basic case for Fast Arrays of Wimpy Nodes as a way to create highly efficient cluster services. Appeared in HotOS 2009.

Access Point Localization and Mark and Sweep

(PAM2009 and IMC2008) are two papers with Dongsu Han about how to efficiently create accurate maps and characterizations of WiFi access through wardriving.

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 network measurement.

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

---