SHRiNK: a method for enabling scaleable performance prediction and efficient network simulation

  • Authors:

  • Rong Pan;Balaji Prabhakar;Konstantinos Psounis;Damon Wischik

  • Affiliations:

  • Cisco Systems, San Jose, CA and Stanford University, Stanford, CA;Stanford University, Stanford, CA;Department of Electrical Engineering - Systems, University of Southern California, Los Angeles, CA and Stanford University, Stanford, CA;Department of Computer Science, University College London, London, U.K. and Cambridge University, Cambridge, U.K.

  • Venue:
  • IEEE/ACM Transactions on Networking (TON)
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

As the Internet grows, it is becoming increasingly difficult to collect performance measurements, to monitor its state, and to perform simulations efficiently. This is because the size and the heterogeneity of the Internet makes it time-consuming and difficult to devise traffic models and analytic tools which would allow us to work with summary statistics.We explore a method to side step these problems by combining sampling, modeling, and simulation. Our hypothesis is this: if we take a sample of the input traffic and feed it into a suitably scaled version of the system, we can extrapolate from the performance of the scaled system to that of the original.Our main findings are as follows. When we scale an IP network which is shared by short- and long-lived TCP-like and UDP flows and which is controlled by a variety of active queue management schemes, then performance measures such as queueing delay and drop probability are left virtually unchanged. We show this in theory and in simulations. This makes it possible to capture the performance of large networks quite faithfully using smaller scale replicas.