DART: Distributed Automated Regression Testing for Large-Scale Network Applications

This paper presents DART, a framework for distributed automated regression testing of large-scale network applications. DART provides programmers writing distributed applications with a set of primitives for writing distributed tests and a runtime that executes distributed tests in a fast and efficient manner over a network of nodes. It provides a programming environment, scripted execution of multi-node commands, fault injection, and performance anomaly injection. We have implemented a prototype implementation of DART that implements a useful subset of the DART architecture and is targeted at the Emulab network emulation environment. Our prototype is functional, fast, and is currently being used to test the correctness, robustness, and performance of PIER, a distributed relational query processor.

[1]  Remzi H. Arpaci-Dusseau,et al.  Performance availability for networks of workstations , 1999 .

[2]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[3]  Amin Vahdat,et al.  GLUix: a global layer unix for a network of workstations , 1998 .

[4]  Emin Gün Sirer,et al.  The design and implementation of a next generation name service for the internet , 2004, SIGCOMM.

[5]  Robert Tappan Morris,et al.  Experience with an evolving overlay network testbed , 2003, CCRV.

[6]  Robert Tappan Morris,et al.  Resilient overlay networks , 2001, SOSP.

[7]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[8]  John Kubiatowicz,et al.  Handling Churn in a DHT (Awarded Best Paper!) , 2004, USENIX Annual Technical Conference, General Track.

[9]  Prashant J. Shenoy,et al.  Cello: A Disk Scheduling Framework for Next Generation Operating Systems* , 1998, SIGMETRICS '98/PERFORMANCE '98.

[10]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[11]  William E. Weihl,et al.  Lottery scheduling: flexible proportional-share resource management , 1994, OSDI '94.

[12]  Mike Hibler,et al.  An integrated experimental environment for distributed systems and networks , 2002, OSDI '02.

[13]  David E. Culler,et al.  A blueprint for introducing disruptive technology into the Internet , 2003, CCRV.

[14]  Larry L. Peterson,et al.  The dark side of the Web , 2004, Comput. Commun. Rev..

[15]  Scott Shenker,et al.  Querying the Internet with PIER , 2003, VLDB.

[16]  Larry L. Peterson,et al.  Sophia: an Information Plane for networked systems , 2004, Comput. Commun. Rev..

[17]  Amin Vahdat,et al.  GLUix: a global layer unix for a network of workstations , 1998, Softw. Pract. Exp..

[18]  David A. Patterson,et al.  Towards a framework for automated robustness evaluation of distributed services , 2022 .

[19]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[20]  Luigi Rizzo,et al.  Dummynet and Forward Error Correction , 1998, USENIX Annual Technical Conference.

[21]  Krishna P. Gummadi,et al.  Measuring and analyzing the characteristics of Napster and Gnutella hosts , 2003, Multimedia Systems.

[22]  Randy H. Katz,et al.  OverQoS: An Overlay Based Architecture for Enhancing Internet QoS , 2004, NSDI.

[23]  Robert Tappan Morris,et al.  Ivy: a read/write peer-to-peer file system , 2002, OSDI '02.

[24]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[25]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.

[26]  Ben Y. Zhao,et al.  Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .

[27]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[28]  Randy H. Katz,et al.  OverQoS: offering Internet QoS using overlays , 2003, CCRV.

[29]  David Mazières,et al.  Democratizing Content Publication with Coral , 2004, NSDI.

[30]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[31]  Kent L. Beck,et al.  Extreme programming explained - embrace change , 1990 .

[32]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

[33]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[34]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[35]  Steven M. Hand,et al.  Self-paging in the Nemesis operating system , 1999, OSDI '99.

[36]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[37]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.