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

Student: Yuriy Brun, USC

Advisor: Nenad Medvidovic, USC/ISR

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 computational Internet-sized systems exists. We 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 may not break the computation), and (3) scalability (communication among the nodes does not increase with network or problem size).

Bio:

Yuriy Brun is a Ph.D. student studying Computer Science at the University of Southern California (USC). Yuriy is working on distributing computation over large networks in a secure and discreet manner. Yuriy's interests lie in novel models of computation, such as self-assembly and DNA computation, and applying these formal models to building robust software systems. Yuriy holds a Master of Science degree in Computer Science from USC (2005) and a Master of Engineering degree in Electrical Engineering and Computer Science from MIT (2003), as well as Bachelors of Science degrees in Mathematics and Computer Science from MIT (2003).