Andreas Haeberlen

Rice University

Accountability for distributed systems

Social expectations play an important role in distributed systems that span multiple administrative domains. For example, participants in peer-to-peer systems are expected to contribute resources for the common good, and members of federated systems are expected to adhere to best practices and fulfill contractual obligations. However, these expectations are not always met - sometimes by mistake, sometimes to gain an advantage, and sometimes even due to a deliberate attack.

 

In society, accountability is widely used to counter such threats. Accountability incentivizes good performance, exposes faults and unwanted behavior, and builds trust between competing individuals and organizations. In this talk, I will argue that accountability is also a powerful tool in designing distributed systems.

Accountability ensures that misbehavior can be detected and linked to a faulty node. Thus, it complements fault tolerance techniques and offers an alternative to these techniques where failures do not have irrecoverable consequences - for example, in systems that provide a best-effort service.

 

I will present a set of techniques that can enforce accountability for a wide range of distributed systems, and I will show that they can detect a large and general class of faults. This class includes not only benign problems, such as bugs or misconfigurations, but also intentional misbehavior and deliberate attacks. To demonstrate that accountability is practical, I will then discuss two concrete applications, a decentralized email system and the Internet's interdomain routing system. Our evaluation results show that accountability is effective, that it has a reasonable overhead, and that it can scale to systems with a large number of nodes.

**********

Andreas Haeberlen is a Ph.D. candidate in the Department of Computer Science at Rice University and a visiting student at the Max Planck Institute for Software Systems (MPI-SWS). His current research interests include distributed systems, operating systems,  networking, and systems security. In his dissertation research, Andreas has developed novel techniques and algorithms that provide accountability for distributed systems.

 

4:15pm

B17 Upson Hall

Thursday, March 26, 2009

Refreshments at 3:45pm in the Upson 4th Floor Atrium

Computer Science

Colloquium

Spring 2009

www.cs.cornell.edu/events/colloquium