Models For Dependable Computation with Multiple Inputs and Some Hardness Results

We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR graphs to model fault tolerant computations with multiple inputs. While there is a polynomial time algorithm for finding vertex disjoint paths in networks, we will show that the equivalent problem in computation systems with multiple inputs is NP-hard. Our main results are as follows. (1) We present a general model for fault tolerant computation systems with multiple inputs: AND/OR graphs. (2) We show that it is NP-hard to find two vertex disjoint solution graphs in an AND/OR graph. It follows that in the general case redundancy cannot help to achieve survivability, assuming P≠NP.

[1]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[2]  Doug Riecken.  Intelligent agents , 1994, CACM.

[3]  Vassos Hadzilacos,et al.  Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing) , 1985 .

[4]  Fred B. Schneider,et al.  Towards Fault-Tolerant and Secure Agentry , 1997, WDAG.

[5]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[6]  Yehoshua Perl,et al.  Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph , 1978, JACM.

[7]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[8]  Matthew K. Franklin,et al.  Reliable Communication over Partially Authenticated Networks , 1997, WDAG.

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Yongge Wang,et al.  Using Approximation Hardness to Achieve Dependable Computation , 1998, RANDOM.

[11]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Alexander Schrijver,et al.  Paths, Flows, and VLSI-Layout , 1990 .

[13]  Danny Dolev,et al.  The Byzantine Generals Strike Again , 1981, J. Algorithms.

[14]  Karsten Weihe,et al.  A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs , 1993, ESA.

[15]  Michael K. Reiter,et al.  Path independence for authentication in large-scale systems , 1997, CCS '97.

[16]  Philip Heidelberger,et al.  Fast Simulation of Highly Dependable Systems with General Failure and Repair Processes , 1993, IEEE Trans. Computers.

[17]  Matthew K. Franklin,et al.  Reliable Communication over Partially Authenticated Networks , 1999, Theor. Comput. Sci..

[18]  Moti Yung,et al.  Perfectly secure message transmission , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[19]  Peter G. Neumann,et al.  Are dependable systems feasible? , 1993, CACM.

[20]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..