ACM Home Page
Please provide us with feedback. Feedback
The scaling hypothesis: simplifying the prediction of network performance using scaled-down simulations
Full text PdfPdf (827 KB)
Source ACM SIGCOMM Computer Communication Review archive
Volume 33 ,  Issue 1  (January 2003) table of contents
Pages: 35 - 40  
Year of Publication: 2003
ISSN:0146-4833
Authors
Konstantinos Psounis  Stanford University
Rong Pan  Stanford University
Balaji Prabhakar  Stanford University
Damon Wischik  Cambridge University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 21,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/774763.774768
What is a DOI?

ABSTRACT

As the Internet grows, so do the complexity and computational requirements of network simulations. This leads either to unrealistic, or to prohibitely expensive simulation experiments.We explore a way to side-step this problem, by combining simulation with sampling and analysis. Our hypothesis is this: if we take a sample of the 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.We find that when we scale a network which is shared by TCP-like flows, and which is controlled by a variety of active queue management schemes, then performance measures such as queueing delay and the distribution of flow transfer times are left virtually unchanged. Hence, the computational requirements of network simulations and the cost of experiments can decrease dramatically.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
Fluid models for large, heterogeneous networks. http://www-net.cs.umass.edu/fluid/, accessed January 2002.
4
 
5
C.V. Hollot, V. Misra, D. Towlsey, and W. Gong. A control theoretic analysis of RED. In Proceedings of INFOCOM, 2001.
 
6
C.V. Hollot, V. Misra, D. Towlsey, and W. Gong. On designing improved controllers for AQM routers supporting TCP flow. In Proceedings of INFOCOM, 2001.
7
8
 
9
T. Ott, T. Lakshman, and L. Wong. SRED: Stabilized RED. In Proceedings of INFOCOM, 1999.
 
10
R. Pan, B. Prabhakar, K. Psounis, and D. Wischik. Shrink: A method for scalable performance prediction and efficient network simulation. http://www.stanford.edu/~kpsounis/scale1.html, accessed October 2002.
 
11
R. Pan, K. Psounis, B. Prabhakar, and M. Sharma. A study of the applicability of the scaling-hypothesis. In Proceedings of ASCC, 2002.
 
12
S. Shakkottai and R. Srikant. How good are deterministic fluid models of internet congestion control. In Proceedings of Infocom 2002, to appear, 2002.
 
13
 
14


Collaborative Colleagues:
Konstantinos Psounis: colleagues
Rong Pan: colleagues
Balaji Prabhakar: colleagues
Damon Wischik: colleagues