Calculation of routing value in MPLS network according to traffic fractal properties

TL;DR

This paper introduces a method for calculating routing costs in MPLS networks that considers traffic fractal properties, optimizing path selection and quality of service based on self-similar traffic data.

Contribution

It presents a novel approach that incorporates traffic fractal characteristics, such as the Hurst parameter, into routing cost calculations for improved network performance.

Findings

Effective routing cost minimization considering traffic fractal properties.

Applicability to self-similar and multifractal traffic streams.

Enhanced routing decisions based on traffic spread and Hurst parameter.

Abstract

Method for calculating routing cost of MPLS network is presented in the work. This method allows to minimize routing cost, taking into account traffic fractal properties, choice of traffic transmission path and quality of service requirements. The method uses values of the Hurst parameter and value of normalized spread of traffic values, which makes it possible to apply it to self-similar and multifractal data streams.