usenix conference policies
NetComplex: A Complexity Metric for Networked System Designs
Abstract:
The systems and networking community treasures “simple” system designs, but our evaluation of system simplicity often relies more on intuition and qualitative discussion than rigorous quantitative metrics. In this paper, we develop a prototype metric that seeks to quantify the notion of algorithmic complexity in networked system design. We evaluate several networked system designs through the lens of our proposed complexity metric and demonstrate that our metric quantitatively assesses solutions in a manner compatible with informally articulated design intuition and anecdotal evidence such as real-world adoption.
Open Access Media
USENIX is committed to Open Access to the research presented at our events. Papers and proceedings are freely available to everyone once the event begins. Any video, audio, and/or slides that are posted after the event are also free and open to everyone. Support USENIX and our commitment to Open Access.
BibTeX
@inproceedings {268256,
author = {Byung-Gon Chun and Sylvia Ratnasamy and Eddie Kohler},
title = {{NetComplex}: A Complexity Metric for Networked System Designs},
booktitle = {5th USENIX Symposium on Networked Systems Design and Implementation (NSDI 08)},
year = {2008},
address = {San Francisco, CA},
url = {https://www.usenix.org/conference/nsdi-08/netcomplex-complexity-metric-networked-system-designs},
publisher = {USENIX Association},
month = apr
}
author = {Byung-Gon Chun and Sylvia Ratnasamy and Eddie Kohler},
title = {{NetComplex}: A Complexity Metric for Networked System Designs},
booktitle = {5th USENIX Symposium on Networked Systems Design and Implementation (NSDI 08)},
year = {2008},
address = {San Francisco, CA},
url = {https://www.usenix.org/conference/nsdi-08/netcomplex-complexity-metric-networked-system-designs},
publisher = {USENIX Association},
month = apr
}
connect with us