NSDI '08 – Abstract
Pp. 393–406 of the Proceedings
NetComplex: A Complexity Metric for Networked System Designs
Byung-Gon Chun, ICSI; Sylvia Ratnasamy, Intel Research Berkeley; Eddie Kohler, University of California, Los Angeles
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.
- View the full text of this paper in HTML and PDF. Listen to the presentation in
MP3 format.
The Proceedings are published as a collective work, © 2008 by the USENIX Association. All Rights Reserved. Rights to individual papers remain with the author or the author's employer. Permission is granted for the noncommercial reproduction of the complete work for educational or research purposes. USENIX acknowledges all trademarks within this paper.
|
