Computational & Technology Resources
an online resource for computational,
engineering & technology publications 

CivilComp Proceedings
ISSN 17593433 CCP: 84
PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON ENGINEERING COMPUTATIONAL TECHNOLOGY Edited by: B.H.V. Topping, G. Montero and R. Montenegro
Paper 21
Computer Simulations for a Fractional Calculus Derived Internet Traffic Model C. Aguirre^{1}, D. Campos^{1}, P. Pascual^{1} and L. Vázquez^{2}^{3}
^{1}GNB, Department of Engineering Informatics, Escuela Politécnica Superior, Universidad Autónoma of Madrid, Spain
C. Aguirre, D. Campos, P. Pascual, L. Vázquez, "Computer Simulations for a Fractional Calculus Derived Internet Traffic Model", in B.H.V. Topping, G. Montero, R. Montenegro, (Editors), "Proceedings of the Fifth International Conference on Engineering Computational Technology", CivilComp Press, Stirlingshire, UK, Paper 21, 2006. doi:10.4203/ccp.84.21
Keywords: internet, traffic model, fractional calculus, packet delay.
Summary
In this work we explore, by means of computer simulations, the behavior of a traffic model
that present a time delay in packet transmission. Some network traffic characteristics are
more efficiently described in terms of fractal than conventional stochastic processes.
Longrange dependency in statistical moments have been
found in corporate, local and widearea networks [1,2]. In these works, the
correlation function of network process decays much more slowly than exponential, showing
in fact a powerlaw decay. This behavior has been explained on the basis of diffusion
processes that describes the evolution of a system with the properties of information loss. This
powerlaw dependence can be explained in the light of fracionary calculus and
fractional derivative equations [3]. In this framework, some models of
internet traffic have been developed on the basis of fractional calculus. For example in
[4] the most probable number of packets in the site x at the moment t, n(x,t)
is estimated with the assumption that the time delay of packet transmission between
two given nodes is given by a probability density of the form:
where the packet loss situation corresponds to a condition that the packet will not leave one of the intermediate nodes in its route. Even when these works present interesting analytical results, there is no a comparison between these analytical results and the behavior observed in real data or in data obtained by computer simulations. In [4] a theoretical model for network traffic is developed when the probability distribution function follows the expression given by equation (55). The equation of package migration can be expressed as a fractional derivative equation of the form: If we assume the initial conditions and we obtain: where c(x,t) is the correlation function. In our simulations a set of packages has to cross a number of intermediate nodes in order to go from the source to the destination. Different path lengths are possible. Each node maintains a queue of packages. One source node sends a file of packages to a destination node by a route of r intermediate step nodes. Each package has a time counter that represents the time that rests to send the package to the following node. The following occurs at each time instant for each node.
The behavior of n(x,t) in our simulations is similar to the one predicted by theoretical model. We obtain a different behavior in the correlation c(x,t). The theoretical model predicts a growth in the value of c(x,t) as x or t increase and in our simulation a decrease in the value of c(x,t) is observed. References
purchase the fulltext of this paper (price £20)
go to the previous paper 
