ACM Home Page
Please provide us with feedback. Feedback
Connection-level analysis and modeling of network traffic
Full text PdfPdf (928 KB)
Source Internet Measurement Conference archive
Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement table of contents
San Francisco, California, USA
Session: Traffic characterization table of contents
Pages: 99 - 103  
Year of Publication: 2001
ISBN:1-58113-435-5
Authors
Shriram Sarvotham  Rice University, Houston, TX
Rudolf Riedi  Rice University, Houston, TX
Richard Baraniuk  Rice University, Houston, TX
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 91,   Citation Count: 25
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Most network traffic analysis and modeling studies lump all connections together into a single flow. Such aggregate traffic typically exhibits long-range-dependent (LRD) correlations and non-Gaussian marginal distributions. Importantly, in a typical aggregate traffic model, traffic bursts arise from many connections being active simultaneously. In this paper, we develop a new framework for analyzing and modeling network traffic that moves beyond aggregation by incorporating connection-level information. A careful study of many traffic traces acquired in different networking situations reveals (in opposition to the aggregate modeling ideal) that traffic bursts typically arise from just a few high-volume connections that dominate all others. We term such dominating connections alpha traffic. Alpha traffic is caused by large file transmissions over high bandwidth links and is extremely bursty (non-Gaussian). Stripping the alpha traffic from an aggregate trace leaves a beta traffic residual that is Gaussian, LRD, and shares the same fractal scaling exponent as the aggregate traffic. Beta traffic is caused by both small and large file transmissions over low bandwidth links. In our alpha/beta traffic model, the heterogeneity of the network resources give rise to burstiness and heavy-tailed connection durations give rise to LRD. Queuing experiments suggest that the alpha component dictates the tail queue behavior for large queue sizes, whereas the beta component controls the tail queue behavior for small queue sizes.


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
R. H. Riedi, M. S. Crouse, V. Ribiero, and R. G. Baraniuk, "A multifractal wavelet model with application to TCP network traffic," IEEE Trans. Inform. Theory, vol. 45, no. 3, pp. 992-1018, April 1999.
 
3
 
4
F. Brichet, J. Roberts, A. Simonian, and D. Veitch, "Heavy traffic analysis of a fluid queue fed by a superposition of ON/OFF sources," COST, vol. 242, 1994.
 
5
M. Taqqu and J. Levy, Using renewal processes to generate LRD and high variability. In: Progress in probability and statistics, E. Eberlein and M. Taqqu eds., vol. 11, Birkhaeuser, Boston, 1986, pp 73389.
 
6
 
7
8
 
9
NLANR, "Auckland-II trace archive," http://moat.nlanr.net/Traces/Kiwitraces, 2000.
 
10
S. Sarvotham, R. Riedi, and R. Baraniuk, "Connection-level analysis and modeling of network traffic," Tech. Rep., ECE Dept., Rice Univ., July 2001.
 
11
LBL, "Internet traffic archive," http://ita.ee.lbl.gov/html/traces.html.
 
12
K. Fall and K. Varadhan, "ns notes and documentation," http://www-mash.cs.berkeley.edu/ns, 2000.
 
13
S. McCane and S. Floyd, "ns- network simulator," http://wwwmash.cs.berkeley.edu/ns.
 
14
J. Levy Vehel and R. Riedi, "Fractional Brownian motion and data traffic modeling: The other end of the spectrum," Fractals in Engineering, pp. 185-202, Springer 1997.

CITED BY  25

Collaborative Colleagues:
Shriram Sarvotham: colleagues
Rudolf Riedi: colleagues
Richard Baraniuk: colleagues