A Discreet, Fault-Tolerant, and Scalable Software Architectural Style for Internet-Sized Networks

Authors:
Yuriy Brun
Affiliations:
University of Southern California, Los Angeles, USA
Venue:
ICSE COMPANION '07 Companion to the proceedings of the 29th International Conference on Software Engineering
Year:
2007

Citing 3
Cited 3

Foundations for the study of software architecture

ACM SIGSOFT Software Engineering Notes
Introduction to the Theory of Computation

Introduction to the Theory of Computation
Arithmetic computation in the tile assembly model: Addition and multiplication

Theoretical Computer Science

Fault and adversary tolerance as an emergent property of distributed systems' software architectures

Proceedings of the 2007 workshop on Engineering fault tolerant systems
Nondeterministic polynomial time factoring in the tile assembly model

Theoretical Computer Science
Solving NP-complete problems in the tile assembly model

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Large networks, such as the Internet, pose an ideal medium for solving computationally intensive problems, such as NP-complete problems, yet no well-scaling architecture for Internet-sized systems exists. I propose a software architectural style for large networks, based on a formal mathematical study of crystal growth that will exhibit properties of (1) discreetness (nodes on the network cannot learn the algorithm or input of the computation), (2) fault-tolerance (malicious, faulty, and unstable nodes cannot break the computation), and (3) scalability (communication among the nodes does not increase with network or problem size). I plan to evaluate the style both theoretically and empirically for these three properties.