Revisiting AS-Level Graph Reduction
Rye, Erik C.
Rohrer, Justin P.
MetadataShow full item record
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.
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.
Showing items related by title, author, creator and subject.
Çetinkaya, Egemen K.; Alenazi, Mohammed J.F.; Peck, Andrew M.; Rohrer, Justin P.; Sterbenz, James P.G. (2015);For many years the research community has attempted to model the Internet in order to better understand its behaviour and improve its performance. Since much of the structural complexity of the Internet is due to its ...
Salatas, Vlasios. (Monterey, California. Naval Postgraduate School, 2005-09);Wireless sensor network (WSN) is a promising new technology. It could be a way to achieve ubiquitous computing and embedded Internet. WSNs are an efficient solution for applications that involve deep monitoring of a ...
Rye, Erik; Rohrer, Justin P. (Monterey, California. Naval Postgraduate School, 2015-03); NPS-CS-15-001Network researchers and operators often turn to emulation and simulation for testing and experimentation.Obtaining topologies that reflect the graph characteristics of the Internet, while of small enough order to emulate ...