Development of a Modified Method of Network Traffic Forming

Kozlovskyi, Valerii; Yakymchuk, Natalia; Selepyna, Yosyp; Moroz, Serhii; Tkachuk, Anatolii

doi:10.35784/iapgos.3452

IAPGOS

2023

DOI: 10.35784/iapgos.3452

|View full text |Cite

Development of a Modified Method of Network Traffic Forming

Valerii Kozlovskyi

Natalia Yakymchuk

Yosyp Selepyna

et al.

Abstract: Based on the analysis of the statistical characteristics of heterogeneous network traffic of "Quadruple Play" mobile subscribers, it is shown that it cannot be represented by Poisson or Erlang distributions. It is shown that for such similar traffic, the rate of growth of the required buffer volume increases as the Hurst parameter increases. A method of adaptive traffic formation using the control of the length of intervals of the intensity of the arrival of data packets has been developed. Congestion manageme… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Зокрема Introduction. Nowadays telecommunication traffic in systems with packet data transfer is considered as a self-similar heavy-tail random process, see, for example, (Kozlovskiy et al, 2023). The problem of telecommunication traffic prediction is actual for telecommunications.…”

mentioning

confidence: 99%

Polynomial Solutions for the Kolmogorov–wiener Prediction of Modeled Smoothed Heavy-Tail Process

GOREV,

GUSEV,

KORNIIENKO

et al. 2024

View full text Add to dashboard Cite

Nowadays telecommunication traffic in systems with data packet transfer is considered as a heavy-tail random process. In a couple of rather simple models traffic is considered to be stationary one. In our recent papers we generated modeled heavy-tail data, which is based on the smoothing of the fractional Gaussian noise. In particular, the applicability if the continuous Kolmogorov–Wiener filter to the prediction of such data was investigated, the corresponding Wiener–Hopf integral equation was solved on the basis of the truncated Walsh function expansion. However, a question occurs – may another truncated orthogonal function expansion be applied to the problem under consideration? So, the corresponding investigation may be an actual question. In our recent papers we investigated theoretical fundamentals of the Kolmogorov–Wiener filter construction for different models, in particular, on the basis of the truncated polynomial expansion method and on the basis of the truncated trigonometric Fourier series expansion method. In this paper we restrict ourselves to the investigation of the applicability of the truncated polynomial expansion method to the problem under consideration, the corresponding method is based on the Сhebyshev polynomials of the first kind. The applicability of another polynomial or trigonometric expansions to the problem under consideration may be discussed in other papers. The aim of the work is to investigate the applicability of the Galerkin method based on the Chebyshev polynomials of the first kind to the Kolmogorov–Wiener prediction of smoothed heavy-tail data. The methodology consists in the solving of the Wiener–Hopf integral equation on the basis of the truncated polynomial expansion method which is based on the Chebyshev polynomials of the first kind. The scientific novelty consists in the proof of the fact that the Galerkin method based on the Chebyshev polynomials of the first kind may be applied to the Kolmogorov–Wiener prediction of smoothed heavy-tail data. The conclusions are as follows. The truncated polynomial expansion method based on the Chebyshev polynomials of the first kind may give reliable results in the framework of the Kolmogorov–Wiener prediction of smoothed heavy-tail data.

show abstract

mentioning

confidence: 99%

Polynomial Solutions for the Kolmogorov–wiener Prediction of Modeled Smoothed Heavy-Tail Process

GOREV,

GUSEV,

KORNIIENKO

et al. 2024

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Development of a Modified Method of Network Traffic Forming

Cited by 1 publication

References 19 publications

Polynomial Solutions for the Kolmogorov–wiener Prediction of Modeled Smoothed Heavy-Tail Process

Polynomial Solutions for the Kolmogorov–wiener Prediction of Modeled Smoothed Heavy-Tail Process

Contact Info

Product

Resources

About