Computing Publications

Publications Home » Measurement and modelling of self...

Measurement and modelling of self-similar traffic in computer networks

A. J. Field, Uli Harder, Peter G. Harrison

Journal Article
IEE Proceedings - Communications
Volume 151
Issue 4
pp.355–363
August, 2004
IEE
DOI 10.1049/ip-com:20040368
Abstract

We report results from the analysis of traffic measured over a departmental switched Ethernet. Self-similar characteristics are seen throughout the network, for example at the compute servers, web server and intermediate routers. We show that data shipped by the web server (i.e. including both static files from a filer server and dynamically-generated data) has a heavy-tailed distribution which is matched extremely well by a Cauchy distribution. We also show that the fragmentation of the data (i.e. into Ethernet frames) leads to a departure process whose power spectrum is shown to follow a power law very similar to that of the observed traffic. Importantly, the power law appears to be largely independent of the input process - self-similar behaviour is observed even with Poisson arrivals. This supports the suggested link between file/request size distribution and self-similarity in network traffic. The resulting implication that self similarity and heavy tails are primarily due to server-nodes, rather than being inherent in offered traffic, leads to the possibility of using conventional queueing network models of performance.

Keywords
AESOP
PDF of full publication (280 kilobytes)
(need help viewing PDF files?)
GZipped Postscript of full publication (223 kilobytes)
(need help viewing GZipped Postscript files?)
BibTEX file for the publication
N.B.
Conditions for downloading publications from this site.
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.