ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Performance Evaluation
Volume 58, Issues 2-3, November 2004, Pages 243-260
Distributed Systems Performance
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (315 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.peva.2004.07.017    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2004 Published by Elsevier B.V.

Network traffic behaviour in switched Ethernet systems

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Tony FieldE-mail The Corresponding Author, Uli HarderCorresponding Author Contact Information, E-mail The Corresponding Author and Peter HarrisonE-mail The Corresponding Author

Department of Computing, Imperial College, Huxley Building, 180 Queen's Gate, London SW72AZ, UK


Available online 15 September 2004.

Abstract

Measurements on a high-performance Ethernet are shown to match well a truncated Cauchy probability distribution, with a much better fit over smaller file/request sizes than the commonly used Pareto distribution. We observe self-similar characteristics in the traffic at both file servers and at a CPU server elsewhere in the network, which targets, predominantly, file and web servers. This suggests propagation of self-similarity. A simulation model of a single server with Poisson arrivals and Cauchy service demands yields a departure process that follows a power law and matches closely the observed traffic. The simulation is also used to investigate the link between the power laws in the request size distribution and the network traffic by using Lévy distributions for the request sizes. This suggests a link between file/request size distribution and self-similarity in traffic, leading to the possibility of using conventional queueing network performance models with processor sharing queueing discipline. This idea is further supported by an additional simulation experiment and suitable models are proposed.

Keywords: Self-similarity; Network traffic; Lévy distribution; Traffic model

Article Outline

1. Introduction and related work
1.1. Related work
2. Data capture
3. Network architecture and monitoring
4. Analysis methods
5. Measurements
5.1. Request sizes
6. Modelling the traffic
7. Conclusions
7.1. Discussion
Acknowledgements
References













Corresponding Author Contact InformationCorresponding author.

Performance Evaluation
Volume 58, Issues 2-3, November 2004, Pages 243-260
Distributed Systems Performance
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.