Mathematical analysis of network traffic

Author

Mian, S. ; Ghassempoory, M. ; Bentall, M.

Author_Institution

Electron. Div., Cardiff Univ., UK

fYear

2002

fDate

2002

Firstpage

249

Lastpage

252

Abstract

The level of complexity in computer networks is rising and the mathematics needed to model the network traffic behaviour is not an exact science. This paper aims to bridge the gap between mathematics and engineering by illustrating some of the problems that exist with conventional traffic modeling, and show how to obtain informative network statistics via mathematical tools such as the Hurst (1951) parameter and the autocorrelation function. We show how aggregated traffic behaves over various time scales and focus on certain protocols to observe their impact on the network at various ingress/egress points on our university network. Furthermore, we present the many analytical tools that are useful in characterising these systems.

Keywords

correlation methods; local area networks; mathematical analysis; network topology; protocols; statistical analysis; telecommunication traffic; Ethernet; Hurst parameter; aggregated traffic; autocorrelation function; computer networks; engineering; local-area network; mathematical analysis; network design; network planning; network statistics; network topology; network traffic; protocol analysis; protocols; traffic modeling; traffic parameters; university network; Autocorrelation; Bridges; Computer networks; Mathematical analysis; Mathematical model; Mathematics; Protocols; Statistics; Telecommunication traffic; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Research and Development, 2002. SCOReD 2002. Student Conference on

Print_ISBN

0-7803-7565-3

Type

conf

DOI

10.1109/SCORED.2002.1033104

Filename

1033104