Open AccessDETERMINATION OF PROBABILITY - TEMPORARY CHARACTERISTICS OF COMMUNICATION CHANNELS WHEN TRANSMITTING PRIORITY AND NON-PRIORITY DATA.
Author(s) -
Sh Karimov
Publication year - 2019
Publication title -
technical science and innovation/tehnika fanlari va innovaciâ
Language(s) - English
Resource type - Journals
eISSN - 2181-1180
pISSN - 2181-0400
DOI - 10.51346/tstu-01.19.3.-77-0037
Subject(s) - computer science , priority inheritance , priority queue , frame (networking) , channel (broadcasting) , priority ceiling protocol , queueing theory , real time computing , queue , transmission (telecommunications) , probabilistic logic , mode (computer interface) , computer network , algorithm , quality of service , telecommunications , artificial intelligence , dynamic priority scheduling , rate monotonic scheduling , operating system
The article discusses the issues of finding the main indicators of the quality of the communication channel in computer networks when transmitting priority and non-priority data at different frame lengths. To solve this problem, methods of the theory of queuing using Petri nets are proposed. The proposed method for calculating the temporal and probabilistic characteristics of computer networks allows determinining the main indicators of the quality of the channel in a stationary mode when transmitting priority and non-priority data of computing tools at various values of the input stream intensity. To simulate the transmission of priority and non-priority frames, a color temporary Petri net is proposed. An algorithm is proposed for determining the basic parameters of information transfer, based on the use of the Little formula and allowing one to determine the number of frames in a queue, the average time a frame has been in a queue, and other distinctive features of the algorithm include the use of the window mode. The proposed technique allows to reduce the loss of priority frames of trajectory information and ensuring their transmission in real time.