Nonstationarity of network traffic within multi-scale burstiness constraint

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The scaling behavior has been discovered in the past decade, which has provided hope that mathematical models can be found to describe the nature of the traffic. Similarly to long-range dependence (LRD), nonstationarity is also one of vital characteristics of network traffic. In this paper, a novel traffic model is proposed based on that the traffic aggregation behavior is abstracted in hierarchical way. The traffic model is focused on the burst traffic rate. Firstly, the burst size of output aggregated flow by edge device of a network domain is derived by pseudo queue system methods. And, the nonstationarity of input traffic is developed by a generalized fractal Gaussian noise process, which is constructed by a large number of train traffic series. They are Poisson arrival and their lifetime is exponential distribution. The model has a good performance of fitting to real traffic data within multi-scale for long time, which is illuminated by simulated results. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Wei, J., & Wu, J. (2005). Nonstationarity of network traffic within multi-scale burstiness constraint. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3802 LNAI, pp. 971–976). Springer Verlag. https://doi.org/10.1007/11596981_144

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free