350 rub
Journal Achievements of Modern Radioelectronics №6 for 2014 г.
Article in number:
Finding the period of employment data network measuring complex polygon
Keywords:
data network
polygon-meter
idle and busy periods
GERT-network
parallelism programs
stationary regime
the queuing system M/G/1
Authors:
V.P. Koryachko - Dr. Sc. (Eng), Professor, Head of Department "Systems of automated design of computing facilities", Ryazan State Radio Engineering University. E-mail: sapr@rsreu.ru
O.V. Lukyanov - Post-graduate Student, Department of "Systems of automated design of computing facilities", Ryazan State Radio Engineering University, Head of the Department of FGUP "Space Rocket Centre "TsSKB - Progress" - "OKB Spektr". E-mail: luk_ov@mail.ru
A.P. Shibanov - Dr. Sc. (Eng), Professor, Department of "Systems of automated design of computing facilities", Ryazan State Radio Engineering University. E-mail: mail@shibanov.ryazan.ru
O.V. Lukyanov - Post-graduate Student, Department of "Systems of automated design of computing facilities", Ryazan State Radio Engineering University, Head of the Department of FGUP "Space Rocket Centre "TsSKB - Progress" - "OKB Spektr". E-mail: luk_ov@mail.ru
A.P. Shibanov - Dr. Sc. (Eng), Professor, Department of "Systems of automated design of computing facilities", Ryazan State Radio Engineering University. E-mail: mail@shibanov.ryazan.ru
Abstract:
The method of determination of intervals employment and downtime ground measuring complex, producing reception and transmission through the communication channel information from measuring systems. Mode of operation of the complex stationary. The input buffer of the communication channel come Poisson packet streams that are transmitted into the communication line in the order of their coming. The loss of packets in the buffer are excluded. Set distribution execution time of operations of the Protocol packet and the probability of their choice.
Reducing of the period of employment of the complex is achieved by decreasing the mean time of a packet transmission over the communication channel and its variation with the use of GERT-networks. This is possible if the time of passing of at least one path from source s to flow t random with a multimode probability distribution or with single-mode distribution with long-th "tail". Reduce the tails of the distributions can decrease the transition probabilities for cycles or reduction of the time of passing of these cycles.
Determined by the partial graph H GERT-network to:
- P a loop of the first order, not including the source s and runoff t, and has at least one common site of i-th a simple s-t-path;
- Q is a loop of the first order, not including the source s and runoff t, and has at least one public site with j-th simple s-t-path;
- any loop P and Q, belonging to different s-t-paths are not public sites.
Then a set of branches and units of the i-th simple s-t-path and the set of all loops P a partial graph H i-th a simple s-t-path.
Partial graphs H reflect the functioning of the parallel component of the protocol packet.
An example of transformation GERT-network protocol decomposed into partial graphs H. The output variable of the original GERT-network has a multimode distribution and unacceptable values of the mathematical expectation and dispersion. Is step-by-step improvement of the performance of GERT-network:
- are the distribution density of the output values graphs H;
- reduced transition probabilities cycles to obtain single-mode distributions graphs H;
- minimisation of the squares of the differences of the mathematical expectations of cases tea values that determine the fashion graphs H;
- reduced mathematical expectations and intervals 3σ output values graphs H;
- calculated the period of employment using the queuing system M/G/1.
Pages: 10-17
References
- Perepelkin D.А. Аlgoritm adaptivnoj uskorennoj marshrutizatsii na baze protokola OSPF pri dinamicheskom dobavlenii ehlementov korporativnoj seti // Vestnik Ryazanskogo gosudarstvennogo radiotekhnicheskogo universiteta. 2010. № 34. S. 65-71.
- Perepelkin D.А. Аlgoritm adaptivnoj uskorennoj marshrutizatsii na baze protokola OSPF pri dinamicheskom otkaze ehlementov korporativnoj seti // Vestnik Ryazanskogo gosudarstvennogo radiotekhnicheskogo universiteta. 2011. № 37. S. 53-58.
- Perepelkin D.А. Аlgoritm parnykh perestanovok marshrutov na baze protokola OSPF pri dinamicheskom podklyuchenii uzlov i linij svyazi korporativnoj seti // Vestnik Ryazanskogo gosudarstvennogo radiotekhnicheskogo universiteta. 2013. № 4-1 (46). S. 67-75.
- Izhvanov YU.L., Koryachko V.P., SHibanov А.P., Saprykin А.N., Luk'yanov O.V. Optimizatsiya setej s dozirovannoj balansirovkoj nagruzki i piringovymi kanalami // Vestnik Ryazanskogo gosudarstvennogo radiotekhnicheskogo universiteta. 2013. № 1 (43). S. 67-74.
- Pritsker A.B. GERT Graphical evaluation and review technique. Memorandum RM-4973-NASA. 1966.
- SHibanov А.P. Nakhozhdenie plotnosti raspredeleniya vremeni ispolneniya GERT-seti na osnove ehkvivalent-nykh uproshhayushhikh preobrazovanij // Аvtomatika i telemekhanika, 2003. № 2. S. 117-126.
- Shibanov A.P. Finding the distribution density of the time taken to fulfill the GERT network on the basis of equivalent simplifying transformation. Automation and Remote Control. Plenum Press New York, NY, USA. February 2003. V. 64. № 2. P. 279-287.
- SHibanov А.P., Kravchuk N.V. Ispol'zovanie modelej GERT pri optimizatsii komp'yuternykh setej // Vestnik Ryazanskogo gosudarstvennogo radiotekhnicheskogo universiteta. 2007. № 20. S. 69-75.
- SHibanov А.P. Metod ehkvivalentnykh uproshhayushhikh preobrazovanij GERT-setej i ego prilozheniya // Vestnik Ryazanskogo gosudarstvennogo radiotekhnicheskogo universiteta. 2012. № 39-2. S. 76-83.
- Koryachko V.P., SHibanov А.P., SHibanov V.А. CHislennyj metod nakhozhdeniya zakona raspredeleniya vykhodnykh velichin GERT-seti. Informatsionnye tekhnologii. 2001. № 7. S. 16-21.
- Klejnrok L. Teoriya massovogo obsluzhivaniya / Per. s angl. M.: Mashinostroenie. 1979.