David G. Andersen

Srinivasan Seshan, Konstantina Papagiannaki, David G. Andersen, 2011, 2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011).

Link-alike: using wireless to share network resources in a neighborhood

Srinivasan Seshan, Konstantina Papagiannaki, David G. Andersen, 2009, MOCO.

Measurement and Analysis of TCP Throughput Collapse in Cluster-based Storage Systems

Srinivasan Seshan, Amar Phanishayee, Gregory R. Ganger, 2008, FAST.

Order-Preserving Key Compression for In-Memory Search Trees

Kimberly Keeton, David G. Andersen, Michael Kaminsky, 2020, SIGMOD Conference.

Cicada: Dependably Fast Multi-Core In-Memory Transactions

Hyeontaek Lim, David G. Andersen, Michael Kaminsky, 2017, SIGMOD Conference.

A (In)Cast of Thousands: Scaling Datacenter TCP to Kiloservers and Gigabits

Amar Phanishayee, Gregory R. Ganger, David G. Andersen, 2009 .

Using vector interfaces to deliver millions of IOPS from a networked key-value storage server

David G. Andersen, Michael Kaminsky, Vijay Vasudevan, 2012, SoCC '12.

Using RDMA efficiently for key-value services

David G. Andersen, Michael Kaminsky, Anuj Kalia, 2015, SIGCOMM 2015.

Scaling Video Analytics on Constrained Edge Nodes pdf

Hyeontaek Lim, David G. Andersen, Michael Kaminsky, 2019, MLSys.

Exact pattern matching with feed-forward bloom filters

David G. Andersen, Iulian Moraru, 2012, JEAL.

Grand Challenge: Critical Networking Infrastructure in a Suitcase

David G. Andersen, 2005 .

Dynamically reconfigurable hybrid optical / electrical networks for high-bandwidth data centers

Madeleine Glick, David G. Andersen, Michael Kaminsky, 2009, 2009 IEEE Avionics, Fiber-Optics and Phototonics Technology Conference.

Mainstream: Dynamic Stem-Sharing for Multi-Tenant Video Processing

Gregory R. Ganger, David G. Andersen, Michael Kaminsky, 2018, USENIX Annual Technical Conference.

Scaling Up Clustered Network Appliances with ScaleBricks

Dong Zhou, Bin Fan, Hyeontaek Lim, 2015, SIGCOMM.

Building a Bw-Tree Takes More Than Just Buzz Words

Ziqi Wang, Viktor Leis, Hyeontaek Lim, 2018, SIGMOD Conference.

Design of a Write-Optimized Data Store

Karsten Schwan, Hrishikesh Amur, David G. Andersen, 2013 .

Exact pattern matching with feed-forward bloom filters

David G. Andersen, Iulian Moraru, D. Andersen, 2011, JEAL.

Putting the "Micro" Back in Microservice

David G. Andersen, Michael Kaminsky, Anuj Kalia, 2018, USENIX Annual Technical Conference.

Quantifying interactive user experience on thin clients

Mahadev Satyanarayanan, David G. Andersen, Niraj Tolia, 2006, Computer.

Scaling all-pairs overlay routing

Yang Zhang, David R. Karger, Amar Phanishayee, 2009, CoNEXT '09.

High availability in cheap distributed key value storage

Gregory R. Ganger, David G. Andersen, Michael Kaminsky, 2020, SoCC.

Resilient overlay networks

Robert Tappan Morris, M. Frans Kaashoek, David G. Andersen, 2001, SOSP.

The seductive appeal of thin clients

David G. Andersen, Niraj Tolia, M. Satyanarayanan, 2005 .

Succinct Range Filters

Viktor Leis, Hyeontaek Lim, David G. Andersen, 2019, SGMD.

Safe and effective fine-grained TCP retransmissions for datacenter communication

Amar Phanishayee, Gregory R. Ganger, David G. Andersen, 2009, SIGCOMM '09.

Switching the optical divide: fundamental challenges for hybrid electrical/optical datacenter networks

Amin Vahdat, Hamid Hajabdolali Bazzaz, David G. Andersen, 2011, SoCC.

Architecting to achieve a billion requests per second throughput on a single key-value store server platform

Pradeep Dubey, Sukhan Lee, O Seongil, 2015, 2015 ACM/IEEE 42nd Annual International Symposium on Computer Architecture (ISCA).

Memory-efficient groupby-aggregate using compressed buffer trees

Karsten Schwan, Hrishikesh Amur, David G. Andersen, 2013, SoCC.

OverDoSe: A Generic DDoS Protection Service Using an Overlay Network

Elaine Shi, Ion Stoica, Adrian Perrig, 2006 .

Energy-efficient cluster computing with FAWN: workloads and implications

David G. Andersen, Michael Kaminsky, Lawrence Tan, 2010, e-Energy.

Workload analysis and caching strategies for search advertising systems

Qiang Fu, Sameh Elnikety, Yuxiong He, 2017, SoCC.

SILT: a memory-efficient, high-performance key-value store

Bin Fan, Hyeontaek Lim, David G. Andersen, 2011, SOSP.

What the protocol stack missed: the transfer service

David G. Andersen, Michael Kaminsky, Niraj Tolia, 2005, SOSP '05.

Consistent, durable, and safe memory management for byte-addressable non volatile main memory

Parthasarathy Ranganathan, David G. Andersen, Michael Kaminsky, 2013, TRIOS@SOSP.

Cuckoo index

Peter Boncz, Andreas Kipf, David G. Andersen, 2020, VLDB 2020.

Algorithmic improvements for fast concurrent Cuckoo hashing

Xiaozhou Li, Michael J. Freedman, David G. Andersen, 2014, EuroSys '14.

CLAMP: Practical Prevention of Large-Scale Data Leaks

Adrian Perrig, Jonathan M. McCune, Bryan Parno, 2009, 2009 30th IEEE Symposium on Security and Privacy.

Experience with an evolving overlay network testbed

Robert Tappan Morris, Hari Balakrishnan, M. Frans Kaashoek, 2003, CCRV.

Report of the NSF Workshop on Research Challenges in Distributed Computer Systems

Amin Vahdat, Ion Stoica, Andrew C. Myers, 2005 .

Learning to Protect Communications with Adversarial Neural Cryptography pdf

Martín Abadi, David G. Andersen, Martín Abadi, 2016, ArXiv.

Stronger properties for low-latency geo-replicated storage.

Michael J. Freedman, David G. Andersen, Michael Kaminsky, 2014 .

EDF: Ensemble, Distill, and Fuse for Easy Video Labeling pdf

Subramanya Dulloor, David G. Andersen, Michael Kaminsky, 2018, ArXiv.

Proceedings of Usits '03: 4th Usenix Symposium on Internet Technologies and Systems Mayday: Distributed Filtering for Internet Services

David G. Andersen, D. Andersen, 2022 .

When Cycles Are Cheap, Some Tables Can Be Huge

Dong Zhou, Bin Fan, Hyeontaek Lim, 2013, HotOS.

Balancing throughput, robustness, and in-order delivery in P2P VoD

Konstantina Papagiannaki, Bin Fan, David G. Andersen, 2010, Co-NEXT '10.

Towards Accurate and Fast Evaluation of Multi-Stage Log-structured Designs

Hyeontaek Lim, David G. Andersen, Michael Kaminsky, 2016, FAST.

Accountable Internet Protocol

Nick Feamster, Teemu Koponen, David G. Andersen, 2008 .

The Network Testbed Mapping Problem

David G. Andersen, Stephen Schwab, Rick McGeer, 2010, TRIDENTCOM.

Communication Efficient Distributed Machine Learning with the Parameter Server

Alexander J. Smola, Mu Li, Kai Yu, 2014, NIPS.

Measuring the effects of internet path faults on reactive routing

Nick Feamster, Hari Balakrishnan, M. Frans Kaashoek, 2003, SIGMETRICS '03.

Cuckoo Filter: Better Than Bloom

Bin Fan, David G. Andersen, Michael Kaminsky, 2013, login Usenix Mag..

Topology inference from BGP routing dynamics

Nick Feamster, Hari Balakrishnan, David G. Andersen, 2002, IMW '02.

Technical perspective: A whitebox solution for blackbox-like behaviors

David G. Andersen, 2019, Commun. ACM.

Better Caching in Search Advertising Systems with Rapid Refresh Predictions

Qiang Fu, Sameh Elnikety, Yuxiong He, 2018, WWW.

Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination

Minjia Zhang, Yuxiong He, David G. Andersen, 2020, SIGMOD Conference.

The hare and the tortoise: taming wireless losses by exploiting wired reliability

Srinivasan Seshan, Konstantina Papagiannaki, David G. Andersen, 2011, MobiHoc '11.

Don't settle for eventual: scalable causal consistency for wide-area storage with COPS

Michael J. Freedman, David G. Andersen, Michael Kaminsky, 2011, SOSP.

8th USENIX Symposium on Networked Systems Design and Implementation (NSDI '11)

Remzi H. Arpaci-Dusseau, Bruce M. Maggs, Eddie Kohler, 2010 .

Cuckoo Linear Algebra

Alexander J. Smola, Li Zhou, Mu Li, 2015, KDD.

Resilient overlay networks

Hari Balakrishnan, M. Frans Kaashoek, David G. Andersen, 2001, SOSP.

Improving end-to-end availability using overlay networks

David G. Andersen, D. Andersen, 2004 .

Raising the Bar for Using GPUs in Software Packet Processing

Dong Zhou, David G. Andersen, Michael Kaminsky, 2015, NSDI.

cSamp: A System for Network-Wide Flow Monitoring

Walter Willinger, Vyas Sekar, Ramana Rao Kompella, 2008, NSDI.

Practical Batch-Updatable External Hashing with Sorting

Hyeontaek Lim, David G. Andersen, Michael Kaminsky, 2013, ALENEX.

Don’t Settle for Eventual Consistency

Michael J. Freedman, David G. Andersen, Michael Kaminsky, 2014 .

Ditto: a system for opportunistic caching in multi-hop wireless networks

Amar Phanishayee, Olatunji Ruwase, Himabindu Pucha, 2008, MobiCom '08.

SplitScreen: Enabling efficient, distributed malware detection

David Brumley, Jiyong Jang, David G. Andersen, 2010, Journal of Communications and Networks.

Himabindu Pucha, David G. Andersen, Michael Kaminsky, 2010, 2010 Proceedings IEEE INFOCOM.

Small cache, big effect: provable load balancing for randomly partitioned cluster services

Bin Fan, Hyeontaek Lim, David G. Andersen, 2011, SoCC.

Stronger Semantics for Low-Latency Geo-Replicated Storage

Michael J. Freedman, David G. Andersen, Michael Kaminsky, 2013, NSDI.

Improving web availability for clients with MONET

Hari Balakrishnan, M. Frans Kaashoek, David G. Andersen, 2005, NSDI.

FAWN: A Fast Array of Wimpy Nodes (CMU-PDL-08-108)

Amar Phanishayee, David G. Andersen, Lawrence Tan, 2008 .

Flex-KV: enabling high-performance and flexible KV systems

Amar Phanishayee, Himabindu Pucha, David G. Andersen, 2012 .

Himabindu Pucha, David G. Andersen, Michael Kaminsky, 2007, NSDI.

Design Guidelines for High Performance RDMA Systems

David G. Andersen, Michael Kaminsky, Anuj Kalia, 2016, USENIX ATC.

FAWN: a fast array of wimpy nodes

Amar Phanishayee, David G. Andersen, Michael Kaminsky, 2011, Commun. ACM.

An empirical evaluation of entropy-based traffic anomaly detection

Vyas Sekar, David G. Andersen, Hui Zhang, 2008, IMC '08.

Cuckoo index

Peter Boncz, Alexander Hall, Andreas Kipf, 2020, Proc. VLDB Endow..

XIA: Efficient Support for Evolvable Internetworking

Srinivasan Seshan, Aditya Akella, Wenfei Wu, 2012, NSDI.

Proceedings of the 8th USENIX conference on Networked systems design and implementation

Sylvia Ratnasamy, David G. Andersen, D. Andersen, 2011, NSDI 2011.

On application-level approaches to avoiding TCP throughput collapse in cluster-based storage systems

Srinivasan Seshan, Amar Phanishayee, Gregory R. Ganger, 2007, PDSW '07.

Efficiency Through Eavesdropping: Link-layer Packet Caching

Alex C. Snoeren, David G. Andersen, Mikhail Afanasyev, 2008, NSDI.

XIA: architecting a more trustworthy and evolvable internet

Srinivasan Seshan, Jon M. Peha, Dong Zhou, 2014, CCRV.

Fine-Grained Failover Using Connection Migration

Hari Balakrishnan, Alex C. Snoeren, David G. Andersen, 2001, USITS.

Holding the Internet Accountable

Nick Feamster, Hari Balakrishnan, Scott Shenker, 2007, HotNets.

NetMemex: Providing Full-Fidelity Traffic Archival pdf

Vyas Sekar, Hyeontaek Lim, David G. Andersen, 2016, ArXiv.

c-Through: part-time optics in data centers

Konstantina Papagiannaki, David G. Andersen, Guohui Wang, 2010, SIGCOMM 2010.

Lightweight Preemptible Functions

David G. Andersen, Michael Kaminsky, Anuj Kalia, 2020, USENIX Annual Technical Conference.

Perspectives: Improving SSH-style Host Authentication with Multi-Path Probing

Adrian Perrig, David G. Andersen, Dan Wendlandt, 2008, USENIX Annual Technical Conference.

There is more consensus in Egalitarian parliaments

David G. Andersen, Michael Kaminsky, Iulian Moraru, 2013, SOSP.

Accountable internet protocol (aip)

Nick Feamster, Hari Balakrishnan, Scott Shenker, 2008, SIGCOMM '08.

Challenges and Opportunities in Internet Data Mining (CMU-PDL-06-102)

Nick Feamster, David G. Andersen, D. Andersen, 2006 .

FAWNdamentally Power-efficient Clusters

Amar Phanishayee, David G. Andersen, Michael Kaminsky, 2009, HotOS.

Cuckoo Filter: Practically Better Than Bloom

Bin Fan, David G. Andersen, Michael Kaminsky, 2014, CoNEXT.

FAWN: a fast array of wimpy nodes

Amar Phanishayee, David G. Andersen, Michael Kaminsky, 2009, SOSP '09.

Paxos Quorum Leases: Fast Reads Without Sacrificing Writes

David G. Andersen, Michael Kaminsky, Iulian Moraru, 2014, SoCC.

Don't Secure Routing Protocols, Secure Data Delivery

Jennifer Rexford, David G. Andersen, Dan Wendlandt, 2006, HotNets.

Be Fast, Cheap and in Control with SwitchKV

Xiaozhou Li, Michael J. Freedman, David G. Andersen, 2016, NSDI.

Article Summaries

George Roussos, Luca Chittaro, Parthasarathy Ranganathan, 2006, Computer.

XIA: an architecture for an evolvable and trustworthy internet

Srinivasan Seshan, Aditya Akella, Wenfei Wu, 2011, HotNets-X.

Challenges and opportunities for efficient computing with FAWN

David G. Andersen, Michael Kaminsky, Lawrence Tan, 2011, OPSR.

Using Indirect Routing to Recover from Network Traffic Scheduling Estimation Error

Srinivasan Seshan, Alex C. Snoeren, David G. Andersen, 2017, 2017 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

Theoretical Approaches to Node Assignment

David G. Andersen, D. Andersen, 2002 .

Scalable, high performance ethernet forwarding with CuckooSwitch

Dong Zhou, Bin Fan, Hyeontaek Lim, 2013, CoNEXT.

3LC: Lightweight and Effective Traffic Compression for Distributed Machine Learning pdf

Hyeontaek Lim, David G. Andersen, Michael Kaminsky, 2018, MLSys.

The case for resilient overlay networks

Robert Tappan Morris, Hari Balakrishnan, M. Frans Kaashoek, 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.

Succinct range filters

Viktor Leis, Hyeontaek Lim, David G. Andersen, 2021, Commun. ACM.

Picking Interesting Frames in Streaming Video

Hyeontaek Lim, David G. Andersen, Michael Kaminsky, 2018 .