A generalized multifractal model for self-similar traffic flows in high-speed computer networks
This paper proposes a new multifractal model with the aim to provide a possible explanation for the locality phenomena to appear in the estimation of the Hurst exponent in stationary second order temporal series, representing the self-similar traffic flows in high-speed computer networks.
Ginno Millán
openaire +3 more sources
A fluid flow model for the software defined wide area networks analysis [PDF]
The advancement of IT systems necessitates efficient communication methods essential across various sectors, from streaming platforms to cloud-based solutions and Industry 4.0 applications.
Karol Marszałek, Adam Domański
doaj +2 more sources
On the LRD of the aggregated traffic flows in high-speed computer networks (Draft 1)
This paper studies and analyses the behavior of the Long-Range Dependence in network traffic after classifying trafficflows in aggregated time series. Following Differentiated Services architecture principles, the generic Quality of Service applications that requirements and use the transport control protocol, a basic classification criterion of time ...
Ginno Millán
openaire +3 more sources
A Kalman filtering approach to traffic flow estimation in computer networks
Abstract In this paper, data-based estimation of traffic flows in computer networks is dealt with. The knowledge of the traffic matrix, containing the values of flows among the nodes in a computer network, could be very useful in many aspects of network management, like capacity planning, traffic load distribution and anomaly detection.
Pozzi, G. +3 more
openaire +3 more sources
Traffic flows analysis in high-speed computer networks using time series (Draft 2)
This article explores the required amount of time series points from a high-speed traffic network to accurately estimate the Hurst exponent. The methodology consists in designing an experiment using estimators that are applied to time series, followed by addressing the minimum amount of points required to obtain accurate estimates of the Hurst exponent
Ginno Millán
openaire +3 more sources
Traffic flows analysis in high-speed computer networks using time series (Draft 1)
This article explores the required amount of time series points from a high-speed traffic network to accurately estimate the Hurst exponent. The methodology consists in designing an experiment using estimators that are applied to time series, followed by addressing the minimum amount of points required to obtain accurate estimates of the Hurst exponent
Ginno Millán
openaire +3 more sources
A Fast Multifractal Model for Self-Similar Traffic Flows in High-Speed Computer Networks
AbstractThis paper proposes a new multifractal model, with the aim of providing a possible explanation for the locality phenomenon that appears in the estimation of the Hurst exponent in stationary second order temporal series representing self-similar traffic flows in current high-speed computer networks.
Millán, G., Lefranc, G.
openaire +2 more sources
The Research of Traffic Flow Assignment Model based on the Network Calculus of Computer Network [PDF]
Yali Peng +3 more
openaire +2 more sources
Traffic flow management analysis in computer data networks
Today, computer data networks are being used everywhere around us. To increase reliability most of such networks use redundant links, which may not be fully utilized at all times. The reason lies with the routing protocols, which are used to detect network faults, and at all times direct all traffic only across the best path.
Gregor Koščak
openaire +2 more sources
Computer Networks Protocol Analyzer for Optimization of Adaptive Management of Traffic Flow
O. Yu. Fedevych
openaire +3 more sources

