Fitting World-Wide Web Request Traces with the EM-Algorithm


El Abdouni Khayari, Rachid and Sadre, Ramin and Haverkort, Boudewijn (2001) Fitting World-Wide Web Request Traces with the EM-Algorithm. In: Internet Performance and Control of Network Systems II, 21 August 2001, Denver, Colorado (pp. pp. 211-220).

[img] PDF
Restricted to UT campus only
: Request a copy
Abstract:In recent years, several studies have shown that network traffic exhibits the property of self-similarity. Traditional (Poissonian) modelling approaches have been shown not to be able to describe this property and generally lead to the underestimation of interesting performance measures. Crovella and Bestavros have shown that network traffic that is due to World Wide Web transfers shows characteristics of self-similarity and they argue that this can be explained by the heavy-tailedness of many of the involved distributions. Considering these facts, developing methods which are able to handle self-similarity and heavy-tailedness is of great importance for network capacity planing purposes. In this paper we discuss two methods to fit hyper-exponential distributions to data sets which exhibit heavy-tails. One method is taken from the literature and shown to fall short. The other, new method, is shown to perform well in a number of case studies.
Item Type:Conference or Workshop Item
Additional information:Imported from research group DACS (ID number 470)
Copyright:© 2001 SPIE
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page