APPROACH OF PETRI NETS, MARKOV CHAINS AND THE QUEUEING THEORY AS LANGUAGES OF MATHEMATICAL MODELING AT THE SIMULATION OF DISCRETE SYSTEMS
Is dedicated to the study of Petri nets, Markov chains and queuing theory in order to build simulation mathematical models from conceptual models of computer network solutions. A slot and a task of building blocks are compared with the corresponding elements in the studied languages of mathematical modeling. It was found that network computer solutions can be characterized as systems with discrete events that have well-established modeling techniques. Most technical systems, telecommunication systems, computing systems and networks, are described in terms of discrete random processes using probabilistic methods. Mathematical models reflecting the structural and functional organization of the systems under study, built on the basis of queuing theory models, are widely used and can be analyzed by analytical, numerical, and statistical mathematical methods. Examples of random processes include data entry and transfer in a telecommunications network, in a wireless computer network, tasks and data exchange processes with external devices in a computing system, etc. The model usually includes those aspects of the system that are of interest or need to be studied.
Authors: W. Garate Gonzales
Direction: Informatics, Computer Technologies And Control
Keywords: Conceptual model, discrete events, modeling, simulation, network computer solutions
View full article