Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Discrete-time heavy-tailed chains, and their properties in modelling network traffic
 

Summary: Discrete-time heavy-tailed chains, and their
properties in modelling network traffic
JOS´E ALBERTO HERN´ANDEZ and IAIN W. PHILLIPS
Loughborough University, United Kingdom
JAVIER ARACIL
Universidad Aut´onoma de Madrid, Spain
The particular statistical properties found in network measurements, namely self-similarity and
long-range dependence, cannot be ignored in modelling network and Internet traffic. Thus, despite
their mathematical tractability, traditional Markov models are not appropriate for this purpose,
since their memoryless nature contradicts the burstiness of transmitted packets. However, it is
desirable to find a similarly tractable model which is, at the same time, rigorous at capturing the
features of network traffic.
This work presents the discrete-time heavy-tailed chains, a tractable approach to characterise
network traffic as a superposition of discrete-time "on/off" sources. This is a particular case of
the generic "on/off" heavy-tailed model, thus showing the same statistical features as the former;
particularly, self-similarity and long-range dependence, when the number of aggregated sources
approaches infinity.
The model is then applicable to characterise a number of discrete-time communication systems,
for instance ATM and Optical Packet Switching, and further derive meaningful performance met-
rics, such as the average burst duration and the number of active sources in a random instant.

  

Source: Rico, Javier Aracil - Departamento de Ingeniería Informática, Universidad Autonoma de Madrid

 

Collections: Computer Technologies and Information Sciences