Optimization Problem for Probabilistic Time Intervals of Quasi-Deterministic Output and Self-Similar Input Data Packet Flow in Telecommunication Networks
When managing traffic at the packet level in modern telecommunication networks, it is proposed to use methods that transform a self-similar stochastic packet flow into a quasi-deterministic one. To do this, it is required to apply complex probabilistic laws of distribution of self-similar flows. Fro...
Zapisane w:
| Główni autorzy: | , , , , , , , |
|---|---|
| Format: | Статья |
| Język: | English |
| Wydane: |
Don State Technical University
2025
|
| Hasła przedmiotowe: | |
| Dostęp online: | https://dspace.ncfu.ru/handle/123456789/30454 |
| Etykiety: |
Dodaj etykietę
Nie ma etykietki, Dołącz pierwszą etykiete!
|
| id |
ir-123456789-30454 |
|---|---|
| record_format |
dspace |
| spelling |
ir-123456789-304542025-05-15T07:28:38Z Optimization Problem for Probabilistic Time Intervals of Quasi-Deterministic Output and Self-Similar Input Data Packet Flow in Telecommunication Networks Linets, G. I. Линец, Г. И. Voronkin, R. A. Воронкин, Р. А. Slyusarev, G. V. Слюсарев, Г. В. Govorova, S. V. Говорова, С. В. Kullback-Leibler divergence Self-similar packet flow Quasi-deterministic packet flow Packet arrival time intervals When managing traffic at the packet level in modern telecommunication networks, it is proposed to use methods that transform a self-similar stochastic packet flow into a quasi-deterministic one. To do this, it is required to apply complex probabilistic laws of distribution of self-similar flows. From the literature, methods of balancing the network load are known, which, with the problem indicated above, contribute to increasing the efficiency of telecommunication systems. However, there is no strictly mathematical solution to find out the optimal probabilistic characteristics of the output flow, based on the input flow. The presented research is intended to fill this gap. Its objective is to create a method for determining the optimal probabilistic characteristics of the packet flow, using the minimum value of the measure closeness of the self-similar input and quasi-deterministic output flows. Materials and Methods. To solve the research problem, the parameters of the output flow distribution were selected so that the approximation function was close to δ-function. The Kullback-Leibler divergence was used as a measure closeness of the input and output distributions of time intervals. Methods of set theory, metric spaces, multidimensional optimization, and teletraffic were used. The solution algorithm included minimization of the Kullback-Leibler divergence and the limit passage to δ-function. Results. A probability distribution was shown — an approximation of δ-function, which maintained the equality of time intervals of a quasi-deterministic output packet flow. A method for transforming a self-similar input flow into a quasi-deterministic output flow was presented. The Kullback–Leibler divergence was used as a measure of their closeness. The minimum of the Kullback-Leibler divergence between the input and output flows with a normal distribution was achieved in the case of equality of the mathematical expectations of these flows. Using the passage to the limit, it was established that time interval T between packets of the quasi-deterministic output flow should be equal to the mathematical expectation of the time intervals between packets of the input self-similar flow. To obtain a quasi-deterministic flow, the passage to the limit was performed for the found value of the mathematical expectation at σ → 0. Discussion and Conclusion. The application of this method will reduce the negative impact of self-similarity of network traffic on the efficiency of the telecommunication network. The use of quasi-deterministic flows makes it possible to predict the load of network resources, which can be the basis for improving the quality of user service. Two difficulties associated with calculations and practical implementation of the solution are eliminated. Firstly, it is difficult to use the delta function as a function of the output flow distribution density. Secondly, there are no ideal deterministic flows in the operation of telecommunication networks. The proposed method has great potential in the design and optimization of communication networks. 2025-05-15T07:26:24Z 2025-05-15T07:26:24Z 2024 Статья Linets G.I., Voronkin R.A., Slyusarev G.V., Govorova S.V. Optimization Problem for Probabilistic Time Intervals of Quasi-Deterministic Output and Self-Similar Input Data Packet Flow in Telecommunication Networks // Advanced Engineering Research (Rostov-on-Don). - 2024. - 24 (4). - pp. 424 - 432. - DOI: 10.23947/2687-1653-2024-24-4-424-432 https://dspace.ncfu.ru/handle/123456789/30454 en Advanced Engineering Research (Rostov-on-Don) application/pdf Don State Technical University |
| institution |
СКФУ |
| collection |
Репозиторий |
| language |
English |
| topic |
Kullback-Leibler divergence Self-similar packet flow Quasi-deterministic packet flow Packet arrival time intervals |
| spellingShingle |
Kullback-Leibler divergence Self-similar packet flow Quasi-deterministic packet flow Packet arrival time intervals Linets, G. I. Линец, Г. И. Voronkin, R. A. Воронкин, Р. А. Slyusarev, G. V. Слюсарев, Г. В. Govorova, S. V. Говорова, С. В. Optimization Problem for Probabilistic Time Intervals of Quasi-Deterministic Output and Self-Similar Input Data Packet Flow in Telecommunication Networks |
| description |
When managing traffic at the packet level in modern telecommunication networks, it is proposed to use methods that transform a self-similar stochastic packet flow into a quasi-deterministic one. To do this, it is required to apply complex probabilistic laws of distribution of self-similar flows. From the literature, methods of balancing the network load are known, which, with the problem indicated above, contribute to increasing the efficiency of telecommunication systems. However, there is no strictly mathematical solution to find out the optimal probabilistic characteristics of the output flow, based on the input flow. The presented research is intended to fill this gap. Its objective is to create a method for determining the optimal probabilistic characteristics of the packet flow, using the minimum value of the measure closeness of the self-similar input and quasi-deterministic output flows. Materials and Methods. To solve the research problem, the parameters of the output flow distribution were selected so that the approximation function was close to δ-function. The Kullback-Leibler divergence was used as a measure closeness of the input and output distributions of time intervals. Methods of set theory, metric spaces, multidimensional optimization, and teletraffic were used. The solution algorithm included minimization of the Kullback-Leibler divergence and the limit passage to δ-function. Results. A probability distribution was shown — an approximation of δ-function, which maintained the equality of time intervals of a quasi-deterministic output packet flow. A method for transforming a self-similar input flow into a quasi-deterministic output flow was presented. The Kullback–Leibler divergence was used as a measure of their closeness. The minimum of the Kullback-Leibler divergence between the input and output flows with a normal distribution was achieved in the case of equality of the mathematical expectations of these flows. Using the passage to the limit, it was established that time interval T between packets of the quasi-deterministic output flow should be equal to the mathematical expectation of the time intervals between packets of the input self-similar flow. To obtain a quasi-deterministic flow, the passage to the limit was performed for the found value of the mathematical expectation at σ → 0. Discussion and Conclusion. The application of this method will reduce the negative impact of self-similarity of network traffic on the efficiency of the telecommunication network. The use of quasi-deterministic flows makes it possible to predict the load of network resources, which can be the basis for improving the quality of user service. Two difficulties associated with calculations and practical implementation of the solution are eliminated. Firstly, it is difficult to use the delta function as a function of the output flow distribution density. Secondly, there are no ideal deterministic flows in the operation of telecommunication networks. The proposed method has great potential in the design and optimization of communication networks. |
| format |
Статья |
| author |
Linets, G. I. Линец, Г. И. Voronkin, R. A. Воронкин, Р. А. Slyusarev, G. V. Слюсарев, Г. В. Govorova, S. V. Говорова, С. В. |
| author_facet |
Linets, G. I. Линец, Г. И. Voronkin, R. A. Воронкин, Р. А. Slyusarev, G. V. Слюсарев, Г. В. Govorova, S. V. Говорова, С. В. |
| author_sort |
Linets, G. I. |
| title |
Optimization Problem for Probabilistic Time Intervals of Quasi-Deterministic Output and Self-Similar Input Data Packet Flow in Telecommunication Networks |
| title_short |
Optimization Problem for Probabilistic Time Intervals of Quasi-Deterministic Output and Self-Similar Input Data Packet Flow in Telecommunication Networks |
| title_full |
Optimization Problem for Probabilistic Time Intervals of Quasi-Deterministic Output and Self-Similar Input Data Packet Flow in Telecommunication Networks |
| title_fullStr |
Optimization Problem for Probabilistic Time Intervals of Quasi-Deterministic Output and Self-Similar Input Data Packet Flow in Telecommunication Networks |
| title_full_unstemmed |
Optimization Problem for Probabilistic Time Intervals of Quasi-Deterministic Output and Self-Similar Input Data Packet Flow in Telecommunication Networks |
| title_sort |
optimization problem for probabilistic time intervals of quasi-deterministic output and self-similar input data packet flow in telecommunication networks |
| publisher |
Don State Technical University |
| publishDate |
2025 |
| url |
https://dspace.ncfu.ru/handle/123456789/30454 |
| work_keys_str_mv |
AT linetsgi optimizationproblemforprobabilistictimeintervalsofquasideterministicoutputandselfsimilarinputdatapacketflowintelecommunicationnetworks AT linecgi optimizationproblemforprobabilistictimeintervalsofquasideterministicoutputandselfsimilarinputdatapacketflowintelecommunicationnetworks AT voronkinra optimizationproblemforprobabilistictimeintervalsofquasideterministicoutputandselfsimilarinputdatapacketflowintelecommunicationnetworks AT voronkinra optimizationproblemforprobabilistictimeintervalsofquasideterministicoutputandselfsimilarinputdatapacketflowintelecommunicationnetworks AT slyusarevgv optimizationproblemforprobabilistictimeintervalsofquasideterministicoutputandselfsimilarinputdatapacketflowintelecommunicationnetworks AT slûsarevgv optimizationproblemforprobabilistictimeintervalsofquasideterministicoutputandselfsimilarinputdatapacketflowintelecommunicationnetworks AT govorovasv optimizationproblemforprobabilistictimeintervalsofquasideterministicoutputandselfsimilarinputdatapacketflowintelecommunicationnetworks AT govorovasv optimizationproblemforprobabilistictimeintervalsofquasideterministicoutputandselfsimilarinputdatapacketflowintelecommunicationnetworks |
| _version_ |
1842245460987740160 |