NetComplex: A complexity metric for networked system designs

5th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2008

Volumn , Issue , 2008, Pages 393-406

  Chun, Byung Gon ^a   Ratnasamy, Sylvia ^b   Kohler, Eddie ^c  

^a ICSI

^b INTEL RESEARCH   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARALLEL PROCESSING SYSTEMS;

ALGORITHMIC COMPLEXITY; ANECDOTAL EVIDENCES; NETWORKED SYSTEMS; NETWORKING COMMUNITY; QUANTITATIVE METRICS; REAL-WORLD; THROUGH THE LENS;

SYSTEMS ANALYSIS;

EID: 76749150920     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (36)

1. IBM General Parallel File System (GPFS).
2. I. Abraham, C. Gavoille, D. Malkhi, N. Nisan, and M. Thorup. Compact name-independent routing with minimum stretch. In Proc. of SPAA, 2004.
3. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Compact distributed data structures for adaptive routing. In Proc. of STOC, 1989.
4. P. Bahl, R. Chandra, A. Greenberg, S. Kandula, D. A. Maltz, and M. Zhang. Towards highly reliable enterprise network services via inference of multi-level dependencies. In SIGCOMM, 2007.
5. M. Caesar, D. Caldwell, N. Feamster, J. Rexford, A. Shaikh, and J. van der Merwe. Design and implementation of a routing control platform. In Proc. of NSDI, 2005.
6. M. Caesar, T. Condie, J. Kannan, K. Lakshminarayanan, I. Stoica, and S. Shenker. ROFL: Routing on flat labels. In SIGCOMM, 2006.
7. M. Casado, M. J. Freedman, J. Pettit, J. Luo, N. McKeown, and S. Shenker. Ethane: Taking control of the enterprise. In SIGCOMM, 2007.
8. M. Casado, T. Garfinkel, A. Akella, M. J. Freedman, D. Boneh, N. McKeown, and S. Shenker. SANE: A protection architecture for enterprise networks. In Proc. of USENIX Security, 2006.
9. B.-G. Chun, S. Ratnasamy, and E. Kohler. A complexity metric for networked system designs. IRB-TR-07-010.
10. L. J. Cowen. Compact routing with minimum stretch. In Proc. of SODA, 1999.
11. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In Proc. of PODC, 1987.
12. R. Fonseca, G. Porter, R. Katz, S. Shenker, and I. Stoica. X-trace: A pervasive network tracing framework. In Proc. of NSDI, 2007.
13. S. Gilbert and N. Lynch. Brewer's conjecture and the feasibility of consistent available partition-tolerant web services. SigACT News, 2002.
14. J. Gray. Notes on database systems. IBM Research Report RJ2188, Feb. 1978.
15. A. Greenberg, G. Hjalmtysson, D. A. Maltz, A. Myers, J. Rexford, G. Xie, H. Yan, J. Zhan, and H. Zhang. A clean slate 4d approach to network control and management. In SIGCOMM CCR, 2005.
16. B. Gruschke. Integrated event management: Event correlation using dependency graphs. In Proc. of DSOM, 1998.
17. K. P. Gummadi, H. V. Madhyastha, S. D. Gribble, H. M. Levy, and D. Wetherall. Improving the reliability of Internet paths with one-hop source routing. In Proc. of OSDI, 2004.
18. M. Halstead. Elements of Software Science, Operating, and Programming Systems. Elsevier, 1977.
19. S. Henry and D. Kafura. Software structure metrics based on information flow. IEEE Transactions on Software Engineering, pages 510-518, 1981.
20. Y. hua Chu, S. G. Rao, and H. Zhang. A case for end system multicast. In Proc. of SIGMETRICS, 2000.
21. B. Karp and H. T. Kung. Greedy perimeter stateless routing for wireless networks. In Proc. of MOBICOM, 2000.
22. M. Karsten, S.Keshav, S. Prasad, and O. Beg. An axiomatic basis for communication. In SIGCOMM, 2007.
23. D. Krioukov, K. Fall, and X. Yang. Compact routing on Internet-like graphs. In Proc. of INFOCOM, 2004.
24. F. Kuhn and R. Wattenhofer. On the complexity of distributed graph coloring. In Proc. of PODC, 2006.
25. K. Lakshminarayanan, M. Caesar, M. Rangan, T. Anderson, and S. Shenker. Achieving convergence-free routing using failure-carrying packets. In SIGCOMM, 2007.
26. L. Lamport. The part-time parliament. ACM Trans. on Computer Systems, 16(2):133-169, May 1998.
27. N. Linial. Locality in distributed graph algorithms. SIAM Journal on Computing, pages 193-201, 1992.
28. D. Malkhi and M. Reiter. Byzantine quorum systems. In Proc. of STOC, 1997.
29. Y. Mao, F. Wang, L. Qiu, S. S. Lam, and J. M. Smith. S4: Small state and small stretch routing protocol for large wireless sensor networks. In Proc. of NSDI, 2007.
30. T. J. McCabe and C. W. Butler. Design complexity measurement and testing. Comm. of the ACM, pages 1415-1425, 1989.
31. C. E. Perkins and E. M. Royer. Ad hoc on-demand distance vector routing. In Proc. of WMCSA, 1999.
32. R. Perlman, C.-Y. Lee, A. Ballardie, J. Crowcroft, Z. Wang, T. Maufer, C. Diot, J. Thoo, and M. Green. Simple multicast: A design for simple, low-overhead multicast. Internet-Draft draftperlman-simple-multicast-03, Internet Engineering Task Force, Oct. 1999. Work in progress.
33. A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica. Geographic routing without location information. In Proc. of MOBICOM, 2003.
34. S. Ratnasamy. Capturing complexity in networked systems design: The case for improved metrics. In Proc. of HotNets, 2006.
35. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In SIGCOMM, 2001.
36. M. Thorup and U. Zwick. Compact routing schemes. In Proc. of SPAA, 2001.