Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Improving Distributed Application Reliability with End-to-End Datapath Tracing

George Porter

EECS Department
University of California, Berkeley
Technical Report No. UCB/EECS-2008-68
May 22, 2008

http://www.eecs.berkeley.edu/Pubs/TechRpts/2008/EECS-2008-68.pdf

Modern Internet applications are both powerful and highly interactive, but creating and operating them requires new approaches to the software development, deployment, and debugging processes. Applications like Google Maps, Facebook, and Map/Reduce must run continuously, handle millions of concurrent requests, and scale by taking advantage of the massive amounts of parallelism available in large-scale Internet datacenters. When a failure occurs, discovering the exact set of machines and resources responsible, as well as the location among those resources where the failure occurred, is a daunting task. The lack of visibility into these distributed systems prevents their reliable operation. To improve distributed system visibility, we have developed an integrated tracing framework called X-Trace. A user or operator invokes X-Trace when initiating an application task (e.g., a web request), by inserting X-Trace metadata with a task identifier in the resulting request. This metadata is then propagated down to lower layers through protocol interfaces (which may need to be modified to carry X-Trace metadata), and also along all recursive requests that result from the original task (by modified software stacks). The X-Trace infrastructure makes use of this metadata to build a task graph, which represents a trace of the execution of the distributed application. Using these recovered task graphs, we have been able to identify correctness and performance bugs in a wide variety of distributed applications, from web and overlay applications, to the Hadoop Map/Reduce system. In this work, we present the design and implementation of X-Trace, show its application to the 802.1X network authentication protocol, and then present an API and software tool for manipulating large-scale network traces in a scalable manner.

Advisor: Randy H. Katz


BibTeX citation:

@phdthesis{Porter:EECS-2008-68,
    Author = {Porter, George},
    Title = {Improving Distributed Application Reliability with End-to-End Datapath Tracing},
    School = {EECS Department, University of California, Berkeley},
    Year = {2008},
    Month = {May},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2008/EECS-2008-68.html},
    Number = {UCB/EECS-2008-68},
    Abstract = {Modern Internet applications are both powerful and highly interactive, but creating and operating them requires new approaches to the software development, deployment, and debugging processes.  Applications like Google Maps, Facebook, and Map/Reduce must run continuously, handle millions of concurrent requests, and scale by taking advantage of the massive amounts of parallelism available in large-scale Internet datacenters.  When a failure occurs, discovering the exact set of machines and resources responsible, as well as the location among those resources where the failure occurred, is a daunting task.  The lack of visibility into these distributed systems prevents their reliable operation.

To improve distributed system visibility, we have developed an integrated tracing framework called X-Trace.  A user or operator invokes X-Trace when initiating an application task (e.g., a web request), by inserting X-Trace metadata with a task identifier in the resulting request.  This metadata is then propagated down to lower layers through protocol interfaces (which may need to be modified to carry X-Trace metadata), and also along all recursive requests that result from the original task (by modified software stacks).  The X-Trace infrastructure makes use of this metadata to build a task graph, which represents a trace of the execution of the distributed application.  Using these recovered task graphs, we have been able to identify correctness and performance bugs in a wide variety of distributed applications, from web and overlay applications, to the Hadoop Map/Reduce system.  In this work, we present the design and implementation of X-Trace, show its application to the 802.1X network authentication protocol, and then present an API and software tool for manipulating large-scale network traces in a scalable manner.}
}

EndNote citation:

%0 Thesis
%A Porter, George
%T Improving Distributed Application Reliability with End-to-End Datapath Tracing
%I EECS Department, University of California, Berkeley
%D 2008
%8 May 22
%@ UCB/EECS-2008-68
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/2008/EECS-2008-68.html
%F Porter:EECS-2008-68