Revisiting AS-Level Graph Reduction

Thumbnail Image
Files
Rohrer_Revisting_AS-Level_Graph_Reduction_2016.pdf (330.83 KB)
Authors
Rye, Erik C.
Rohrer, Justin P.
Beverly, Robert
Subjects
Advisors
Date of Issue
2016
Date
2016
Publisher
Language
Abstract
The topological structure of the Internet – the interconnection of routers and autonomous systems (ASes) – is large and complex. Frequently it is necessary to evaluate network protocols and applications on “Internet-like” graphs in order understand their security, resilience, and performance properties. A fundamental obstacle to emulation and simulation is creating realistic Internet-like topologies of reduced order. We reexamine existing AS graph reduction algorithms and find that they struggle to capture graph theoretic properties of modern topologies and topologies obtained from different sources. We develop a new AS graph reduction method that performs well across time periods and data sets.
Type
Article
Description
URI
https://hdl.handle.net/10945/50288
Series/Report No
Department
Computer Science (CS)
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
NSF CNS-1213155
DHS Cyber Security N66001-2250-58231
Format
6 p.
Citation
Rye, E. C., Rohrer, J. P., Beverly, R. E. (2016). Revisiting AS-Level Graph Reduction. Proceedings of the Eighth IEEE International Workshop on Network Science for Communication Networks (NetSciCom).
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections
Publications