CC BY
13
UDC 621.396.67
Siberian Journal of Science and Technology. 2017, Vol. 18, No. 2, P. 294-299
EMPIRICAL RELATIONSHIP FOR QUEUE LENGTH ESTIMATION
IN A SYSTEM WITH FRACTAL SHOT INPUT
N. G. Trenogin1, M. N. Petrov2*, D. E. Sokolov1
1Macroregional branch "Sibir" of PJSC Rostelecom 53, M. Gorky St., Novosibirsk, 630099, Russian Federation 2Reshetnev Siberian State University of Science and Technology 31, Krasnoyarsky Rabochy Av., Krasnoyarsk, 660037, Russian Federation
*E-mail: ettk@bk.ru
Traffic in modern data networks and information systems are most adequately described by different classes of fractal models. This kind of models takes into account the following key characteristics of traffic as high variability events grouping and explicit correlation structure on different time scales. Fractal shot process FSNDP, referring to the fractal point process is sufficiently accurate approximation of the network load at individual workstations or small workgroups, is defined with five numerical parameters, with known estimating algorithms on available samples (based on actual traffic dumps). Studies based on queueing system simulation with input FSNDP stream managed to establish a stable relationship between the change in each of the input parameters and the average queue length in the system. Confirmed direct correlation queue length of the parameter characterizing the amplitude of the individual load bursts, found an inverse relationship of the index related to the Hurst parameter and master degree offractal properties. Based on the identified dependencies, obtained empirical relations between parameters of FSNDP process and the average queue length in single-channel queueing system with unlimited queue and deterministic service discipline FSNDP/D/1. These relationships allow to estimate the average volume of buffer used and the average delay introduced by the network equipment in the load conditions expressed fractal properties from measurements of real traffic. The presence of the formulae increases the importance of traffic models based on FSNPD, since it makes possible to perform a full cycle analysis of queueing systems and queueing networks without involving the simulation methods.
Keywords: fractal traffic, fractal shot-noise driven Poisson, FSNDP, queueing system, simulation.
Сибирский журнал науки и технологий. 2017. Т. 18, № 2. С. 294-299
ЭМПИРИЧЕСКИЕ СООТНОШЕНИЯ ДЛЯ ОЦЕНКИ ДЛИНЫ ОЧЕРЕДИ В СИСТЕМЕ С ФРАКТАЛЬНЫМ ДРОБОВЫМ ВХОДНЫМ ПОТОКОМ
Н. Г. Треногин1, М. Н. Петров2*, Д. Е. Соколов1
^акрорегиональный филиал «Сибирь» ПАО «Ростелеком» Российская Федерация, 630099, г. Новосибирск, ул. М. Горького, 53 2Сибирский государственный университет науки и технологий имени академика М. Ф. Решетнева Российская Федерация, 660037, просп. им. газ. «Красноярский рабочий», 31
*E-mail: ettk@bk.ru
Трафик в современных сетях передачи данных и информационных системах наиболее адекватно описывается различными классами фрактальных моделей. Этот класс моделей учитывает такие ключевые свойства трафика, как высокая вариативность, группировка событий и выраженная корреляционная структура на различных временных масштабах. Фрактальный дробовой процесс FSNDP, относящийся к фрактальным точечным процессам, является достаточно точной аппроксимацией сетевой нагрузки на уровне отдельных рабочих станций или малых рабочих групп, описывается пятью числовыми параметрами, для которых известны алгоритмы оценки по имеющимся выборкам (на основе реальных дампов трафика). В ходе исследований на основе имитационного моделирования системы массового обслуживания, на вход которой поступает поток FSNDP, удалось установить устойчивые зависимости между изменением каждого из параметров входного потока и средней длиной очереди в системе. Подтверждена прямая зависимость длины очереди от параметра, характеризующего амплитуду отдельных всплесков нагрузки, обнаружена обратная зависимость от показателя, связанного с параметром Херста и задающего степень выраженности фрактальных свойств. На основании выявленных зависимостей получены эмпирические соотношения, связывающие параметры потока FSNDP и среднюю длину очереди в одноканальной системе массового обслуживания с неограниченной очередью и детерминированной дисциплиной обслуживания FSNDP/D/1. Полученные соотношения позволяют оценить средний используемый объем буфера и среднюю вносимую задержку на сетевом оборудовании в условиях нагрузки
с выраженными фрактальными свойствами по данным измерений реального трафика. Наличие соотношений повышает ценность моделей трафика на основе ЕБЫРБ, так как дает возможность проведения полного цикла анализа систем и сетей массового обслуживания без привлечения аппарата имитационного моделирования.
Ключевые слова: фрактальный трафик, фрактальный дробовой процесс, ЕБЫБР, СМО, имитационное моделирование.
Introduction. In recent years the traffic of data communication networks, also as a part of distributed information systems, characterized by high variability and explicit correlation properties, is described by various fractal models [1-4].
Unlike geometrical fractals, determination of which is based on geometrical similarity of a part of an object to the whole, with fractal random processes - the part of a path is similar to the whole statistically: when averaging by time at various scales, the process substantially keeps values of the first and second order statistics, i. e. doesn't smooth out, doesn't lose variability and correlation structure.
Fractal or self-similar properties of the network traffic, revealed originally on the Ethernet networks and broadband access (BBA) in the 1990s [5; 6] explains feeble suitability of classical Markov methods and models of the queueing theory for simulation of the modern high-loaded systems and data communication networks. First of all it is about the explicit correlation structure - the phenomenon of an after-effect which by definition neglects Markov models. However, despite adequacy of traffic streams description using fractal models, receiving of expressions suitable for practical calculations for the queueing system models is connected with considerable difficulties. Several options of formulas for queueing system models with the elementary fractal sequence on the basis of fractional Brownian motion [7; 8] are known, though this flow can be considered adequate for the description of backbone segments traffic, not for distributed information systems at the level of individual workstations and small workgroups. Also there are solutions based not on specific sequence models, but on their universal statistical characteristics [9].
On the basis of simulation modeling the authors managed to receive the ratios suitable for calculation of queue volume in queueing systems with an input flow using the fractal shot process and therefore, for capacity of the appropriate fragments of packet-switching networks estimation.
Fractal shot process (FSNDP) model. According to the result of the research of the Ethernet-traffic real traces, as the authors have shown [10-12] earlier, the adequate model of packet flow in distributed system of data processing with the remote workstations, one of fractal point processes, namely the fractal shot process which is also called FSNDP (Fractal Shot Noise Driven Poisson), belonging to the category of double stochastic Poisson point processes, can be used. For the first time the model of the network traffic based on this process was suggested by S. Lowen and B. Ryu [13, 14]. For the process there are approaches to statistical parameterization on the received dumps of the real traffic, it also can be generated using the correct and moderately labor-consuming calculations within the set parameters.
Time varying rate of FSNDP process is set by the continuous accidental process - fractal shot noise which is received by filtering classical Poisson process.
FSNDP process is completely defined by five numerical parameters p, K, A, B), having the following value.
Primary Poisson stream {ti} with constant rate ^ becomes the input to a linear filter with impulse response function
h(t) = fKrP,t e (A,B), (1) [ 0, t g (A, B),
where p is defined by the level of the process self-similarity; A, B - non-negative cut-off parameters; K - the positive constant, determining the amplitude of total process. The filter produces the fractal shot noise
I(t) = X h(t -1г),
(2)
considered as time varying rate for the second Poisson point process, which output is the FSNDP.
FSNDP process acquires steadily self-similar properties under a condition that A << B and A, close enough to zero. With practical modeling it is usually accepted that A = 0 or A = 10-7.
Parameter p is connected with Hurst parameter H, i. e. defines degree of expressiveness of fractal properties of the resultant process:
H = 3/2-p.
(3)
Hurst parameter of H is the most general characteristic of any fractal process and can accept values from an interval [0.5; 1). Value 0.5 means total absence of fractal properties, growth of H towards 1 - strengthening of expressiveness of self-similar character.
General comments on the approach to simulation modeling. Earlier, on the basis of the analysis of really operating distributed information systems network traffic dumps the fractal shot process of FSNDP was considered to be an adequate model of such traffic. Also numerous estimates of parameters of the FSNDP model on real dumps have been carried out; for generating the artificial sequences in this research the values which are close to the values characterizing some typical dumps of the real traffic [12$ 15], but rounded for simplicity were used. Values ^ = 0.1, K = 10, A = 0, B = 100, p = 0.9 have been accepted as a basic set of parameters.
Earlier it has also been confirmed that the stream with constant (deterministic - D) service rate corresponds the most to the real network load for client-server data processing system, i. e. the FSNDP/D/1 system is the most suitable for modeling. In terms and units of information transfer the volume of a packet is accepted as 100 bytes that is also close to real estimates.
The general approach to the research of influence of model parameters on the behavior of the queue is based on generating of pseudorandom sequences of FSNDP stream events with the variation of one or several parameters of rather basic set and use of these sequences as an input stream of simulation model of a single-channel server queueing system with simulated continuous time.
All generated sequences have the symbolic duration of 7200 sec. (2 hours) and volume, depending on the varied parameters, from 25 thousand prior to 450 thousand events.
Influence of process parameters on the average length of the queue. Parameter K characterizes amplitude of the resultant process's rate bursts; therefore it is obvious that correlation between K and average queueing load p will be direct (fig. 1).
Simulation modeling allows to assume direct proportionality of the average queue length estimation from K.
Direct influence on the height of the curve queueing system load for p exponent; respectively, the reverse influence of Hurst parameter H connected with this indicator is determined. This result, which is steadily shown during the runs of simulation model for various values of the FSNDP parameters, in general differs from the popular conception that for the general case of the fractal traffic a higher degree of self-similarity results in larger queue fill (buffer). The cause of alternative effect for a special FSNDP case needs a future research (fig. 2).
1 600 1 400 1 200 1 000 ( 800 600 400
Influence of primary (auxiliary) Poisson sequence ^ on characteristics of the queue length has appeared to be significantly lower than of the two above described parameters, and is demonstrated mainly in the field of high load - at p > 0.8. According to the earlier research, such loading at a fractal input in practice means the mode close to non-stationary, and doesn't allow traffic and buffer parameters more or less precise estimation. Curve buffer fill for values differing by factor 16 are given in fig. 3.
The only parameter of FSNDP process which influence on the queue under realistic values of the other parameters has not been revealed is B. Abcense of the explicit influence corresponds to physical sense of this value: duration of the decreasing intensity intervals, after which the cut-off is done, obviously shouldn't have dramatic impact on queueing system behavior, comparable with the influence of other parameters.
Empirical ratios for the queue length estimation. By comparison of calculated values with the values received as a result of simulation modeling of queueing system behavior with a fractal shot input of FSNDP it is confirmed that under real values of the FSNDP parameters the estimation of the average queue length can be expressed by the ratio
q (p) = C
K p
(4)
H 1 -p
where C - positive constat, H - Hurst parameter connected with the process p parameter value by ratio (3).
1 2 3
ц 0,1 0,1 0,1
в 0,9 0,9 0,9
K 10 5 (1/2) 20 (X2)
A 0 0 0
B 100 100 100
Fig. 1. The average length of the queue under parameter K variation Рис. 1. Средняя длина очереди при варьировании параметра К
т
/
1
/
/ /
/ /
УУ
1 2 3
ц 0,1 0,1 0,1
в 0,9 0,8 ▼ 0,95 ▲
K 10 10 10
A 0 0 0
B 100 100 100
H 0,6 0,7 ▲ 0,55 ▼
0,2
0,8
Fig. 2. The average length of the queue under parameter в variation Рис. 2. Средняя длина очереди при варьировании показателя в
p
600
2
1 400
3
200
000
800
600
400
200
0
0,4
0,6
р
In the expression there are no parameters B and significant effect of which on the queue under real conditions isn't revealed in the simulation modeling. However, since ^ under p > 0.8 can after all impact the queue length, it must be kept in mind that the queue estimation accuracy using this ratio in the queueing modes close to non-stationary mode, will decrease.
Value of the constant which equals
1 300 1 200 1 100 1 000 900 800 ( 700 " 600 500 400 300 200 100 0
C = 1
(5)
in the given simulation experiments has shown rather accurate coincidence of experimental and calculated curves for various parameters of the FSNDP modeled fractal shot process.
In fig. 4. examples of curves of the buffer fill q(p) for parameter values ^ = 0.1, K = 10, A = 0, B = 100 and P = 0.8, p = 0.9 are given, under the constant value according to the assumption (5).
It should be noticed that in the modes of minor load calculated values are slightly higher than those received by simulation modeling, i. e. the received estimation can be considered as the upper bound (fig. 4).
1 2
ц 0,025 0,4
в 0,9 0,9
K 10 10
A 0 0
B 100 100
Fig. 3. The average length of the queue for significantly different parameter ц Рис. 3. Средняя длина очереди при для существенно отличающихся значений ц
600 550 500 450 400
Nq
350
300 250 200 150 100 50 0
// i
я 1 II
// я ! :1
я / '< г / / 1 /
/ ; | : 1 // .....Л,/
/ / / / / / .• /
г*
0,2
0,4
0,6
0,8
1
Р
0.9
0.9 (calculation) 0.8
0.8 (calculation)
Fig. 4. Simulation and calculation curves of queue lengths under various в Рис. 4. Имитационные и расчетные кривые длины очереди при различных в
Having combined (3), (4) and (5), it is possible to express the ratio for the average queue length estimation in single-server queueing system with fractal shot FSNDP process and determined maintenance time (FSNDP/D/1) input as:
( ) 1 K q (p) = т
p
2 H 1 -p
or
q (p) =
к
к
2(32-P)1 -p 3-2P1 -p-
(6)
(7)
Conclusion. The offered expressions for the queue length estimation are very low resource-consuming in computation. It allows to use them both in calculation and optimization algorithms to determine throughput of data communication network elements with fractal traffic flows as well as time delays caused by these elements.
Receiving explicit ratios increases the value of the FSNDP traffic model. For this process there are ways of computer parameterization, based on available process path fragments (network traffic dumps); algorithms of the artificial sequences generating with the known parameters. Now there is also an opportunity to calculate the queue and delays in an explicit form, i. e. to carry out a full cycle of model analysis without simulation, or with the minimum use of it.
Also, there are grounds for further research, such as receiving of estimates for the queue statistical characteristics of the second order; and also development of definition methods of queueing networks with fractal flows, in particular on the basis of tensor approaches [15], based on earlier established property of keeping a flow after servicing in the system with queue.
References
1. Shelukhin O., Tenyakshev A., Osin A. Fraktal'nye protsessy telekommunikatsiyakh [Fractal processes in telecommunications. Moscow, Radiotechnica Publ., 2004. 480 p.
2. Tsybakov B. S. [Teletraffic model based on Self-similar random process]. Radiotechnica. 1999, No. 5, P. 24-31 (In Russ.).
3. Neiman V. I. [New direction in teletraffic theory]. Electrosvyaz. 1998, No. 7, P. 27-30 (In Russ.).
4. Neiman V. I. [Self-similar processes and their application in teletraffic theory]. Trudy Mezhdunarodnoy Akademii Svyazi. 1999, No. 1, P. 11-15 (In Russ.).
5. Leland W. E., Taqqu M. S., Willinger W., and Wilson, D. V. On the selfsimilarnature of Ethernet traffic (extended version). IEEE/ACM Trans. Networking. 1994, Vol 2 (1), P. 1-15.
6. Norros I. The Management of Large Flows of Connectionless Traffic on the Basis of Self-Similar Modeling. ICC '95, IEEE International Conference on Communications. Seattle. 1995, P. 451-455.
7. Norros I. On the use of fractional Brownian motion in the theory of connectionless networks. IEEE J. Sel. Areas Commun. 1995, 13 (6), P. 953-962.
8. Chen J., Bhatia H. S., Addie R. G, Zukerman M. Statistical characteristics of queue with fractional Brownian
motion input. Electronics Letters. 2015, Vol. 51 (9), P. 699-701.
9. Petrov M. N., Ponomaryov D. Y. [Self-similarity in queueing systems with limited buffer]. Electrosvyaz. 2002, No. 2, P. 35-39 (In Russ.).
10. Sokolov D. E., Trenogin N. G. [The nature of the network traffic to the client site distributed client-server system]. Materialy mezhvuzovskoy nauchno-tekhnicheskoy konferentsii "Upravlyayushchie i vychislitel'nye sistemy. Novye tekhnologii" [International scientific-technical conference Informatics and problems of telecommunications]. Novosibirsk, SibSUTIS Publ., 2001, P. 34-35 (In Russ.).
11. Sokolov D. E. [Modeling of load in a client-server systems based on fractal processes]. Materialy mezhvu-zovskoy nauchno-tekhnicheskoy konferentsii "Upravlyayushchie i vychislitel'nye sistemy. Novye tekhnologii" [Inter-university scientific-technical conference "Control and computer systems. New technologies"]. Vologda, 2001. P. 59-60 (In Russ.)
12. Sokolov D. E., Trenogin N. G. [Fractal properties of traffic in an actual two-tier data-processing system]. Sovremennye problemy informatizatsii v tekhnike i tech-nologiyakh. [Modern problems of informatization in technics and technologies]. Voronezh, Nauchnaya kniga Publ., 2004, No. 10, P. 264-265 (In Russ.).
13. Ryu B. K. Fractal Network Traffic: From Understanding to Implications. Ph.D. thesis. Columbia University, 1996. 143 p.
14. Ryu B., Lowen S. Modeling, analysis and simulation of self-similar traffic using the fractal-shot-noise-driven Poisson process. Proc. IASTED Modeling and Simulation, Pittsburgh, PA. 1995, P. 1-4.
15. Trenogin N. G., Velovatiy E. A., Petrov M. N. [Operation and business support system for telecommunication enterprise based on tensor methodology of system analysis]. Electrosvyaz. 2013, No. 1, P. 17-20 (In Russ.).
Библиографические ссылки
1. Шелухин О. И., Тенякшев А. М., Осин А. В. Фрактальные процессы в телекоммуникациях : монография. М. : Радиотехника, 2003. 480 с.
2. Цыбаков Б. С. Модель телетрафика на основе самоподобного случайного процесса // Радиотехника. 1999. № 5. С. 24-31.
3. Нейман В. И. Новое направление в теории телетрафика // Электросвязь. 1998. № 7. С. 27-30.
4. Нейман В. И. Самоподобные процессы и их применение в теории телетрафика // Тр. Междунар. Академии связи. 1999. № 1. С.11-15.
5. On the selfsimilarnature of Ethernet traffic (extended version) / W. E. Leland [et al.] // IEEE/ACM Trans. Networking, 1994. Vol. 2 (1). P. 1-15.
6. Norros I. The Management of Large Flows of Connectionless Traffic on the Basis of Self-Similar Modeling // ICC '95, IEEE International Conference on Communications, Seattle. 1995. P. 451-455.
7. Norros I. On the use of fractional Brownian motion in the theory of connectionless networks // IEEE J. Sel. Areas Commun., 1995. Vol. 13. (6). P. 953-962.
8. Statistical characteristics of queue with fractional Brownian motion input / J. Chen [et al.] // Electronics Letters. 2015. Vol. 51 (9). P. 699-701.
9. Петров М. Н., Пономарев Д. Ю. Самоподобие в системах массового обслуживания с ограниченным буфером // Электросвязь. 2002. № 2. С. 35-39.
10. Соколов Д. Е., Треногин Н. Г. Характер сетевого трафика на клиентском участке распределенной клиент-серверной системы // Информатика и проблемы телекоммуникаций: материалы Междунар. науч.-техн. конф. ; СибГУТИ. Новосибирск, 2001. С. 34-35.
11. Соколов Д. Е. Моделирование нагрузки в клиент-серверных системах на основе фрактальных процессов // Управляющие и вычислительные системы. Новые технологии: материалы межвузовской науч.-техн. конф. ; Вологда, 2001. С. 59-60.
12. Соколов Д. Е., Треногин Н. Г. Фрактальные свойства трафика в действующей двухзвенной системе обработки данных // Современные проблемы ин-
форматизации в технике и технологиях : сб. тр. Воронеж : Научная книга, 2004. Вып. 10. С. 264-265.
13. Ryu B. K. Fractal Network Traffic: From Understanding to Implications: Ph. D. thesis. Columbia University, 1996. 143 p.
14. Ryu B., Lowen S. Modeling, analysis and simulation of self-similar traffic using the fractal-shot-noise-driven Poisson process // Proc. IASTED Modeling and Simulation. Pittsburgh, PA, 1995. P. 1-4.
15. Треногин Н. Г., Веловатый Е. А., Петров М. Н. Система поддержки операционной и бизнес-деятельности предприятия связи с использованием тензорной методологии анализа систем // Электросвязь. 2013. № 1. С. 17-20
© Trenogin N. G., Petrov M. N., Sokolov D. E., 2017
