The Community for Technology Leaders
Simulation Symposium, Annual (2005)
San Diego, California, USA
Apr. 4, 2005 to Apr. 6, 2005
ISSN: 1080-241X
ISBN: 0-7695-2322-6
pp: 285-294
Ramesh Govindan , University of Southern California
Fragkiskos Papadopoulos , University of Southern California
Konstantinos Psounis , University of Southern California
ABSTRACT
<p>The Internet is a large, complex, 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 networks: 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.</p> <p>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. We show that for a network that is shared by TCP flows it is possible to achieve this kind of performance scaling. We also show that simulating a scaled topology can be up to two orders of magnitude faster than simulating the original topology.</p>
INDEX TERMS
null
CITATION
Ramesh Govindan, Fragkiskos Papadopoulos, Konstantinos Psounis, "Performance Preserving Network Downscaling", Simulation Symposium, Annual, vol. 00, no. , pp. 285-294, 2005, doi:10.1109/ANSS.2005.36
102 ms
(Ver 3.3 (11022016))