Near-Optimal Distributed Failure Circumscription

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems

Volumn 15, Issue 1, 2003, Pages 152-158

  Beal, Jacob ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Amorphous Computing; Distributed Failure Circumscription

Indexed keywords

AMORPHOUS COMPUTING; CIRCUMSCRIPTION; DISTRIBUTED FAILURE;

ALGORITHMS; GRAPH THEORY; HIERARCHICAL SYSTEMS; MOBILE COMPUTING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 1542504118     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. H. Abelson, D. Allen, D. Coore, C. Hanson, G. Homsy, T. Knight, R. Nagpal, E. Rauch, G. Sussman and R. Weiss. Amorphous Computing, AI Memo 1665, August 1999.
2. Jacob Beal. Persistent Nodes for Reliable Memory in Geographically Local Networks. MIT AI Memo 2003-011.
3. Jacob Beal. A Robust Amorphous Hierarchy from Persistent Nodes. MIT AI Memo 2003-012.
4. Eric Brewer. Towards Robust Distributed Systems. (Invited Talk) Principles of Distributed Computing, Portland, Oregon, July 2000.
5. Seth Gilbert and Nancy Lynch. Brewer's Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services. Sigact News, 33(2), June 2002.
6. Roger Khazan. Formal Design and Analysis of a New Virtually Synchronous Group Communication Service for Wide Area Networks. PhD Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, May 2002.
7. J. Kleinberg. Detecting a Network Failure. Proc. 41st IEEE Symposium on Foundations of Computer Science, 2000.
8. L. Kleinrock and J. Silvester. Optimum transmission radii for packet radio networks or why six is a magic number. Proc Natl. Telecomm. Conf. pp 4.3.1-4.3.5, 1978
9. Nancy Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, Inc, San Francisco, California, 1996. Chapter 8, pages 199-234.