A discreet, fault-tolerant, and scalable software architectural style for Internet-sized networks"/> A discreet, fault-tolerant, and scalable software architectural style for Internet-sized networks"/>
@inproceedings{Brun07icse-doc-symp,
author = {Yuriy Brun},
title =
{A
discreet, fault-tolerant, and scalable software architectural style for
{I}nternet-sized networks},
booktitle = {Proceedings of the Doctoral Symposium at the 29th International
Conference on Software Engineering (ICSE)},
venue = {ICSE DocSymp},
address = {Minneapolis, {MN}, {USA}},
month = {May},
date = {20--26},
year = {2007},
pages = {83--84},
doi = {10.1109/ICSECOMPANION.2007.12},
accept = {$\frac{11}{48} \approx 23\%$},
note = {DOI:
10.1109/ICSECOMPANION.2007.12},
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.},
}