The Algorithm to Select Security Classes for Objects in Distributed Information Systems and Place Data in the Objects Through Reducing the Optimization Problem to the Theory of Games with Non-conflicting Interests

The Algorithm to Select Security Classes for Objects in Distributed Information Systems and Place Data in the Objects Through Reducing the Optimization Problem to the Theory of Games with Non-conflicting Interests

<p>Modern methods to solve the practical problems related to the information security system design in multipurpose distributed systems often use optimization models. The paper formulates a problem statement of bilinear Boolean programming with the quality score that determines the level of th...

Full description

Bibliographic Details
Main Authors: A. Yu. Bykov, F. A. Panfilov, A. V. Hovrina
Format: Article
Language:Russian
Published: MGTU im. N.È. Baumana 2016-01-01
Series:Nauka i Obrazovanie
Subjects:
information security
distributed information system
discrete optimization
game with nonconflicting interests
Nash equilibrium
Online Access:http://technomag.edu.ru/jour/article/view/76

Internet

http://technomag.edu.ru/jour/article/view/76

Similar Items