ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Bounding damage from link destruction, with application to the internet
Full text PdfPdf (345 KB)
Source
Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems table of contents
San Diego, California, USA
POSTER SESSION: Poster session table of contents
Pages: 367 - 368  
Year of Publication: 2007
ISBN:978-1-59593-639-4
Also published in ...
Authors
George Dean Bissias  University of Massachusetts Amherst
Brian Neil Levine  University of Massachusetts Amherst
Arnold Rosenberg  University of Massachusetts Amherst
Sponsors
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 44,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1254882.1254933
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Barabasi, A.-L., and Albert, R. Emergence of scaling in random networks. Science 286 (1999), 590--512.
 
2
Carlson, J. M., and Doyle, J. Highly optimized tolerance: a mechanism for power laws in designed systems. Physics Review E (1999).
 
3
Donath, W., and Hoffman, A. J. Lower bounds for the partitioning of graphs. IBM Journal of Research and Development 17 (1973), 420--425.
 
4
Doyle, J. C., Alderson, D. L., Li, L., Low, S., Roughan, M., Shalunov, S., Tanaka, R., and Willinger, W. The "robust yet fragile" nature of the Internet. Proceedings of the National Academy of Sciences of the United States of America (2005).
 
5
Li, L., Alderson, D., Tanaka, R., Doyle, J. C., and Willinger, W. Towards a theory of scale-free graphs: definition, properties, and implications (extended version). Tech. rep., California Institute of Technology, 2005.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.4 PERFORMANCE OF SYSTEMS
      Subjects: Reliability, availability, and serviceability

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.0 General
          Subjects: Security and protection (e.g., firewalls)


General Terms:
Human Factors, Reliability, Security


Keywords:
graph partitioning, spectral graph theory, vulnerability

Collaborative Colleagues:
George Dean Bissias: colleagues
Brian Neil Levine: colleagues
Arnold Rosenberg: colleagues
This Article has also been published in:

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2008 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player