Please use this identifier to cite or link to this item:
Title: Performance preserving topological downscaling of Internet-like networks
Authors: Govindan, Ramesh 
Papadopoulos, Fragkiskos 
Psounis, Konstantinos
Keywords: Efficient network simulation | Performance prediction | Topology downscaling | Transmission control protocol (TCP)/closed-loop networks
Category: Electrical Engineering - Electronic Engineering - Information Engineering
Field: Engineering and Technology
Issue Date: 1-Dec-2006
Source: IEEE Journal on Selected Areas in Communications, Volume 24 , Issue: 12 , Dec. 2006
Journal: IEEE Journal on Selected Areas in Communications 
Abstract: The Internet is a large, heterogeneous system operating at very high speeds and consisting of a large number of users. Researchers use a suite of tools and techniques in order to understand the performance of complex networks like the Internet: measurements, simulations, and deployments on small to medium-scale testbeds. This work considers a novel addition to this suite: a class of methods to scale down the topology of the Internet that enables researchers to create and observe a smaller replica, and extrapolate its performance to the expected performance of the larger Internet. This is complementary to the work of Psounis et al., 2003, where the authors presented a way to scale down the Internet in time, by creating a slower replica of the original system. The key insight that we leverage in this work is that only the congested links along the path of each flow introduce sizable queueing delays and dependencies among flows. Hence, one might hope that the network properties can be captured by a topology that consists of the congested links only. Using extensive simulations with transmission control protocol (TCP) traffic and theoretical analysis, we show that it is possible to achieve this kind of performance scaling even on topologies the size of the CENIC backbone (that provides Internet access to higher education institutions in California). We also show that simulating a scaled topology can be up to two orders of magnitude faster than simulating the original topology. © 2006 IEEE.
ISSN: 0733-8716
DOI: 10.1109/JSAC.2006.884029
Type: Article
Appears in Collections:Άρθρα/Articles

Show full item record

Citations 50

checked on Mar 28, 2020


checked on Apr 3, 2020

Page view(s)

Last Week
Last month
checked on Apr 5, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.