Show simple item record

dc.contributor.authorRye, Erik C.
dc.contributor.authorRohrer, Justin P.
dc.contributor.authorBeverly, Robert
dc.date2016
dc.date.accessioned2016-10-14T15:25:17Z
dc.date.available2016-10-14T15:25:17Z
dc.date.issued2016
dc.identifier.citationRye, 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).en_US
dc.identifier.urihttp://hdl.handle.net/10945/50288
dc.description.abstractThe 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.en_US
dc.format.extent6 p.en_US
dc.rightsThis 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.en_US
dc.titleRevisiting AS-Level Graph Reductionen_US
dc.typeArticleen_US
dc.contributor.corporateNaval Postgraduate School (U.S.)en_US
dc.contributor.departmentComputer Science (CS)
dc.description.funderNSF CNS-1213155en_US
dc.description.funderDHS Cyber Security N66001-2250-58231en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record